Related papers: Quadratic polynomials of small modulus cannot repr…
Motivated by a question of Defant and Propp (2020) regarding the connection between the degrees of noninvertibility of functions and those of their iterates, we address the combinatorial optimization problem of minimizing the sum of squares…
We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…
Working over an algebraically closed base field $k$ of characteristic 2, the ring of invariants $R^G$ is studied, where $G$ is the orthogonal group O(n) or the special orthogonal group SO(n), acting naturally on the coordinate ring $R$ of…
The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…
We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…
We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…
This paper studies so-called "null polynomials modulo m", i.e., polynomials with integer coefficients that satisfy f(x)=0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m…
In this article, we construct an arithmetic hyperbolic $6-$orbifold $\mathcal{O}$ such that, any square-rootable Salem number of degree at most $4$ over $\mathbb{Q}$ is realized as the exponential of the length of a closed geodesic in…
We consider the problem of determining the closure of a quadratic module M in a commutative R-algebra with respect to the finest locally convex topology. This is of interest in deciding when the moment problem is solvable and in analyzing…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
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…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial…
This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…
The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…
For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…
The approximate non-deterministic degree of a Boolean function $f$, denoted $\mathsf{ndeg}_\epsilon(f)$ (written $\mathsf{N}_\epsilon(f)$ for brevity), is the minimum degree of a real polynomial $p$ such that $0 \le |p(x)| \le \epsilon$…
The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…
Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…
In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…