Asymptotically optimal tree-packings in regular graphs.
Asymptotics for coefficients of algebraic functions.
Asymptotics for incidence matrix classes.
Asymptotics for Lacunary sums of binomial coefficients and a card problem with ranks.
Asymptotics for random walks in alcoves of affine Weyl groups.
Asymptotics for rooted bipartite planar maps and scaling limits of two-type spatial trees.
Asymptotics for the number of -quasigroups of order 4.
Asymptotics for the probability of connectedness and the distribution of number of components.
Asymptotics of coefficients of multivariate generating functions: Improvements for smooth points.
Asymptotics of counts of small components in random structures and models of coagulation-fragmentation
We establish necessary and sufficient conditions for the convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. The multiplicative measures depict distributions of component spectra of random structures and also the equilibria of classic models of statistical mechanics and stochastic processes of coagulation-fragmentation. We show that the convergence of multiplicative measures is equivalent to the asymptotic independence of counts of...
Asymptotics of generating the symmetric and alternating groups.
Asymptotics of permutations with nearly periodic patterns of rises and falls.
Asymptotics of some convolutional recurrences.
Asymptotics of the average height of 2-watermelons with a wall.
Asymptotics of the number of -words with an -descent.
Asymptotics of Young diagrams and Hook numbers.
Asymptotische Abschätzung einer Anzahlfunktion in endlichen Relationssystemen.
Atomic compactness and elementary equivalence
Atomic compactness for reflexive graphs
A first order structure with universe M is atomic compact if every system of atomic formulas with parameters in M is satisfiable in provided each of its finite subsystems is. We consider atomic compactness for the class of reflexive (symmetric) graphs. In particular, we investigate the extent to which “sparse” graphs (i.e. graphs with “few” vertices of “high” degree) are compact with respect to systems of atomic formulas with “few” unknowns, on the one hand, and are pure restrictions of their...
Atomic Latin squares based on cyclotomic orthomorphisms.