Related papers: Singular combinatorics
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
Existing methods of series analysis are largely designed to analyse the structure of algebraic singularities. Functions with such singularities have their $n^{th}$ coefficient behaving asymptotically as $A \cdot \mu^n \cdot n^g.$ Recently,…
Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…
We extend the notion of mex, which is central in combinatorial number theory, to an arbitrary combinatorial structure, and we prove a general theorem to determine the generating function of the objects having fixed mex. We then study this…
We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…
Probabilistic submeasures generalizing the classical (numerical) submeasures are introduced and discussed in connection with some classes of aggregation functions. A special attention is paid to triangular norm-based probabilistic…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…
Asymptotic statistical theory for estimating functions is reviewed in a generality suitable for stochastic processes. Conditions concerning existence of a consistent estimator, uniqueness, rate of convergence, and the asymptotic…
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
S. Ekhad and D. Zeilberger recently proved that the multivariate generating function for the number of simple singular vector tuples of a generic $m_1 \times \cdots \times m_d$ tensor has an elegant rational form involving elementary…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…
In this paper we consider a discrete-time dynamical system on the real line by random iteration of two functions. These functions are assumed to satisfy appropriate monotonicity conditions; optionally, a symmetry condition may be imposed.…
The aim of this paper is to continue the study of asymptotic expansions and summability in a monomial in any number of variables. In particular we characterize these expansions in terms of bounded derivatives and we develop tauberian…
The ensemble inter-relations to be considered are special features of classical cases, where the joint eigenvalue probability density can be computed explicitly. Attention will be focussed too on the consequences of these inter-relations,…