English
Related papers

Related papers: Generalized $k$-regular sequences II:digital patte…

200 papers

In this article we discuss the transcendence of certain infinite sums and products by using the Subspace theorem. In particular we improve the result of Han\v{c}l and Rucki \cite{hancl3}.

Number Theory · Mathematics 2019-05-22 Veekesh Kumar , Bill Mance

We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences like the sum of digits in base $q$ modulo $m$, the Rudin-Shapiro sequence and some generalizations. This gives, for any base, a class…

Number Theory · Mathematics 2017-11-15 Clemens Müllner

In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…

Combinatorics · Mathematics 2019-09-12 Anna A. Taranenko

A general method is developed for deriving Quantum First and Second Fundamental Theorems of Coinvariant Theory from classical analogs in Invariant Theory, in the case that the quantization parameter q is transcendental over a base field.…

Quantum Algebra · Mathematics 2007-05-23 K R Goodearl , T H Lenagan

In the present paper, we give sufficient conditions on the elements of the continued fractions $A$ and $B$ that will assure us that the continued fraction $A^B$ is a transcendental number. With the same condition, we establish a…

Number Theory · Mathematics 2023-06-22 Sarra Ahallal , Ali Kacha

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

Combinatorics · Mathematics 2020-05-27 Xiaoyu He , Matthew Kwan

Many digital functions studied in the literature, e.g., the summatory function of the base-$k$ sum-of-digits function, have a behavior showing some periodic fluctuation. Such functions are usually studied using techniques from analytic…

Discrete Mathematics · Computer Science 2017-05-24 Julien Leroy , Michel Rigo , Manon Stipulanti

We prove the analogue of Schanuel's conjecture for raising to the power of an exponentially transcendental real number. All but countably many real numbers are exponentially transcendental. We also give a more general result for several…

Number Theory · Mathematics 2011-08-05 Martin Bays , Jonathan Kirby , A. J. Wilkie

{\em The Liouville number}, denoted $l$, is defined by $$l:=0.100101011101101111100...,$$ where the $n$th bit is given by ${1/2}(1+\gl(n))$; here $\gl$ is the Liouville function for the parity of prime divisors of $n$. Presumably the…

Number Theory · Mathematics 2008-06-11 Peter Borwein , Michael Coons

In general, some of the well known results of measure theory dealing with the convergence of sequences of functions such as the Dominated Convergence Theorem or the Monotone Convergence Theorem are not true when we consider arbitrary nets…

Functional Analysis · Mathematics 2023-07-19 Daniel L. Rodríguez-Vidanes

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

Generative models are trained with the simple objective of imitating the conditional probability distribution induced by the data they are trained on. Therefore, when trained on data generated by humans, we may not expect the artificial…

Machine Learning · Computer Science 2024-10-15 Edwin Zhang , Vincent Zhu , Naomi Saphra , Anat Kleiman , Benjamin L. Edelman , Milind Tambe , Sham M. Kakade , Eran Malach

For any particularly interesting theorem one proof is never enough. Instead, the first proof sets the challenge to find a more elegant method that illuminates subtle features of the math, is simpler to understand, or even avoids using…

History and Overview · Mathematics 2014-01-23 Christina Knapp , Cesar E. Silva

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…

Combinatorics · Mathematics 2007-05-23 Bruce E. Sagan , Ping Zhang

The proofs that the real numbers are denumerable will be shown, i.e., that there exists one-to-one correspondence between the natural numbers $N$ and the real numbers $\Re$. The general element of the sequence that contains all real numbers…

General Mathematics · Mathematics 2007-05-23 Slavica Vlahovic , Branislav Vlahovic

Continued fraction expansions provide a well-established bridge between algebraic properties of numbers and combinatorics on words. In this article, we investigate the algebraicity of $p$-adic numbers whose continued fractions arise from…

Number Theory · Mathematics 2025-03-21 Laura Capuano , Sara Checcoli , Marzio Mula , Lea Terracini

In this paper, we obtain additional results for a fractional counting process introduced and studied by Di Crescenzo et al. (2016). For convenience, we call it the generalized fractional counting process (GFCP). It is shown that the…

Probability · Mathematics 2023-02-15 K. K. Kataria , M. Khandakar

In this treatise on the theory of the continuum of the surreal numbers of J.H. Conway, is proved ,that the three different techniques and hierarchies of the continuums of the transfinite real numbers of Glayzal A. (1937) defined through…

General Mathematics · Mathematics 2022-07-26 Konstantinos E. Kyritsis

A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…

Classical Analysis and ODEs · Mathematics 2011-10-26 Armen Bagdasaryan

Let $R$ be a subring of $\mathbb{C}[[z]]$, and let $X \in \mathbb{C}[[z]]$. The Newton-Puiseux Theorem implies that if the coefficients of $X$ grow sufficiently rapidly relative to the coefficients of the series in $R$, then $X$ is…

Number Theory · Mathematics 2021-03-08 Robert Dawson , Grant Molnar