English
Related papers

Related papers: Computer assisted proof for Apwenian sequences rel…

200 papers

To each nonzero sequence $s:= \{s_{n}\}_{n \geq 0}$ of real numbers we associate the Hankel determinants $D_{n} = \det \mathcal{H}_{n}$ of the Hankel matrices $\mathcal{H}_{n}:= (s_{i + j})_{i, j = 0}^{n}$, $n \geq 0$, and the nonempty set…

Classical Analysis and ODEs · Mathematics 2016-05-11 Andrew Bakan , Christian Berg

E. Heine in the 19th century studied a system of orthogonal polynomials associated with the weight $\left[x(x-\alpha)(x-\beta)\right]^{-\frac{1}{2}}$, $x\in[0,\alpha]$, $0<\alpha<\beta$. A related system was studied by C. J. Rees in 1945,…

Classical Analysis and ODEs · Mathematics 2015-06-17 Estelle L. Basor , Yang Chen , Nazmus S. Haq

Let $p$ be a prime number and consider a $p$-automatic sequence ${\bf u}=(u_{n})_{n\in\N}$ and its generating function $U(X)=\sum_{n=0}^{\infty}u_{n}X^{n}\in\mathbb{F}_{p}[[X]]$. Moreover, let us suppose that $u_{0}=0$ and $u_{1}\neq 0$ and…

Combinatorics · Mathematics 2016-01-20 Maciej Gawro , Maciej Ulas

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

Combinatorics · Mathematics 2025-07-29 Christian Krattenthaler , Thomas W. Müller

For each integer n > 1, we present an element in $Q((T^-1))$, having a power series expansion based on an infinite word W(n), over the alphabet ${+1;-1}g and whose continued fraction expansion has a particular pattern which is explicitly…

Number Theory · Mathematics 2025-05-27 Bill Allombert , Alain Lasjaunias

In the paper, we give the recurrent equations of the Hankel determinants of the Cantor sequence, and show that the Hankel determinants as a double sequence is 3-automatic. With the help of the Hankel determinants, we prove that the…

Number Theory · Mathematics 2014-11-12 Zhi-xiong Wen , Wen Wu

The Stern polynomials defined by $s(0;x)=0$, $s(1;x)=1$, and for $n\geq 1$ by $s(2n;x)=s(n;x^2)$ and $s(2n+1;x)=x\,s(n;x^2)+s(n+1;x^2)$ have only 0 and 1 as coefficients. We construct an infinite lower-triangular matrix related to the…

Combinatorics · Mathematics 2021-06-22 George Beck , Karl Dilcher

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

Combinatorics · Mathematics 2013-02-12 Milan Janjic

Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which…

Combinatorics · Mathematics 2021-10-14 Narad Rampersad , Jeffrey Shallit

Nous d\'ecrivons quelques r\'esultats r\'ecents sur la suite de Thue-Morse, ainsi que des questions ou conjectures, dont l'une, due \`a Shevelev, est r\'esolue dans cet article. We describe some recent results on the Thue-Morse sequence. We…

Number Theory · Mathematics 2014-02-04 Jean-Paul Allouche

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

Number Theory · Mathematics 2015-10-26 Gholam Reza Pourgholi , Hendrik Van Maldeghem

We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…

Numerical Analysis · Mathematics 2020-10-15 Irmina Walawska , Daniel Wilczak

We prove that when suitably normalized, small enough powers of the absolute value of the characteristic polynomial of random Hermitian matrices, drawn from one-cut regular unitary invariant ensembles, converge in law to Gaussian…

Probability · Mathematics 2017-09-19 Nathanaël Berestycki , Christian Webb , Mo Dick Wong

We prove that a sequence satisfying a certain symmetry property is $2$-regular in the sense of Allouche and Shallit, i.e., the $\mathbb{Z}$-module generated by its $2$-kernel is finitely generated. We apply this theorem to develop a general…

Formal Languages and Automata Theory · Computer Science 2023-09-04 Aline Parreau , Michel Rigo , Eric Rowland , Elise Vandomme

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

We define the category $Rec(\mathbb K)$ of recurrence matrices over a field $\mathbb K$ and use it to calculate determinants of Hankel matrices related to the Thue-Morse sequence.

Number Theory · Mathematics 2007-05-23 Roland Bacher

In 1908 Thue (1) showed that algebraic numbers of the special form $\xi =\sqrt[n]{\frac{a}{b}}$ can, for every positive $\epsilon$, only be sharply approximated by finitely many rational numbers $\frac{p}{q}$ with the following inequality…

History and Overview · Mathematics 2025-08-26 Kurt Mahler

We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…

Number Theory · Mathematics 2020-06-23 Yining Hu , Guoniu Wei-Han

In this paper, we consider polynomials orthogonal with respect to a varying perturbed Laguerre weight $e^{-n(z-\log z+t/z)}$ for $t<0$ and $z$ on certain contours in the complex plane. When the parameters $n$, $t$ and the degree $k$ are…

Classical Analysis and ODEs · Mathematics 2016-01-20 Shuai-Xia Xu , Dan Dai , Yu-Qiu Zhao

The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\mathbb{F}_q$ the converse…

Number Theory · Mathematics 2017-11-30 László Mérai , Arne Winterhof