Related papers: Asymptotic formulas for stacks and unimodal sequen…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of…
In the Frobenius problem we are given a set of coprime, positive integers $a_1, a_2,...,a_k$, and are interested in the set of positive numbers NR that have no representation by the linear form $\sum_i a_ix_i$ in nonnegative integers $x_1,…
In this paper we describe an inductive machinery to investigate asymptotic behaviors of homology groups and related invariants of representations of certain graded combinatorial categories over a commutative Noetherian ring $k$, via…
Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…
We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
We give a general asymptotic formula for the growth rate of the number of indecomposable summands in the tensor powers of representations of finite groups, over a field of arbitrary characteristic. In characteristic zero we obtain…
We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort…
In this paper we give an asymptotic formula for a matrix integral which plays a crucial role in the approach of Diaconis et al. to random matrix eigenvalues. The choice of parameter for the asymptotic analysis is motivated by an invariant…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc.…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be…
We study partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. These permutations are the linear…
Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…
We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our…
This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…
In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…
Surprisingly, apart from some special cases, simple asymptotic expansions for the associated Legendre functions $P_\nu ^\mu (z)$ and $Q_\nu ^\mu (z)$ for large degree $\nu$ or large order $\mu$ are not available in the literature. The main…