Related papers: A note on dimensions of polynomial size circuits

Agrawal and Vinay [AV08] showed how any polynomial size arithmetic circuit can be thought of as a depth four arithmetic circuit of subexponential size. The resulting circuit size in this simulation was more carefully analyzed by Korian…

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

We study the size blow-up that is necessary to convert an algebraic circuit of product-depth $\Delta+1$ to one of product-depth $\Delta$ in the multilinear setting. We show that for every positive $\Delta = \Delta(n) = o(\log n/\log \log…

In this paper we give an upper bound, in characteristic 0, for the cohomological dimension of a graded ideal in a polynomial ring such that the quotient has depth at least 3. In positive characteristic the same bound holds true by a…

Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…

We consider polyregular functions, which are certain string-to-string functions that have polynomial output size. We prove that a polyregular function has output size $\mathcal O(n^k)$ if and only if it can be defined by an MSO…

Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

By analysing the structure of the associated graded ring with respect to certain filtrations, we deduce a number of good properties of iterated local skew power series rings over appropriate base rings. In particular, we calculate the Krull…

These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…

The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…

For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…

Motivated by the study of the dimension of random posets, it was conjectured by Bollob\'as and Brightwell in 1997 that if $P$ is a finite poset whose cover graph contains at most one cycle then its order dimension is at most $3$. In this…

The dimension of a linear space is the maximum positive integer $d$ such that any $d$ of its points generate a proper subspace. For a set $K$ of integers at least two, recall that a pairwise balanced design PBD$(v,K)$ is a linear space on…

Given two $d\times d$ matrices, say $A$ and $B$, when do $p(A)$ and $p(B)$ have the same ``size'' for every polynomial $p$? In this article, we provide definitive results in the cases $d=2$ and $d=3$ when the notion of size used is the…

Recently it was shown that the scaling dimension of the operator $\phi^n$ in scale-invariant $d=3$ theory may be computed semiclassically, and this was verified to leading order (two loops) in perturbation theory at leading and subleading…

Higher-dimensional theories provide a promising framework for unified extensions of the supersymmetric standard model. Compactifications to four dimensions often lead to U(1) symmetries beyond the standard model gauge group, whose breaking…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…