Image de couverture de livre

An Upper Bound on Grothendieck's Constant

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Heilman, Steven
Format:	Preprint
Publié:	2026
Sujets:	Functional Analysis Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Lower Bound for Grothendieck's Constant
par: Heilman, Steven
Publié: (2026)

The Localization Method for High-Dimensional Inequalities
par: Kook, Yunbum, et autres
Publié: (2025)

The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms
par: Manoj, Naren Sarayu, et autres
Publié: (2023)

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms
par: Jia, He, et autres
Publié: (2020)

Random zero sets with local growth guarantees
par: Chang, Alan, et autres
Publié: (2024)

Faster logconcave sampling from a cold start in high dimension
par: Kook, Yunbum, et autres
Publié: (2025)

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
par: Huiberts, Sophie, et autres
Publié: (2022)

Zeroth-order Logconcave Sampling
par: Kook, Yunbum, et autres
Publié: (2025)

An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle
par: Caporrella, Matteo, et autres
Publié: (2026)

Two New Upper Bounds for the Maximum k-plex Problem
par: Zheng, Jiongzhi, et autres
Publié: (2023)

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
par: Manea, Florin, et autres
Publié: (2024)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
par: Gaudio, Julia, et autres
Publié: (2026)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
par: Hwang, Samuel, et autres
Publié: (2024)

Improved Upper Bounds for the Directed Flow-Cut Gap
par: Bodwin, Greg, et autres
Publié: (2026)

Interlacing Polynomial Method for the Column Subset Selection Problem
par: Cai, Jian-Feng, et autres
Publié: (2023)

Learning low-degree quantum objects
par: Arunachalam, Srinivasan, et autres
Publié: (2024)

Constant sensitivity on the CDAWGs
par: Hamai, Rikuya, et autres
Publié: (2025)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
par: Jin, Mingming, et autres
Publié: (2023)

Constant-Stretch Rounding on the Hypersimplex
par: Anari, Nima, et autres
Publié: (2026)

Maximizing the Minimum Eigenvalue in Constant Dimension
par: Brown, Adam, et autres
Publié: (2024)

Bounding Width on Graph Classes of Constant Diameter
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Counting Patterns in Degenerate Graphs in Constant Space
par: Komarath, Balagopal, et autres
Publié: (2025)

A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros
par: Sanjoyo, B. A., et autres
Publié: (2025)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
par: Zhou, Jianqi, et autres
Publié: (2025)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
par: Dai, Jiangqi, et autres
Publié: (2025)

In-Place BWT and Lyndon Array Construction in Constant Space
par: Louza, Felipe A., et autres
Publié: (2025)

Optimal Static Dictionary with Worst-Case Constant Query Time
par: Hu, Yang, et autres
Publié: (2024)

Enumerating m-Length Walks in Directed Graphs with Constant Delay
par: Adamson, Duncan, et autres
Publié: (2024)

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
par: Nezhad, Sina Bagheri, et autres
Publié: (2025)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
par: Amsel, Noah, et autres
Publié: (2026)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
par: Suslo, Tomasz
Publié: (2005)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
par: Drineas, Petros, et autres
Publié: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
par: Chen, Tyler
Publié: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
par: Netay, Igor V.
Publié: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
par: Chen, Tyler, et autres
Publié: (2024)

Stability of the Lanczos Method for Matrix Function Approximation
par: Musco, Cameron, et autres
Publié: (2017)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
par: Chen, Tyler, et autres
Publié: (2022)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
par: Bentert, Matthias, et autres
Publié: (2025)

Fixed-sparsity matrix approximation from matrix-vector products
par: Amsel, Noah, et autres
Publié: (2024)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
par: Balabanov, Oleg, et autres
Publié: (2022)