Imagen de Portada

A Lower Bound for Grothendieck's Constant

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Heilman, Steven
Formato:	Preprint
Publicado:	2026
Materias:	Functional Analysis Data Structures and Algorithms 15A60, 15A45, 90C27, 90C22, 42C10, 68Q17
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Interlacing Polynomial Method for the Column Subset Selection Problem
por: Cai, Jian-Feng, et al.
Publicado: (2023)

A semidefinite programming characterization of the Crawford number
por: Friedland, Shmuel, et al.
Publicado: (2024)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
por: Goerigk, Marc, et al.
Publicado: (2026)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
por: Friedland, Shmuel
Publicado: (2023)

Commutation principles for optimization problems involving strictly Schur-convex functions in Euclidean Jordan algebras
por: Massey, Pedro G., et al.
Publicado: (2025)

On semidefinite programming characterizations of the numerical radius and its dual norm
por: Friedland, Shmuel, et al.
Publicado: (2023)

Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
por: Datta, Swarnalipa, et al.
Publicado: (2026)

Interlacing Polynomial Method for Matrix Approximation via Generalized Column and Row Selection
por: Cai, Jian-Feng, et al.
Publicado: (2023)

Modern column generation for estimating single- and multi-purchase ranked list choice models
por: Costa, Luciano, et al.
Publicado: (2026)

Information-theoretic coordinate subset and partition selection of multivariate Markov chains via submodular optimization
por: Lai, Zheyuan, et al.
Publicado: (2025)

The Subspace Flatness Conjecture and Faster Integer Programming
por: Reis, Victor, et al.
Publicado: (2023)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
por: da Silva, Renan F. F., et al.
Publicado: (2026)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
por: Liu, Bowen
Publicado: (2025)

Worst-Case Learning under a Multi-fidelity Model
por: Foucart, Simon, et al.
Publicado: (2024)

Optimal Online Bipartite Matching in Degree-2 Graphs
por: Bhangale, Amey, et al.
Publicado: (2025)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
por: Barkel, Mathijs, et al.
Publicado: (2026)

Grassmannian optimization is NP-hard
por: Lai, Zehua, et al.
Publicado: (2024)

From approximate to exact integer programming
por: Dadush, Daniel, et al.
Publicado: (2022)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
por: da Silva, Renan Fernando Franco, et al.
Publicado: (2026)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
por: Komusiewicz, Christian, et al.
Publicado: (2023)

Finding Short Paths on Simple Polytopes
por: Black, Alexander E., et al.
Publicado: (2026)

Centrality measures and opinion dynamics in two-layer networks with replica nodes
por: Zhao, Chi, et al.
Publicado: (2024)

Probabilistic frames and Wasserstein distances
por: Chen, Dongwei, et al.
Publicado: (2025)

A simple Path-based LP Relaxation for Directed Steiner Tree
por: Pashkovich, Kanstantsin, et al.
Publicado: (2026)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
por: Simmons, Miles, et al.
Publicado: (2026)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
por: Bansal, Ishan, et al.
Publicado: (2024)

Degree Sequence Optimization and Extremal Degree Enumerators
por: Onn, Shmuel
Publicado: (2024)

Circuit and Graver Walks and Linear and Integer Programming
por: Onn, Shmuel
Publicado: (2024)

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design
por: Mokhtari, Yacine
Publicado: (2025)

Tensors, entanglement, separability, and their complexity
por: Friedland, Shmuel
Publicado: (2025)

Gabor windows supported on $[-1,1]$ and construction of compactly supported dual windows with optimal frequency localization
por: Lemvig, Jakob, et al.
Publicado: (2019)

On the Complexity of the Bilevel Shortest Path Problem
por: Henke, Dorothee, et al.
Publicado: (2024)

Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states
por: Britz, Jonas, et al.
Publicado: (2025)

Polyhedral approach to weighted connected matchings in general graphs
por: Samer, Phillippe, et al.
Publicado: (2023)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
por: Petrov, Petar P.
Publicado: (2022)

Generalized Interlacing Families: New Error Bounds for CUR Matrix Decompositions
por: Cai, Jian-Feng, et al.
Publicado: (2025)

Optimising two-block averaging kernels to speed up Markov chains
por: Lim, Ryan J. Y., et al.
Publicado: (2026)

On additive averaging kernels for finite Markov chains
por: Lim, Ryan J. Y., et al.
Publicado: (2026)

The Competition Complexity of Prophet Inequalities
por: Brustle, Johannes, et al.
Publicado: (2024)

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
por: Subiñas, Sergio Muñiz, et al.
Publicado: (2025)