Related papers: Algorithmic aspects of Newman polynomials and thei…

The Mahler measures of some n-variable polynomial families are given in terms of special values of the Riemann zeta function and a Dirichlet L-series, generalizing the results of \cite{L}. The technique introduced in this work also…

We formulate Lehmer's Problem about the Mahler measure of polynomials for general compact abelian groups, introducing a Lehmer constant for each such group. We show that all nontrivial connected compact groups have the same Lehmer constant,…

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length $N$ taking values of size close to $N^{3/4}$, which is the critical situation for several…

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

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…

The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…

This paper is concerned with Lagrange interpolation by total degree polynomials in moderate dimensions. In particular, we are interested in characterising the optimal choice of points for the interpolation problem, where we define the…

For each algebraic number $\alpha$ and each positive real number $t$, the $t$-metric Mahler measure $m_t(\alpha)$ creates an extremal problem whose solution varies depending on the value of $t$. The second author studied the points $t$ at…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

The main purpose of this article is to provide new results on algebraic independence of values of Mahler functions and their generalizations. Simultaneously, we establish new measures of algebraic independence for these values. Among the…

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…

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…

Lehmer's famous problem asks whether the set of Mahler measures of polynomials with integer coefficients admits a gap at 1. In 2019, L\"uck extended this question to Fuglede-Kadison determinants of a general group, and he defined the…

In analogy with the regularity lemma of Szemer\'edi, regularity lemmas for polynomials shown by Green and Tao (Contrib. Discrete Math. 2009) and by Kaufman and Lovett (FOCS 2008) modify a given collection of polynomials \calF =…

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…

We introduce certain special polynomials in an arbitrary number of indeterminates over a finite field. These polynomials generalize the special polynomials associated to the Goss zeta function and Goss-Dirichlet $L$-functions over the ring…