English
Related papers

Related papers: p-adic root separation and the discriminant of int…

200 papers

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

Number Theory · Mathematics 2017-08-15 Luis A. Medina , Victor H. Moll , Eric Rowland

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Numerical Analysis · Mathematics 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

We show that for every homogeneous polynomial of degree $d$, if it has determinantal complexity at most $s$, then it can be computed by a homogeneous algebraic branching program (ABP) of size at most $O(d^5s)$. Moreover, we show that for…

Computational Complexity · Computer Science 2023-08-10 Abhranil Chatterjee , Mrinal Kumar , Ben Lee Volk

For the family of polynomials in one variable $P:=x^n+a_1x^{n-1}+\cdots +a_n$, $n\geq 4$, we consider its higher-order discriminant sets $\{ \tilde{D}_m=0\}$, where $\tilde{D}_m:=$Res$(P,P^{(m)})$, $m=2$, $\ldots$, $n-2$, and their…

Classical Analysis and ODEs · Mathematics 2023-02-14 Vladimir Petrov Kostov

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

Symbolic Computation · Computer Science 2015-03-19 Michael Kerber , Michael Sagraloff

We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…

Combinatorics · Mathematics 2015-10-20 Pooya Hatami

Given any positive integer $n,$ let $A(n)$ denote the height of the $n^{\text{th}}$ cyclotomic polynomial, that is its maximum coefficient in absolute value. It is well known that $A(n)$ is unbounded. We conjecture that every natural number…

Number Theory · Mathematics 2020-12-01 Alexandre Kosyak , Pieter Moree , Efthymios Sofos , Bin Zhang

This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…

Probability · Mathematics 2021-10-15 Yen Q. Do

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

Complex Variables · Mathematics 2025-02-11 Pratap Basak , Sanjay Mallick

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

Number Theory · Mathematics 2022-10-25 Wei Cao , Daqing Wan

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Computational Complexity · Computer Science 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

This paper deals with function field analogues of famous theorems of Laudau which counted the number of integers which have $t$ prime factors and R. Hall which researched the distribution of divisors of integers in residue classes.\;We…

Number Theory · Mathematics 2017-09-19 Yiqin He , Bicheng Zhang

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

Algebraic Geometry · Mathematics 2008-04-15 Gennadiy Averkov

The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order…

Number Theory · Mathematics 2022-06-02 Brad Emmons , Xiao Xiao

The field of $p$-adic numbers $\mathbb{Q}_p$ and the ring of $p$-adic integers $\mathbb{Z}_p$ are essential constructions of modern number theory. Hensel's lemma, described by Gouv\^ea as the "most important algebraic property of the…

Logic in Computer Science · Computer Science 2019-09-26 Robert Y. Lewis

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Commutative Algebra · Mathematics 2014-01-25 Markus Lange-Hegermann

Let $K=\mathbb{Q}(\sqrt[n]{a})$ be an extension of degree $n$ of the field $\Q$ of rational numbers, where the integer $a$ is such that for each prime $p$ dividing $n$ either $p\nmid a$ or the highest power of $p$ dividing $a$ is coprime to…

Number Theory · Mathematics 2020-05-05 Anuj Jakhar , Sudesh K. Khanduja , Neeraj Sangwan

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best…

Number Theory · Mathematics 2011-11-24 Lola Thompson

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

Number Theory · Mathematics 2026-03-13 Laura Capuano , Sara Checcoli , Marzio Mula , Lea Terracini