English
Related papers

Related papers: On the Circuit Diameter Conjecture

200 papers

We revisit the hardness of approximating the diameter of a network. In the CONGEST model of distributed computing, $ \tilde \Omega (n) $ rounds are necessary to compute the diameter [Frischknecht et al. SODA'12], where $ \tilde \Omega…

Data Structures and Algorithms · Computer Science 2018-03-02 Karl Bringmann , Sebastian Krinninger

The P\'osa-Seymour conjecture asserts that every graph on $n$ vertices with minimum degree at least $(1 - 1/(r+1))n$ contains the $r^{th}$ power of a Hamilton cycle. Koml\'os, S\'ark\"ozy and Szemer\'edi famously proved the conjecture for…

Combinatorics · Mathematics 2022-08-29 Domagoj Bradač

In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…

Commutative Algebra · Mathematics 2025-10-10 Marie Amalore Nambi , Neeraj Kumar

Let $f(d)$ be the smallest value for which every bridgeless graph $G$ with diameter $d$ admits a strong orientation $\overrightarrow{G}$ such that the diameter of $\overrightarrow{G}$ is at most $f(d)$. Chv\'atal and Thomassen (JCT-B, 1978)…

Combinatorics · Mathematics 2025-10-29 Jifu Lin , Lihua You

We derive upper and lower bounds on the gradients of Wachspress coordinates defined over any simple convex d-dimensional polytope P. The bounds are in terms of a single geometric quantity h_*, which denotes the minimum distance between a…

Numerical Analysis · Mathematics 2022-02-22 Michael Floater , Andrew Gillette , N. Sukumar

Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this…

Combinatorics · Mathematics 2020-04-27 William Gustafson

We introduce the wedge product of two polytopes. The wedge product is described in terms of inequality systems, in terms of vertex coordinates as well as purely combinatorially, from the corresponding data of its constituents. The wedge…

Metric Geometry · Mathematics 2009-08-24 Thilo Rörig , Günter M. Ziegler

We give a proof of the $A_2$ conjecture in geometrically doubling metric spaces (GDMS), i.e. a metric space where one can fit not more than a fixed amount of disjoint balls of radius $r$ in a ball of radius $2r$. Our proof consists of three…

Classical Analysis and ODEs · Mathematics 2013-01-11 Fedor Nazarov , Alexander Reznikov , Alexander Volberg

It is shown that a bounded quiver algebra having a 2-truncated oriented cycle is of infinite Hochschild homology dimension and global dimension, which generalizes a result of Solotar and Vigu\'{e}-Poirrier to nonlocal ungraded algebras…

Rings and Algebras · Mathematics 2010-04-07 Yang Han

We prove that a 3--dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed…

Differential Geometry · Mathematics 2009-08-17 François Fillastre , Ivan Izmestiev

A celebrated unresolved conjecture of Erd\H{o}s and Hajnal states that for every undirected graph $H$ there exists $\epsilon(H)>0$ such that every undirected graph on $n$ vertices that does not contain $H$ as an induced subgraph contains a…

Combinatorics · Mathematics 2015-08-21 Eli Berger , Krzysztof Choromanski , Maria Chudnovsky

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

Combinatorics · Mathematics 2025-07-08 Naomi Bredon

Over 125 years ago, Henry Selby Hele-Shaw realized that the depth-averaged flow in thin gap geometries can be closely approximated by two-dimensional (2D) potential flow, in a surprising marriage between the theories of viscous-dominated…

Fluid Dynamics · Physics 2026-04-09 Lingyun Ding , Terry Wang , Marcus Roper

In 1992, Kalai and Kleitman proved a quasipolynomial upper bound on the diameters of convex polyhedra. Todd and Sukegawa-Kitahara proved tail-quasipolynomial bounds on the diameters of polyhedra. These tail bounds apply when the number of…

Combinatorics · Mathematics 2016-03-15 J. Mackenzie Gallagher , Edward D. Kim

A heterodimensional cycle consists of a pair of heteroclinic connections between two saddle periodic orbits with unstable manifolds of different dimensions. Recent theoretical work on chaotic dynamics beyond the uniformly hyperbolic setting…

Dynamical Systems · Mathematics 2019-06-28 Andy Hammerlindl , Bernd Krauskopf , Gemma Mason , Hinke M. Osinga

We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…

Computational Complexity · Computer Science 2025-03-19 Bruno P. Cavalar , Igor C. Oliveira

We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…

Computational Geometry · Computer Science 2020-06-30 Man-Kwun Chiu , Matias Korman , Martin Suderland , Takeshi Tokuyama

Karshon constructed the first counterexample to the log-concavity conjecture for the Duistermaat-Heckman measure: a Hamiltonian six manifold whose fixed points set is the disjoint union of two copies of $T^4$. In this article, for any…

Symplectic Geometry · Mathematics 2008-03-03 Yi Lin

There are three generalizations of the Platonic solids that exist in all dimensions, namely the hypertetrahedron, the hypercube, and the hyperoctahedron, with the latter two being dual. Conformal field theories with the associated symmetry…

High Energy Physics - Theory · Physics 2018-06-13 Andreas Stergiou

The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…

Metric Geometry · Mathematics 2009-09-29 Julian Pfeifle
‹ Prev 1 8 9 10 Next ›