English
Related papers

Related papers: Halfway to Rota's basis conjecture

200 papers

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

Optimization and Control · Mathematics 2018-01-15 Prasad Raghavendra , Nick Ryder , Nikhil Srivastava , Benjamin Weitz

Recently [Karimipour and Memarzadeh, PhysRevA 73, 012329 (2006)] posed the problem of finding a continuous family of orthonormal bases in a bipartite space of two identical systems with the following properties: i) in each basis, all states…

Quantum Physics · Physics 2010-04-13 Vlad Gheorghiu

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

Computational Geometry · Computer Science 2025-10-16 Boris Aronov , Sang Won Bae , Sergio Cabello , Otfried Cheong , David Eppstein , Christian Knauer , Raimund Seidel

The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Koml\'os, Sark\"ozy and Szemer\'edi. Here we prove that if p > n^{-1/2+\eps},…

Combinatorics · Mathematics 2012-07-31 Daniela Kühn , Deryk Osthus

Prompted by results of Guardo, Van Tuyl and the second author for lines in projective 3 space, we develop asymptotic upper bounds for the least degree of a homogeneous form vanishing to order at least m on a union of disjoint r dimensional…

Algebraic Geometry · Mathematics 2016-04-12 Marcin Dumnicki , Brian Harbourne , Tomasz Szemberg , Halszka Tutaj-Gasińska

Bollob\'{a}s and Scott [5] conjectured that every graph $G$ has a balanced bipartite spanning subgraph $H$ such that for each $v\in V(G)$, $d_H(v)\ge (d_G(v)-1)/2$. In this paper, we show that every graphic sequence has a realization for…

Combinatorics · Mathematics 2017-01-26 Yuliang Ji , Jie Ma , Juan Yan , Xingxing Yu

We consider a range-search variant of the closest-pair problem. Let $\varGamma$ be a fixed shape in the plane. We are interested in storing a given set of $n$ points in the plane in some data structure such that for any specified translate…

Computational Geometry · Computer Science 2019-03-25 Jie Xue , Yuan Li , Saladi Rahul , Ravi Janardan

We give a proof the monodromy conjecture relating the poles of motivic zeta functions with roots of b-functions for isolated quasihomogeneous hypersurfaces, and more generally for semi-quasihomogeneous hypersurfaces. We also give a strange…

Algebraic Geometry · Mathematics 2023-09-26 Guillem Blanco , Nero Budur , Robin van der Veer

Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…

Combinatorics · Mathematics 2021-08-04 Qi Yan , Xian'an Jin

The conjecture of Bollob\'as and Koml\'os, recently proved by B\"ottcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $\gamma>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and…

Combinatorics · Mathematics 2011-07-28 Julia Böttcher , Peter Christian Heinig , Anusch Taraz

We study the parallel (adaptive) complexity of the classic problem of finding a basis in an $n$-element matroid, given access via an \emph{independence oracle}. In this model, the algorithm may submit polynomially many independence queries…

Data Structures and Algorithms · Computer Science 2026-05-06 Sanjeev Khanna , Aaron Putterman , Junkai Song

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

We have developed a general method for constructing a set of non-orthogonal bases with equal separations between all different basis' states in prime dimensions.It results that the corresponding bi-orthogonal counterparts are pairwise…

Quantum Physics · Physics 2015-06-17 Isabel Sainz , Luis Roa , Andrei B. Klimov

Consider $n$ runners running on a circular track of unit length with constant speeds such that $k$ of the speeds are distinct. We show that, at some time, there will exist a sector $S$ which contains at least $|S|n+ \Omega(\sqrt{k})$…

Computational Complexity · Computer Science 2020-04-07 Pavel Hrubes

We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…

Combinatorics · Mathematics 2010-11-22 Andrew Treglown

We classify all sets of nonzero vectors in $\mathbb{R}^3$ such that the angle formed by each pair is a rational multiple of $\pi$. The special case of four-element subsets lets us classify all tetrahedra whose dihedral angles are multiples…

Metric Geometry · Mathematics 2020-12-01 Kiran S. Kedlaya , Alexander Kolpakov , Bjorn Poonen , Michael Rubinstein

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…

Functional Analysis · Mathematics 2019-02-06 Shahar Mendelson

The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Zamarashkin in \cite{GTZ1997}. For arbitrary real $n \times k$ matrix with orthonormal columns a sufficiently "good" $k \times k$ submatrix exists. "Good" in the sense…

Numerical Analysis · Mathematics 2024-08-27 Yuri Nesterenko

Thomason [$\textit{Trans. Amer. Math. Soc.}$ 296.1 (1986)] proved that every sufficiently large tournament contains Hamilton paths and cycles with all possible orientations, except possibly the consistently oriented Hamilton cycle. This…

Combinatorics · Mathematics 2024-07-22 Debsoumya Chakraborti , Jaehoon Kim , Hyunwoo Lee , Jaehyeon Seo

A celebrated result of Alon from 1993 states that any $d$-regular graph on $n$ vertices (where $d=O(n^{1/9})$) has a bisection with at most $\frac{dn}{2}(\frac{1}{2}-\Omega(\frac{1}{\sqrt{d}}))$ edges, and this is optimal. Recently, this…

Combinatorics · Mathematics 2024-09-24 Eero Räty , István Tomon