English
Related papers

Related papers: Salem numbers and Pisot numbers via interlacing

200 papers

Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…

Number Theory · Mathematics 2024-02-23 Aafko Boonstra , Charlene Kalle

We put forward a proof of Solomon's rule, in terms of matrices, for multiplication in the descent algebra of the symmetric group. Our proof exploits the graphs that we can obtain from all the subsets of the set of transpositions,…

Combinatorics · Mathematics 2007-06-20 Stephanie J. van Willigenburg

Closed classes of three-valued logic generated by symmetric funtions that equal $1$ in almost all tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence for these classes is obtained.

Logic · Mathematics 2015-04-15 Anna Mikhailovich

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

Classical Analysis and ODEs · Mathematics 2026-04-29 Kerstin Jordaan , Vikash Kumar

Given a sequence of frequencies $\{\lambda_n\}_{n\geq1}$, a corresponding generalized Dirichlet series is of the form $f(s)=\sum_{n\geq 1}a_ne^{-\lambda_ns}$. We are interested in multiplicatively generated systems, where each number…

Number Theory · Mathematics 2024-05-08 Frederik Broucke , Athanasios Kouroupis , Karl-Mikael Perfekt

We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…

Number Theory · Mathematics 2025-06-18 Gal Binyamini , Fumiharu Kato

Our main result is to answer a question of Michel Balazard by giving a Dirichlet series with only one zero in its half-plane of convergence. At the end of the paper we also give several sufficient conditions for the Generalized Riemann…

Number Theory · Mathematics 2024-04-29 T. Hilberdink , E. Saias

We construct interpolation operators for functions taking values in a symmetric space -- a smooth manifold with an inversion symmetry about every point. Key to our construction is the observation that every symmetric space can be realized…

Numerical Analysis · Mathematics 2016-05-24 Evan Gawlik , Melvin Leok

We identify a family of numbers for which the Bernoulli convolution is singular. Within this family we find two countable collections of Salem numbers in the interval $(1,2)$, and another Salem number and an algebraic integer that is…

Dynamical Systems · Mathematics 2017-08-22 Karma Dajani , Charlene Kalle

The set of Salem numbers is proved to be bounded from below by $\theta_{31}^{-1}= 1.08544\ldots$ where $\theta_{n}$, $ n \geq 2$, is the unique root in $(0,1)$ of the trinomial $-1+x+x^n$. Lehmer's number $1.176280\ldots$ belongs to the…

Number Theory · Mathematics 2024-01-12 Jean-Louis Verger-Gaugry

Following a systematic analysis of existing results, we investigate when complete interlacing between the zeros of distinct polynomial sequences, $\{\mathcal{P}_n\}$ and $\{\mathcal{G}_n\}$ can be achieved by using a naturally arising extra…

Classical Analysis and ODEs · Mathematics 2026-04-07 Kerstin Jordaan , Vikash Kumar

This paper investigates lower bounds on the number of zeros and poles of a general Dirichlet series in a disk of radius $r$ and gives, as a consequence, an affirmative answer to an open problem of Bombieri and Perelli on the bound.…

Complex Variables · Mathematics 2016-02-29 Bao Qin Li

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…

Number Theory · Mathematics 2015-05-13 Graham Everest , Patrick Ingram , Valery Mahe , Shaun Stevens

We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…

Number Theory · Mathematics 2025-11-05 Lenny Fukshansky , Evelyne Knight

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

Number Theory · Mathematics 2026-04-10 Soumyarup Banerjee , Ben Kane , Kwan To Ng

A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…

Combinatorics · Mathematics 2013-01-29 Sophie Burrill , Lily Yen

We give a reformulation of Salem's conjecture about the absence of Salem numbers near one in terms of a uniform spectral gap for certain arithmetic hyperbolic surfaces.

Number Theory · Mathematics 2016-12-20 Emmanuel Breuillard , Bertrand Deroin

It is shown that the set of palindromes is an additive basis for the natural numbers in any base. Specifically, we prove that every natural number can be expressed as the sum of $O(d)$ palindromes in base $d$.

Number Theory · Mathematics 2022-04-19 Yu Gao

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…

Computational Complexity · Computer Science 2015-04-17 Christian Glasser , Peter Jonsson , Barnaby Martin