English
Related papers

Related papers: Automatic congruences for diagonals of rational fu…

200 papers

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

Number Theory · Mathematics 2017-03-08 Sandro Mattarei , Roberto Tauraso

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…

Number Theory · Mathematics 2016-05-13 Ioulia N. Baoulina

In this article we study $p$-adic properties of sequences of integers (or $p$-adic integers) that satisfy a linear recurrence with constant coefficients. For such a sequence, we give an explicit approximate twisted interpolation to $\mathbb…

Number Theory · Mathematics 2017-05-03 Eric Rowland , Reem Yassawi

The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. Congruences for $d_k(n)$ modulo certain powers of primes have been proven via elementary…

Number Theory · Mathematics 2025-08-19 Dandan Chen , Tianjian Xu , Siyu Yin

In this paper we present a procedure for computing the rational sum of the Hilbert series of a finitely generated monomial right module $N$ over the free associative algebra $K\langle x_1,\ldots,x_n \rangle$. We show that such procedure…

Rings and Algebras · Mathematics 2016-05-30 Roberto La Scala

We investigate the linear complexities of the periodic 0-1 infinite sequences in which the periods are the sequence of the parities of the spacings between quadratic residues modulo a prime p, and the sequence of the parities of the…

Information Theory · Computer Science 2019-05-07 Mihai Caragiu , Shannon Tefft , Aaron Kemats , Travis Maenle

We show that automatic sequences are asymptotically orthogonal to periodic exponentials of type $e_q(f(n))$, where $f$ is a rational fraction, in the P\'olya-Vinogradov range. This applies to Kloosterman sums, and may be used to study…

Number Theory · Mathematics 2017-10-04 Sary Drappeau , Clemens Müllner

An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…

Number Theory · Mathematics 2020-10-05 J. -P. Allouche , F. M. Dekking , M. Queffélec

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

Number Theory · Mathematics 2021-05-18 Arne Winterhof , Zibi Xiao

We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…

Symbolic Computation · Computer Science 2016-05-19 Alin Bostan , Gilles Christol , Philippe Dumas

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

Number Theory · Mathematics 2025-10-14 Hui-Li Han , Chen Wang

We establish a one-to-one correspondence between conjugacy classes of any Hecke group and irreducible systems of poles of rational period functions for automorphic integrals on the same group. We use this correspondence to construct…

Number Theory · Mathematics 2021-02-12 Wendell Ressler

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

Let $p$ be prime, and let $p_{[1,p]}(n)$ denote the function whose generating function is $\prod (1-q^n)^{-1}(1 - q^{pn})^{-1}$. This function and its generalizations $p_{[c^{\ell}, d^m]}(n)$ are the subject of study in several recent…

Number Theory · Mathematics 2026-02-12 Matthew Boylan , Swati

We develop a theory of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence, which also includes the possibility of dealing with several systems associated with sufficiently independent…

Number Theory · Mathematics 2020-12-16 Boris Adamczewski , Colin Faverjon

We consider the sequence of integers whose $n$th term has base-$p$ expansion given by the $n$th row of Pascal's triangle modulo $p$ (where $p$ is a prime number). We first present and generalize well-known relations concerning this…

Number Theory · Mathematics 2022-01-19 Pierre Mathonet , Michel Rigo , Manon Stipulanti , Naïm Zénaïdi

In this work, Ramanujan type congruences modulo powers of primes $p \ge 5$ are derived for a general class of products that are modular forms of level $p$. These products are constructed in terms of Klein forms and subsume generating…

Number Theory · Mathematics 2024-03-26 Timothy Huber , Nathaniel Mayes , Jeffery Opoku , Dongxi Ye

We prove two congruences for the coefficients of power series expansions in t of modular forms where t is a modular function. As a result, we settle two recent conjectures of Chan, Cooper and Sica. Additionally, we provide a table of…

Number Theory · Mathematics 2021-02-03 Robert Osburn , Brundaban Sahu

We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…

Rings and Algebras · Mathematics 2019-09-16 Sebastian Kreinecker

Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…

Number Theory · Mathematics 2016-04-04 Bengt Månsson
‹ Prev 1 8 9 10 Next ›