Related papers: Proving Tucker's Lemma with a Volume Argument

We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

We treat problems of fair division, their various interconnections, and their relations to Sperner's lemma and the KKM theorem as well as their variants. We prove extensions of Alon's necklace splitting result in certain regimes and relate…

We study spherical tetrahedra with rational dihedral angles and rational volumes. Such tetrahedra occur in the Rational Simplex Conjecture by Cheeger and Simons, and we supply vast families, discovered by computational efforts, of positive…

For the ordered set $[n]$ of $n$ elements, we consider the class $\Bscr_n$ of bases $B$ of tropical Pl\"ucker functions on $2^{[n]}$ such that $B$ can be obtained by a series of mutations (flips) from the basis formed by the intervals in…

Standard singularity theorems are proven in Lorentzian manifolds of arbitrary dimension n if they contain closed trapped submanifolds of arbitrary co-dimension. By using the mean curvature vector to characterize trapped submanifolds, a…

The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…

Tucker's Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n=2 was proposed by Tucker in 1945. Numerous generalizations and applications of the Lemma have appeared since then. In 2006 Meunier proved the Lemma in its…

We investigate the open Closing Lemma problem for vector fields on the 2-dimensional torus. Under the assumption of bounded type rotation number, the $C^r$ Closing Lemma is verified for smooth vector fields that are area-preserving at all…

We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it…

We extend our recent results on ordinary su(N) tensor product multiplicities to higher su(N) tensor products. Particular emphasis is put on four-point couplings where the tensor product of four highest weight modules is considered. The…

We introduce two nonlinear sufficient dimension reduction methods for regressions with tensor-valued predictors. Our goal is two-fold: the first is to preserve the tensor structure when performing dimension reduction, particularly the…

Let $K$ be a number field, and let $W$ be a subspace of $K^N$, $N \geq 1$. Let $V_1,...,V_M$ be subspaces of $K^N$ of dimension less than dimension of $W$. We prove the existence of a point of small height in $W \setminus \bigcup_{i=1}^M…

One of the central problems in the study of parametrized constraint satisfaction problems is the Dichotomy Conjecture by T. Feder and M. Vardi stating that the constraint satisfaction problem (CSP) over a fixed, finite constraint language…

We generalize the classic definition of Delaunay triangulation and prove that for a locally finite and coarsely dense generic point set, $A \subseteq \mathbb{R}^d$, the $d$-simplices whose vertices belong to $A$ and whose circumscribed…

We show that, without any extra physical degree introduced, the Standard Model can be readily reformulated as a Double Field Theory. Consequently, the Standard Model can couple to an arbitrary stringy gravitational background in an…

We prove a Poisson summation formula for the zero locus of a quadratic form in an even number of variables with no assumption on the support of the functions involved. The key novelty in the formula is that all ``boundary terms'' are given…

Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using…

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a "splitting theorem" for sets of product tensors, in which the k-rank…