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

The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…

Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…

Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…

A. Renyi \cite{Renyi} made a definition that gives one generalization of simple normality in the context of $Q$-Cantor series. Similarly, in this paper we give a definition which generalizes the notion of normality in the context of…

By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…

Yor's generalized meander is a temporally inhomogeneous modification of the $2(\nu+1)$-dimensional Bessel process with $\nu > -1$, in which the inhomogeneity is indexed by $\kappa \in [0, 2(\nu+1))$. We introduce the non-colliding particle…

We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…

An overlooked formula of E. Lucas for the generalized Bernoulli numbers is proved using generating functions. This is then used to provide a new proof and a new form of a sum involving classical Bernoulli numbers studied by K. Dilcher. The…

This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…

Attempting to create a general framework for studying new results on transcendental numbers, this paper begins with a survey on transcendental numbers and transcendence, it then presents several properties of the transcendental numbers $e$…

We summarise known algebraic and model theoretic results on the ring $\mathscr{A}$ of integers modulo infinitely large primes for number theorists, and share topics in transcendental number theory with algebraists and model theorists. In…

In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

The uncountability of $\mathbb{R}$ is one of its most basic properties, known far outside of mathematics. Cantor's 1874 proof of the uncountability of $\mathbb{R}$ even appears in the very first paper on set theory, i.e. a historical…

We introduce two families of transcendental numbers which we call finite factorial (FF) and partially finite factorial (PFF) numbers respectively, with the former one being subfamily of the latter one. These numbers arise naturally from…

A remarkable aspect of quantum theory is that certain measurement outcomes are entirely unpredictable to all possible observers. Such quantum events can be harnessed to generate numbers whose randomness is asserted based upon the underlying…

We will consider a convex unbounded set and certain group of actions $G$ on this set. This will substitute the translation (by adding) structure usually consider in the classical setting of prevalence. In this way we will be able to define…

We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…

We focus on a data sequence produced by repetitive quantum measurement on an internal hidden quantum system, and call it a hidden Markovian process. Using a quantum version of the Perron-Frobenius theorem, we derive novel upper and lower…

By using Andrews's explicit formulae of the $q$-Fibonacci sequence introduced by Schur, we prove certain congruences of the $q$-Fibonacci sequence which relate the sequence with the original Fibonacci sequence. As a corollary, we show that…