Related papers: Circuits in Extended Formulations
Many proposed applications of neural networks in machine learning, cognitive/brain science, and society hinge on the feasibility of inner interpretability via circuit discovery. This calls for empirical and theoretical explorations of…
The problem of computing differential constraints for a family of evolution PDEs is discussed from a constructive point of view. A new method, based on the existence of generalized characteristics for evolution vector fields, is proposed in…
For an elliptic curve $E$ over a finite field we define the point sequence $(P_n)$ recursively by $P_n=\vartheta (P_{n-1})=\vartheta ^n(P_0)$ with an endomorphism $\vartheta \in\mathrm{End}(E)$ and with some initial point $P_0$ on $E$. We…
A fundamental challenge in probabilistic modeling is to balance expressivity and inference efficiency. Tractable probabilistic models (TPMs) aim to directly address this tradeoff by imposing constraints that guarantee efficient inference of…
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$, if an imaginary quadratic order $O$…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
The first part of this note contains a review of basic properties of the variety of lines contained in an embedded projective variety and passing through a general point. In particular we provide a detailed proof that for varieties defined…
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…
The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…
In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of…
In the 1970's, Balas introduced the concept of disjunctive programming, which is optimization over unions of polyhedra. One main result of his theory is that, given linear descriptions for each of the polyhedra to be taken in the union, one…
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…
The modularity theorem implies that for every elliptic curve $E /\mathbb{Q}$ there exist rational maps from the modular curve $X_0(N)$ to $E$, where $N$ is the conductor of $E$. These maps may be expressed in terms of pairs of modular…
Every Coxeter group admits a geometric representation as a group generated by reflections in a real vector space. In the projective representation space, limit directions are limits of injective sequences in the orbit of some base point.…
The concept of linear set in projective spaces over finite fields was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rank-distance codes and etc. A linear set with the largest possible…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of…
Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar…
This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…