Related papers: Extension Complexity of Independent Set Polytopes
We investigate $N$-extended supersymmetry in one-dimensional quantum mechanics on a circle with point singularities. For any integer $n$, $N=2n+1$ supercharges are explicitly constructed in terms of discrete transformations, and a class of…
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order…
We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the…
The independence complex of a graph is a simplicial complex whose faces correspond to the independent sets of $G$. While independence complexes have been studied extensively for many graph classes, including square grid graphs, relatively…
We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize…
Extended formulations are an important tool to obtain small (even compact) formulations of polytopes by representing them as projections of higher dimensional ones. It is an important question whether a polytope admits a small extended…
We show that any $n$-variate polynomial computable by a syntactically multilinear circuit of size $\operatorname{poly}(n)$ can be computed by a depth-$4$ syntactically multilinear ($\Sigma\Pi\Sigma\Pi$) circuit of size at most…
Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha"(G)$ respectively. This paper establishes a…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
For finite abstract simplicial complex $\Sigma$, initial realization $\alpha$ in $\mathbb{E}^d$, and desired edge lengths $L$, we give practical sufficient conditions for the existence of a non-self-intersecting perturbation of $\alpha$…
We study independent sets in strong powers of circulant graphs using a transfer matrix formulation. The compatibility constraints separate into intra-layer and inter-layer components, yielding a transfer operator that is equivariant under…
We give nearly optimal bounds on the sample complexity of $(\widetilde{\Omega}(\epsilon),\epsilon)$-tolerant testing the $\rho$-independent set property in the dense graph setting. In particular, we give an algorithm that inspects a random…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
The set LS(n) of Latin squares of order $n$ can be represented in $\mathbb{R}^{n^3}$ as a $(n-1)^3$-dimensional 0/1-polytope. Given an autotopism $\Theta=(\alpha,\beta,\gamma)\in\mathfrak{A}_n$, we study in this paper the 0/1-polytope…
We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral terrains using a probabilistic analysis. Aronov etal [ABT08] prove that, if one makes certain realistic input assumptions on the terrain, this complexity…
It has been shown that the edge structure of the characteristic imset polytope is closely connected to the question of causal discovery. The diameter of a polytope is an indicator of how connected the polytope is and moreover gives us a…
We study the class of independence complexes of claw-free graphs. The main theorem give good bounds on the connectivity of these complexes, given bounds for a few subcomplexes of the same class. Two applications are presented. Firstly, we…
We provide a sharp estimate for the asymptotic number of lattice zonotopes, inscribed in $[0,n ]^d$ when $n$ tends to infinity. Our estimate refines the logarithmic equivalent established by Barany, Bureaux, and Lund when the sum of the…
We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…