Related papers: Circuits in Extended Formulations
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…
In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding…
A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…
In this paper, we introduce the notion of augmentation for polytopes and use it to show the error in two presumptions that have been key in arriving at over-reaching/over-scoped claims of "impossibility" in recent extended formulations (EF)…
The central open question of algebraic complexity is whether VP is unequal to VNP, which is saying that the permanent cannot be represented by families of polynomial-size algebraic circuits. For symmetric algebraic circuits, this has been…
The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
Extended Clifford circuits straddle the boundary between classical and quantum computational power. Whether such circuits are efficiently classically simulable seems to depend delicately on the ingredients of the circuits. While some…
We present a formulation of quantum circuit diagrams based on the exponential map which provides a new way to calculate graphically with circuits. We present a sound list of rewrite rules for this formulation and demonstrate a variety of…
The length polyhedron $Q_P$ of an interval order $P$ is the convex hull of integral vectors representing the interval lengths in interval representations of $P$. This polyhedron has been studied by various authors, including Fishburn and…
The combinatorial diameter of a polytope $P$ is the maximum value of a shortest path between two vertices of $P$, where the path uses the edges of $P$ only. In contrast to the combinatorial diameter, the circuit diameter of $P$ is defined…
There are many examples of optimization problems whose associated polyhedra can be described much nicer, and with way less inequalities, by projections of higher dimensional polyhedra than this would be possible in the original space.…
We prove that there exist uniform $(+,\times,/)$-circuits of size $O(n^3)$ to compute the basis generating polynomial of regular matroids on $n$ elements. By tropicalization, this implies that there exist uniform $(\max,+,-)$-circuits and…
Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set of vector values. The extended formulation is constructed by…
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron) introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is…
A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…
We introduce a special subset of the graph of a homogeneous coupled cell network, called a projection block, and show that the network obtained from identifying this block to a single point can be used to understand the generic bifurcations…