:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Csirmaz, E. P., Csirmaz, L.
Format:	Preprint
Published:	2025
Subjects:	Information Theory 05B35, 26A12, 52B12, 90C29, 94A17, 52B40, 90C27
Online Access:	https://arxiv.org/abs/2512.23316
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exploring the entropic region
by: Csirmaz, Laszlo
Published: (2025)

On the Supremum of Singleton Ratios in Submodular Functions
by: Csirmaz, Laszlo
Published: (2026)

Attempting the impossible: enumerating extremal submodular functions for n=6
by: Csirmaz, Elod P., et al.
Published: (2024)

Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
by: Bruckamp, Justus, et al.
Published: (2024)

Many rays of the submodular cone
by: Loho, Georg, et al.
Published: (2025)

From linear programming to colliding particles
by: Black, Alexander E., et al.
Published: (2024)

Binary Cyclic Transversal Polytopes
by: Frede, Jonas, et al.
Published: (2024)

Biobjective optimization with M-convex functions
by: Fukuda, Ellen H., et al.
Published: (2025)

On cone partitions for the min-cut and max-cut problems with non-negative edges
by: Nikolaev, Andrei V., et al.
Published: (2023)

On 1-skeleton of the cut polytopes
by: Nikolaev, Andrei V.
Published: (2024)

Unimodality of the number of paths per length on polytopes: Examples, counter-examples, and central limit theorem
by: Juhnke, Martina, et al.
Published: (2025)

On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
by: Black, Alexander E., et al.
Published: (2023)

Global convergence of the subgradient method for robust signal recovery
by: Cai, Zesheng, et al.
Published: (2026)

Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
by: Black, Alexander E.
Published: (2024)

The Boolean polynomial polytope with multiple choice constraints
by: Shao, Sihong, et al.
Published: (2024)

Rigidity of Circle Packings with Flexible Radii
by: Connelly, Robert, et al.
Published: (2022)

Lower bounds for cube-ideal set-systems
by: Abdi, Ahmad, et al.
Published: (2025)

The Best Ways to Slice a Polytope
by: Brandenburg, Marie-Charlotte, et al.
Published: (2023)

The Chain Matrix of Bouquets of Geometric Lattices and its Determinant
by: Hochstättler, Winfried, et al.
Published: (2024)

On the connected blocks polytope
by: Bruckamp, Justus, et al.
Published: (2023)

Vertex generated polytopes
by: Artstein-Avidan, Shiri, et al.
Published: (2024)

The vector linear program solver Bensolve -- notes on theoretical background
by: Löhne, Andreas, et al.
Published: (2015)

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
by: Löhne, Andreas, et al.
Published: (2015)

Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions
by: Li, Rupert
Published: (2022)

Quotients of M-convex sets and M-convex functions
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024)

On the Diameter of a 2-Sum of Polyhedra
by: Borgwardt, Steffen, et al.
Published: (2023)

Illumination number of 3-dimensional cap bodies
by: Arman, Andrii, et al.
Published: (2025)

Stable low-rank matrix recovery from 3-designs
by: Gilles, Timm
Published: (2025)

Identifiability and Exact Reconstruction of the Optimal Transport Cost on Finite Spaces
by: González-Sanz, Alberto, et al.
Published: (2024)

Determining inscribability of polytopes via rank minimization based on slack matrices
by: Chen, Yiwen, et al.
Published: (2025)

Unimodular polytopes and column number bounds on polytopal totally unimodular matrices via Seymour's decomposition theorem
by: Nill, Benjamin
Published: (2024)

Sparse Recovery from Group Orbits
by: Gilles, Timm, et al.
Published: (2025)

Two-count interval representation of a permutation
by: Biró, Csaba, et al.
Published: (2024)

The length polyhedron of an interval order
by: Biró, Csaba, et al.
Published: (2024)

Generalized outer linearizations and extremal properties of rotational epi-symmetrizations
by: Hoehner, Steven, et al.
Published: (2026)

Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
by: Cai, HanQin, et al.
Published: (2024)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
by: Borgwardt, Steffen, et al.
Published: (2025)

The density of planar sets avoiding unit distances
by: Ambrus, Gergely, et al.
Published: (2022)

Transformed $\ell_p$ Minimization Model and Sparse Signal Recovery
by: Li, Ziwei, et al.
Published: (2026)

Covering in Hamming and Grassmann Spaces: New Bounds and Reed--Solomon-Based Constructions
by: Riasat, Samin, et al.
Published: (2025)