English
Related papers

Related papers: Roudneff's Conjecture in Dimension $4$

200 papers

Dong and Wang in [Theor. Comput. Sci. 771 (2019) 93--98] conjectured that the resulting graph of the $n$-dimensional folded hypercube $FQ_n$ by deleting any perfect matching is isomorphic to the hypercube $Q_n$. In this paper, we show that…

Combinatorics · Mathematics 2019-05-14 Huazhong Lü , Tingzeng Wu

The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…

Combinatorics · Mathematics 2013-10-29 Francisco Santos

In 1972, Branko Gr\"unbaum conjectured that any arrangement of $n>2$ pairwise crossing pseudocircles in the plane can have at most $2n-2$ digons (regions enclosed by exactly two pseudoarcs), with the bound being tight. While this conjecture…

Combinatorics · Mathematics 2024-12-16 Eyal Ackerman , Gábor Damásdi , Balázs Keszegh , Rom Pinchasi , Rebeka Raffay

In 1984, Frankl and Pach proved that, for positive integers $n$ and $d$, the maximum size of a $(d+1)$-uniform set family $\mathcal{F}$ on an $n$-element set with VC-dimension at most $d$ is at most ${n\choose d}$; and they suspected that…

Combinatorics · Mathematics 2025-08-21 Tianchi Yang , Xingxing Yu

In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The…

Discrete Mathematics · Computer Science 2014-02-18 Boris Konev , Alexei Lisitsa

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Daniela Kühn , Allan Lo , Deryk Osthus

For every $d\geq 2$, we construct a subset $D\subseteq \{1,2,\dots,n\}^d$ of size $n-o(n)$ such that every affine hyperplane of $\mathbb{R}^d$ intersects $D$ in at most $d$ points, and every hypersphere of $\mathbb{R}^n$ intersects $D$ in…

Combinatorics · Mathematics 2025-11-06 Dávid R. Szabó

We propose a systematic way of constructing $N=2, d=4$ superfield Born-Infeld action with a second nonlinearly realized N=2 supersymmetry. The latter, together with the manifest N=2 supersymmetry, form a central-charge extended $N=4, d=4$…

High Energy Physics - Theory · Physics 2009-11-07 S. Bellucci , E. Ivanov , S. Krivonos

We improve the lower bound on the $d$-dimensional rectilinear crossing number of the complete $d$-uniform hypergraph having $2d$ vertices to $\Omega\left(\dfrac{(4\sqrt{2}/3^{3/4})^d}{d}\right)$ from $\Omega(2^d \sqrt{d})$. We also…

Combinatorics · Mathematics 2023-09-21 Rahul Gangopadhyay , Ayan

We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather,…

Symbolic Computation · Computer Science 2015-02-13 David Wilson , Matthew England , Russell Bradford , James H. Davenport

The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…

Combinatorics · Mathematics 2025-04-17 Jiří Fink , Torsten Mütze

The recent result that n congruent balls in R^d have at most 4 distinct geometric permutations is described.

Computational Geometry · Computer Science 2007-05-23 Joseph O'Rourke

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

Combinatorics · Mathematics 2024-03-12 Andres Mejia , Steven Simon , Jialin Zhang

The conjecture of Peter Horak and Alex Rosa (generalizing that of Marco Buratti) states that a multiset L of v-1 positive integers not exceeding [v/2] is the list of edge-lengths of a suitable Hamiltonian path of the complete graph with…

Combinatorics · Mathematics 2013-11-05 Anita Pasotti , Marco Antonio Pellegrini

Zaremba's conjecture (1971) states that every positive integer number d can be represented as a denominator of a finite continued fraction b/d = [d1,d2,...,dk], with all partial quotients d1,d2,...,dk being bounded by an absolute constant…

Number Theory · Mathematics 2017-03-08 I. D. Kan

We explore the classical Regge growth conjecture in the 4d effective field theory that results from compactifying $D$-dimensional General Relativity on a compact, Ricci-flat manifold. While the higher dimensional description is given in…

High Energy Physics - Theory · Physics 2024-09-19 Joan Quirant

We show that a generic real projective n-dimensional hypersurface of degree 2n-1 contains "many" real lines, namely, not less than (2n-1)!!, which is approximately the square root of the number of complex lines. This estimate is based on…

Algebraic Geometry · Mathematics 2012-06-26 S. Finashin , V. Kharlamov

Multidimensional permutations, or $d$-permutations, are represented by their diagrams on $[n]^d$ such that there exists exactly one point per hyperplane $x_i$ that satisfies $x_i= j$ for $i \in [d]$ and $j \in [n]$. Bonichon and Morel…

Combinatorics · Mathematics 2024-04-25 Nathan Sun

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn

This article is motivated by a conjecture proposed by Sinai Robins in 2024. The conjecture asserts that two convex, centrally symmetric sets of positive measure that are not multi-tilers must coincide up to rigid motions if and only if…

Functional Analysis · Mathematics 2025-11-18 Oleg Asipchuk
‹ Prev 1 8 9 10 Next ›