Related papers: Product Sets of Arithmetic Progressions in Functio…
This paper presents a reformulation of the Leibniz product rule as a finite sum that expresses the fractional derivative of the product of two differentiable functions. This paper then proves the cases for when the product consists of an…
We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…
In recent years, Karr's difference field theory has been extended to the so-called $R\Pi\Sigma$-extensions in which one can represent not only indefinite nested sums and products that can be expressed by transcendental ring extensions, but…
We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…
In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…
We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…
We study on finite unramified extensions of global function fields (function fields of one valuable over a finite field). We show two results. One is an extension of Perret's result about the ideal class group problem. Another is a…
We present bounds for the degree and the height of the polynomials arising in some central problems in effective algebraic geometry including the implicitation of rational maps and the effective Nullstellensatz over a variety. Our treatment…
We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…
We consider a finite fields version of the Erd\H{o}s-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.
We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…
This paper investigates asymptotic properties of multifractal products of random fields. The obtained limit theorems provide sufficient conditions for the convergence of cumulative fields in the spaces $L_q.$ New results on the rate of…
Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions…
Polynomial optimization problems often arise in sequences indexed by dimension, and it is of interest to compute bounds on the optimal values of all problems in the sequence. Examples include certifying inequalities between symmetric…
For a given finite set $\Sigma$ of matrices with nonnegative integer entries we study the growth of $$ \max_t(\Sigma) = \max\{\|A_{1}... A_{t}\|: A_i \in \Sigma\}.$$ We show how to determine in polynomial time whether the growth with $t$ is…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
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…
We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…