English
Related papers

Related papers: Robbins and Ardila meet Berstel

200 papers

For every monic polynomial $f \in \mathbb{Z}[X]$ with $\operatorname{deg}(f) \geq 1$, let $\mathcal{L}(f)$ be the set of all linear recurrences with values in $\mathbb{Z}$ and characteristic polynomial $f$, and let \begin{equation*}…

Number Theory · Mathematics 2024-01-17 Federico Accossato , Carlo Sanna

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

Number Theory · Mathematics 2025-08-13 Lucas Reis

A consequence of de Finetti's representation theorem is that for every infinite sequence of exchangeable 0-1 random variables $(X_k)_{k\geq1}$, there exists a probability measure $\mu$ on the Borel sets of $[0,1]$ such that $\bar X_n =…

Probability · Mathematics 2016-01-26 Guillaume Mijoule , Giovanni Peccati , Yvik Swan

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

Number Theory · Mathematics 2016-01-27 Junsoo Ha

Let $a(r,n)$ be $r$th coefficient of $n$th cyclotomic polynomial. Suzuki proved that $\{a(r,n)|r\geq 1,n\geq 1\}=\mathbb{Z}$. If $m$ and $n$ are two natural numbers we prove an analogue of Suzuki's theorem for divisors of $x^n-1$ with…

Number Theory · Mathematics 2015-11-13 Sai Teja Somu

In the theory of orthogonal polynomials, as well as in its intersection with harmonic analysis, it is an important problem to decide whether a given orthogonal polynomial sequence $(P_n(x))_{n\in\mathbb{N}_0}$ satisfies nonnegative…

Classical Analysis and ODEs · Mathematics 2024-06-07 Stefan Kahler

Using Lie theory, Stefano Capparelli conjectured an interesting Rogers-Ramanujan type partition identity in his 1988 Rutgers Ph.D. thesis. The first proof was given by George Andrews, using combinatorial methods. Later, Capparelli was able…

Classical Analysis and ODEs · Mathematics 2018-12-12 Andrew V. Sills

Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…

Number Theory · Mathematics 2016-03-04 Michael E. Zieve

For each integer $b \geq 3$ and every $x \geq 1$, let $\mathcal{N}_{b,0}(x)$ be the set of positive integers $n \leq x$ which are divisible by the product of their nonzero base $b$ digits. We prove bounds of the form $x^{\rho_{b,0} + o(1)}…

Number Theory · Mathematics 2020-12-15 Carlo Sanna

Prunescu and Sauras-Altuzarra showed that all C-recursive sequences of natural numbers have an arithmetic div-mod representation that can be derived from their generating function. This representation consists of computing the quotient of…

Number Theory · Mathematics 2025-02-25 Mihai Prunescu , Joseph M. Shunia

Zeckendorf's theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers; this result has been generalized to many recurrence relations, especially those arising from linear recurrences with…

Combinatorics · Mathematics 2016-07-04 Minerva Catral , Pari L. Ford , Pamela E. Harris , Steven J. Miller , Dawn Nelson

In the study of theta series and partition functions, Andrews and Merca, Guo and Zeng independently conjectured that a truncated Jacobi triple product series has nonnegative coefficients. This conjecture was proved analytically by Mao and…

Number Theory · Mathematics 2025-06-05 Xiangyu Ding , Lisa Hui Sun

In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive…

Number Theory · Mathematics 2016-06-07 Uwe Stroinski

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

Number Theory · Mathematics 2025-12-04 Anders Mah

Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result, though with a different notion of a legal decomposition, holds for many other sequences. We use these…

Number Theory · Mathematics 2018-09-17 Paul Baird-Smith , Alyssa Epstein , Kristen Flint , Steven J. Miller

In 1857 Sylvester stated a result on determinants without proof that was recognized as important over the subsequent century. Thus it was a surprise to Akritas, Akritas and Malaschonok when they found only one English proof - given by…

History and Overview · Mathematics 2015-12-31 Jan Vrbik , Paul Vrbik

Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…

Number Theory · Mathematics 2017-01-04 Khristo N. Boyadzhiev

We prove that the generalised Fibonacci group F(r,n) is infinite for (r,n) in {(7 + 5k,5), (8 + 5k,5)} where k is greater than or equal to 0. This together with previously known results yields a complete classification of the finite F(r,n),…

Group Theory · Mathematics 2017-10-11 M. Edjvet , A. Juhasz

A formula for the number of monic irreducible self-reciprocal polynomials, of a given degree over a finite field, was given by Carlitz in 1967. In 2011 Ahmadi showed that Carlitz's formula extends, essentially without change, to a count of…

Number Theory · Mathematics 2023-02-21 Sandro Mattarei , Marco Pizzato

This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the…

Number Theory · Mathematics 2019-03-19 Jon Grantham
‹ Prev 1 3 4 5 6 7 10 Next ›