Related papers: A note on dimensions of polynomial size circuits

The symmetry classification method is applied to the string-like scalar fields in two-dimensional space-time. When the configurational space is three-dimensional and reducible we present the complete list of the systems admiting higher…

Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…

The dimension of a partially-ordered set $P$ is the smallest integer $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$ is bounded…

Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…

We prove the $L^p$-boundedness, $1<p<\infty$, of the Polynomial Carleson operator in general dimension. This follows the author's resolution of the one dimensional case as well as the work of Zorin-Kranich on the higher dimensional case in…

We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…

It is known for scalar ordinary differential equations, and for systems of ordinary differential equations of order not higher than the third, that their Lie point symmetry algebras is of maximal dimension if and only if they can be reduced…

Let $p$ be a prime. We prove bounds on short Dirichlet character sums evaluated at a class of homogeneous polynomials in arbitrary dimensions. In every dimension, this bound is nontrivial for sums over boxes with side lengths as short as…

Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an…

We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Sol\'e, 1989). We give…

The scaled inverse of a nonzero element $a(x)\in \mathbb{Z}[x]/f(x)$, where $f(x)$ is an irreducible polynomial over $\mathbb{Z}$, is the element $b(x)\in \mathbb{Z}[x]/f(x)$ such that $a(x)b(x)=c \pmod{f(x)}$ for the smallest possible…

Let $E\subset \mathbb{R}$ be a closed set of Hausdorff dimension $\alpha\in (0, 1)$. Let $P: \mathbb{R}\to \mathbb{R}$ be a polynomial without a constant term whose degree is bigger than one. We prove that if $E$ supports a probability…

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

We study the dynamics of the map $x$ to $dx$ (mod 1) on the unit circle. We characterize the invariant finite subsets of this map which are called cycles and are graded by their degrees. By looking at the combinatorial properties of the…

A weighted game or a threshold function in general admits different weighted representations even if the sum of non-negative weights is fixed to one. Here we study bounds for the diameter of the corresponding weight polytope. It turns out…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the subset-sum variant…

This paper establishes an analogue of the special chain theorem for the embedding dimension of polynomial rings, with direct application on the (embedding) codimension. In particular, we recover a classic result on the transfer of…

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

Hardware implementations of complex functions regularly deploy piecewise polynomial approximations. This work determines the complete design space of piecewise polynomial approximations meeting a given accuracy specification. Knowledge of…