English
Related papers

Related papers: Structure and asymptotics for Motzkin numbers modu…

200 papers

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

Number Theory · Mathematics 2013-11-28 Hans Vernaeve , Jasson Vindas , Andreas Weiermann

We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial…

Formal Languages and Automata Theory · Computer Science 2011-09-27 Frederique Bassino , Julien David , Andrea Sportiello

For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…

Number Theory · Mathematics 2019-05-02 Kam Hung Yau

A model of the oscillatory component of interaction of inner boundaries is studied; and the features of generation of the composite structure in interim asymptotics are considered. A model of a multiscale net of inner boundaries was used to…

Adaptation and Self-Organizing Systems · Physics 2017-08-22 Alexander Herega

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev , A. A. Karatsuba

We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…

Cellular Automata and Lattice Gases · Physics 2013-04-23 Malgorzata J. Krawczyk

In this paper we focus on modules over a finite chain ring $\mathcal{R}$ of size $q^s$. We compute the density of free modules of $\mathcal{R}^n$, where we separately treat the asymptotics in $n,q$ and $s$. In particular, we focus on two…

Information Theory · Computer Science 2022-02-09 Eimear Byrne , Anna-Lena Horlemann , Karan Khathuria , Violetta Weger

We determine the asymptotic density $\delta_k$ of the set of ordered $k$-tuples $(n_1,...,n_k)\in \N^k, k\ge 2$, such that there exists no prime power $p^a$, $a\ge 1$, appearing in the canonical factorization of each $n_i$, $1\le i\le k$,…

Number Theory · Mathematics 2007-05-23 László Tóth

We study the asymptotic properties of a class of multiple orthogonal polynomials with respect to a Nikishin system generated by two measures $(\sigma_1, \sigma_2)$ with unbounded supports (${supp}(\sigma_1) \subset \mathbb{R}_+$,…

Classical Analysis and ODEs · Mathematics 2014-10-07 A. I. Aptekarev , G. Lopez Lagomasino , A. Martinez-Finkelshtein

Regular and singular parts of asymptotic expansions of semi-Markov random evolutions are given. Regularity of boundary conditions is shown. An algorithm for calculation of initial conditions is proposed.

Probability · Mathematics 2009-11-03 S. Albeverio , V. S. Koroliuk , I. V. Samoilenko

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

Functional Analysis · Mathematics 2020-10-01 Lassi Paunonen , David Seifert

We study the moduli space for an arbitrary number of BPS monopoles in a gauge theory with an arbitrary gauge group that is maximally broken to $U(1)^k$. From the low energy dynamics of well-separated dyons we infer the asymptotic form of…

High Energy Physics - Theory · Physics 2009-10-30 Kimyeong Lee , Erick J. Weinberg , Piljin Yi

We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…

Combinatorics · Mathematics 2015-10-06 Olivier Bodini , Danièle Gardy , Bernhard Gittenberger , Zbigniew Gołębiewski

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set…

Logic in Computer Science · Computer Science 2015-07-01 Bernard Boigelot , Julien Brusten , Veronique Bruyere

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

Combinatorics · Mathematics 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

Number Theory · Mathematics 2021-12-09 Victor Volfson

Based on the work of Green, Tao and Ziegler, we give asymptotics when $N \to \infty$ for the number of $n \times n$ magic squares with their entries being prime numbers in $[0,N]$. For every $n \ge 3$ we give appropriate systems of linear…

Number Theory · Mathematics 2012-07-18 Carlos Vinuesa

In this paper, we perform an arithmetization of well-formed parenthesis strings with zeros (Motzkin words) and of corresponding Motzkin paths. The transformations used are reminiscent of G\"odel numbering for mathematical objects of some…

Combinatorics · Mathematics 2020-12-24 Gennady Eremin

We determine the asymptotic behavior of twisted traces of singular moduli with a power-saving error term in both the discriminant and the order of the pole at $i\infty$. Using this asymptotic formula, we obtain an exact formula for these…

Number Theory · Mathematics 2022-06-06 Nickolas Andersen , William Duke

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson