English
Related papers

Related papers: A Quantitative Result on Diophantine Approximation…

200 papers

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

Number Theory · Mathematics 2015-10-19 Geoffrey B. Campbell , Aleksander Zujev

For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…

Probability · Mathematics 2013-02-27 Joseph Najnudel , Ashkan Nikeghbali , Alain Rouault

We refine and extend quantitative bounds, on the fraction of nonnegative polynomials that are sums of squares, to the multihomogenous case.

Algebraic Geometry · Mathematics 2018-06-11 Alperen Ergur

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…

Number Theory · Mathematics 2024-06-11 Robert Dougherty-Bliss , Charles Kenney , Doron Zeilberger

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

Number Theory · Mathematics 2018-12-27 Patrick Letendre

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

Number Theory · Mathematics 2015-07-06 Daqing Wan , Qiang Wang

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

Number Theory · Mathematics 2023-10-06 Florian Breuer , Fabien Pazuki

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

Information Theory · Computer Science 2021-12-14 Yansheng Wu , Yoonjin Lee , Qiang Wang

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

Complex Variables · Mathematics 2024-09-20 Vahagn Aslanyan

In this article we establish two new results on quantitative Diophantine approximation for one-parameter families of diagonal ternary indefinite forms. In the first result, we consider quadratic forms taking values at prime points. In the…

Number Theory · Mathematics 2023-11-20 Anish Ghosh , V. Vinay Kumaraswamy

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…

Numerical Analysis · Mathematics 2021-12-28 Larry Allen , Robert C. Kirby

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

Combinatorics · Mathematics 2026-02-25 Thomas Karam

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

Combinatorics · Mathematics 2025-11-19 Vincent Brugidou

We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…

Algebraic Geometry · Mathematics 2023-07-19 Andreas Gross , Trevor Gunn

Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…

Dynamical Systems · Mathematics 2016-09-28 Andreas Koutsogiannis

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

Complex Variables · Mathematics 2018-12-10 Kamal Diki , Sorin G. Gal , Irene Sabadini

We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…

Classical Analysis and ODEs · Mathematics 2011-01-18 Ilia Krasikov

Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…

Number Theory · Mathematics 2023-01-19 Avraham Bourla