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

We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex…

The regularity lemma is a stringent condition of the possible ranks of tensor blow-ups of linear subspaces of matrices. It was proved by Ivanyos, Qiao and Subrahmanyam when the underlying field is sufficiently large. We show that if the…

The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…

Given a vector a $\in$ Rn, we provide an alternative and direct proof for the formula of the volume of sections delta $\cap$ {x : a T x \textless{}= t} and slices $\cap$ {x : a T x = t}, t $\in$ R, of the simplex delta. For slices the…

We consider the Ehrhart $h^*$-vector for the hypersimplex. It is well-known that the sum of the $h_i^*$ is the normalized volume which equals an Eulerian numbers. The main result is a proof of a conjecture by R. Stanley which gives an…

Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for every type of constraint allowed in its instances. Otherwise,…

We give a short proof of Szemer\'edi's regularity lemma, based on elementary Euclidean geometry. The general line of the proof is that of the standard proof (in fact, of Szemer\'edi's original proof), but most technicalities are swallowed…

We introduce an algorithm to describe Pieri's Rule for multiplication of Schubert polynomials. The algorithm uses tower diagrams introduced by the authors and another new algorithm that describes Monk's Rule. Our result is different from…

In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel - an instance equivalent to the input instance, whose size is just a function of the parameter. The size…

An enumerative theory of triangulations of simplicial complexes has been developed by Stanley. A key role in his theory is played by the local $h$-polynomial of a triangulation of a simplex. This paper develops a parallel theory, in which…

In a recent talk of Robbert Fokkink, some conjectures related to the infinite Tribonacci word were stated by the speaker and the audience. In this note we show how to prove (or disprove) the claims easily in a "purely mechanical" fashion,…

The famous Haken-Kneser-Milnor theorem states that every 3-manifold can be expressed in a unique way as a connected sum of prime 3-manifolds. The analogous statement for 3-orbifolds has been part of the folklore for several years, and it…

Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of…

(i) We provide a short and simple proof of the first selection lemma. (ii) We also prove a selection lemma of a new type in $\Re^d$. For example, when $d=2$ assuming $n$ is large enough we prove that for any set $P$ of $n$ points in general…

The classes PPA-$p$ have attracted attention lately, because they are the main candidates for capturing the complexity of Necklace Splitting with $p$ thieves, for prime $p$. However, these classes were not known to have complete problems of…

We use the theory of skew duality to show that decomposing the tensor product of $k$ irreducible representations of the symplectic group $Sp_{2m} = Sp_{2m}(C)$ is equivalent to branching from $Sp_{2n}$ to $Sp_{2n_1}\times\cdots\times…

A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…

In this paper we prove an infinitesimal version of the classical Terracini Lemma for 3--secant planes to a variety. Precisely we prove that if $X\subseteq \PP^r$ is an irreducible, non--degenerate, projective complex variety of dimension…