Related papers: Small Extended Formulations for Cyclic Polytopes

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…

A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…

We study quantitatively the importance of the recently derived NLO corrections to the DIS structure functions at small x in the dipole formalism. We show that these corrections can be significant and depend on the factorization scheme used…

We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…

We prove a family of factorization formulas for the combinatorial Donaldson--Thomas invariant for an acyclic quiver. A quantum dilogarithm identity due to Reineke, later interpreted by Rimanyi by counting codimensions of quiver loci, gives…

The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the plane. First, we give a new proof that the…

We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…

Let $P$ be a polytope. The hitting number of $P$ is the smallest size of a hitting set of the facets of $P$, i.e., a subset of vertices of $P$ such that every facet of $P$ has a vertex in the subset. An extended formulation of $P$ is the…

This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…

Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…

We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes…

Factorization method is developed for a family of discretely spiked harmonic oscillators. Two sets of intertwining and ladder operators are presented to algebraically generate eigenstates with energies isomorphic to those of the ordinary…

Using the Sklyanin-Kharchev-Lebedev method of Separation of Variables adapted to the cyclic Baxter--Bazhanov--Stroganov or $\tau^{(2)}$-model, we derive factorized formulae for general finite-size Ising model spin matrix elements, proving a…

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…

We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…

We introduce several classes of polytopes contained in $[0,1]^n$ and cut out by inequalities involving sums of consecutive coordinates. We show that the normalized volumes of these polytopes enumerate circular extensions of certain partial…