Related papers: A note on dimensions of polynomial size circuits

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We prove a Pucci-Serrin conjecture on critical dimensions under a uniform bound on the energy. The method is based on the analysis of the Green's function of polyharmonic operators with "almost" Hardy potential.

We study the circuit diameter of polyhedra, introduced by Borgwardt, Finhold, and Hemmecke (SIDMA 2015) as a relaxation of the combinatorial diameter. We show that the circuit diameter of a system $\{x \in \mathbb{R}^n: Ax=b, 0\leq x\leq…

In the first section of this work we introduce 4-dimensional Power Geometry for second-order ODEs of a polynomial form. In the next five sections we apply this construction to the first five Painlev\'e equations.

Let $C$ be a depth-3 arithmetic circuit of size at most $s$, computing a polynomial $ f \in \mathbb{F}[x_1,\ldots, x_n] $ (where $\mathbb{F}$ = $\mathbb{Q}$ or $\mathbb{C}$) and the fan-in of the product gates of $C$ is bounded by $d$. We…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, has resource-bounded instances. These instances…

This is an expository paper in which it is proved that, for every infinite field ${\mathbf{F}}$, the polynomial ring ${\mathbf{F}}[t_1,\ldots, t_n]$ has Krull dimension $n$. The proof uses only "high school algebra" and the rudiments of…

We obtain the exact value of the Hausdorff dimension of the set of coefficients of Gauss sums which for a given $\alpha \in (1/2,1)$ achieve the order at least $N^{\alpha}$ for infinitely many sum lengths $N$. For Weyl sums with polynomials…

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…

In this paper we associate to each multivariate polynomial $f$ that is homogeneous relative to a subset of its variables a series of polynomial families $P_\lambda (f)$ of $m$-tuples of homogeneous polynomials of equal degree such that the…

We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Bosse et al. conjectured that for every natural number $d \ge 2$ and every $d$-dimensional polytope $P$ in $\real^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying $P=\{x \in \mathbb{R}^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge…

We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method…

In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

We prove that for every $0 < c < 4$ and every $N \in \mathbb{N}$ there exists a monic polynomial $p(z) = z^n + a_{n-1} z^{n-1} + \dots + a_0$ such that the set $\{z \in \mathbb{C} : |p(z)| \leq 1\}$ has at least $N$ connected components…

We characterize when bivariate real analytic functions are "dimension expanding" when applied to a Cartesian product. If $P$ is a bivariate real analytic function that is not locally of the form $P(x,y) = h(a(x) + b(y))$, then whenever $A$…