Related papers: On the Circuit Diameter Conjecture

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

Klee's measure problem (computing the volume of the union of $n$ axis-parallel boxes in $\mathbb{R}^d$) is well known to have $n^{\frac{d}{2}\pm o(1)}$-time algorithms (Overmars, Yap, SICOMP'91; Chan FOCS'13). Only recently, a conditional…

This article provides a thorough investigation into Gilbert's Conjecture, pertaining to Hardy spaces in the upper half-space valued in Clifford modules. We explore the conjecture proposed by Gilbert in 1991, which seeks to extend the…

How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is…

We prove the following comparison theorem for metrics with nonnegative scalar curvature, also known as the dihedral rigidity conjecture by Gromov: for $n\le 7$, if an $n$-dimensional prism has nonnegative scalar curvature and weakly mean…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

Circuits are fundamental objects in linear programming and oriented matroid theory, representing the elementary difference vectors of a polyhedron between points in its affine space. A recent concept introduced by Ekbatani, Natura, and…

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

We study renormalized quenched strong-coupling QED in four dimensions in arbitrary covariant gauge, in the Dyson-Schwinger equation formalism. Above the chiral critical coupling, we show that there is no finite chiral limit. This behaviour…

We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…

We improve Larman's bound on the diameter of a polytope by showing that if $\Delta$ is a normal simplicial complex, all of whose missing faces have size at most $r$, then the diameter of the facet-ridge graph of $\Delta$ is not larger than…

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

Let $H$ be obtained from a cyclically $4$-edge-connected cubic planar graph $Y$ other than $K_4$ by deleting two adjacent vertices. We provide a short proof that if $H$ has circumference at least $k$ for some even integer $k \ge 4$, then…

There are two main thrusts in the theory of regular and chiral polytopes: the abstract, purely combinatorial aspect, and the geometric one of realizations. This brief survey concentrates on the latter. The dimension of a faithful…

Let $W$ be a nonorientable $4$-dimensional handlebody without $3$- and $4$-handles. We show that $W$ admits a Lefschetz fibration over the $2$-disk, whose regular fiber is a nonorientable surface with nonempty boundary. This is an analogue…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

We characterize the expressive power of quantum circuits with the pseudo-dimension, a measure of complexity for probabilistic concept classes. We prove pseudo-dimension bounds on the output probability distributions of quantum circuits; the…

We study the dimension theory of limit sets of iterated function systems consisting of a countably infinite number of contractions. Our primary focus is on the intermediate dimensions: a family of dimensions depending on a parameter $\theta…

Let $G$ be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the $S_4$-Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchings of $G$ such that the complement of their union is a…