Related papers: Rational values of transcendental functions and ar…

We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…

Let $X$ be an affine or a projective variety defined over a number field $K$ and $\varphi:{\bf C}\to X({\bf C})$ be a holomorphic map with Zariski dense image. We estimate the number of rational points of height bounded by $H$ in the image…

We introduce a new canonical height function for Jordan blocks of small eigenvalues for endomorphisms on smooth projective varieties over a number field. We prove that under an assumption on the eigenvalues of the endomorphism on the group…

We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

One of the main themes in this thesis is the description of the signature of both the infinite place and the finite places in cubic function fields of any characteristic and quartic function fields of characteristic at least 5. For these…

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

We use a global version of Heath-Brown's $p-$adic determinant method developed by Salberger to give upper bounds for the number of rational points of height at most $B$ on non-singular cubic curves defined over $\mathbb{Q}$. The bounds are…

The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

In this brief note, we will investigate the number of points of bounded (twisted) height in a projective variety defined over a function field, where the function field comes from a projective variety of dimension greater than or equal to…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

We consider the problem of partitioning a line segment into two subsets, so that $n$ finite measures all have the same ratio of values for the subsets. Letting $\alpha\in[0,1]$ denote the desired ratio, this generalises the PPA-complete…

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the…

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…

The possibilities for limit functions on a Fatou component for the iteration of a single polynomial or rational function are well understood and quite restricted. In non-autonomous iteration, where one considers compositions of arbitrary…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…

We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…