Related papers: Structure and asymptotics for Motzkin numbers modu…
We establish the asymptotic density of the Motzkin numbers modulo small primes.
We establish a lower bound of 2/p(p-1) for the asymptotic density of the Motzkin numbers divisible by a general prime number p > 3. We provide a criteria for when this asymptotic density is actually 1. We also provide a partial…
Let $C_n$ be the $n$th Catalan number. We show that the asymptotic density of the set $\{n: C_n \equiv 0 \mod p \}$ is $1$ for all primes $p$, We also show that if $n = p^k -1$ then $C_n \equiv -1 \mod p$. Finally we show that if $n \equiv…
The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in…
This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…
We establish the asymptotic density of the Catalan numbers modulo 3 and modulo powers of 2.
We show that the set of the numbers that are the sum of a prime and a Fibonacci number has positive lower asymptotic density.
Motzkin numbers are derived from a special case of Random Domino Automaton - recently proposed toy model of earthquakes. An exact solution of the set of equations describing stationary state of Random Domino Automaton in "inverse-power"…
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…
The article motivates, presents and describes large computer calculations concerning the asymptotic behaviour of arithmetic properties of coefficient fields of modular forms. The observations suggest certain patterns, which deserve further…
We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…
We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…
We search for regularities in the sequences of numbers of preimages for elementary cellular automata. For 46 out of 88 "minimal" rules, we find recognizable patterns, usually in the form of second order recurrence equations with constant…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…
A "simple trace formula" is used to derive an asymptotic result for class numbers of complex cubic orders.
Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial…
In this paper we determine the asymptotic density of coprime fractions in those of the reduced fractions of number fields. When ordered by norms of denominators, we count a fraction as soon as it ``appears'' for the first time and no later.…
We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotar\"ev's density theorem to the cyclic case.
We give a formula for the density of $0$ in the sequence of generalized Motzkin numbers, $M^{a, b}_n$, modulo a prime, $p$, in terms of the first $p$ generalized central trinomial coefficients $T^{a, b}_n\bmod p$ (with $n<p$). We apply our…
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in…