We study compositions of the integer n in which the first part, successive differences, and the last part are constrained to lie in prescribed sets L, D, R, respectively. A simple condition on D guarantees that the generating function f(x, L, D, R) has only a simple pole on its circle of convergence and this at r(D), a function independent of L and R. Thus the number of compositions is asymptotic to Ar(D) −n for a suitable constant A = A(L, D, R). We prove a multivariate central and local limit theorem and apply it to various statistics of random locally restricted compositions of n, such as number of parts, numbers of parts of given sizes, and number of rises. The first and last parts are shown to have limiting distributions and to be asym...
CombinatoricsA composition of a positive integer n is a finite sequence of positive integers a(1), a...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
A decomposable combinatorial structure consists of simpler objects called components which by thems ...
A composition of n is a sequence of positive integers, called parts, that sum to n. Given a set S of...
We define the notion of $t$-free for locally restricted compositions, which means roughly that if su...
International audienceWe study pairs and m-tuples of compositions of a positive integer n with parts...
AbstractWe study pairs and m-tuples of compositions of a positive integer n with parts restricted to...
AbstractWe study pairs and m-tuples of compositions of a positive integer n with parts restricted to...
2018-04-09In this dissertation we study cycles of permutations with restricted positions. Permutatio...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
Random compositions of integers are used as theoretical models for many applications. The degree of ...
We prove a joint local limit law for the distribution of the r largest components of decomposable lo...
Compositions of integers are used as theoretical models for many applications. The degree of distinc...
AbstractSzekeres proved, using complex analysis, an asymptotic formula for the number of partitions ...
We study two types of probability measures on the set of integer partitions of n with at most m part...
CombinatoricsA composition of a positive integer n is a finite sequence of positive integers a(1), a...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
A decomposable combinatorial structure consists of simpler objects called components which by thems ...
A composition of n is a sequence of positive integers, called parts, that sum to n. Given a set S of...
We define the notion of $t$-free for locally restricted compositions, which means roughly that if su...
International audienceWe study pairs and m-tuples of compositions of a positive integer n with parts...
AbstractWe study pairs and m-tuples of compositions of a positive integer n with parts restricted to...
AbstractWe study pairs and m-tuples of compositions of a positive integer n with parts restricted to...
2018-04-09In this dissertation we study cycles of permutations with restricted positions. Permutatio...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
Random compositions of integers are used as theoretical models for many applications. The degree of ...
We prove a joint local limit law for the distribution of the r largest components of decomposable lo...
Compositions of integers are used as theoretical models for many applications. The degree of distinc...
AbstractSzekeres proved, using complex analysis, an asymptotic formula for the number of partitions ...
We study two types of probability measures on the set of integer partitions of n with at most m part...
CombinatoricsA composition of a positive integer n is a finite sequence of positive integers a(1), a...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
A decomposable combinatorial structure consists of simpler objects called components which by thems ...