Related papers: Asymptotic results on Klazar set partition avoidan…
A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…
Biases in integer partitions have been studied recently. For three disjoint subsets $R,S,I$ of positive integers, let $p_{RSI}(n)$ be the number of partitions of $n$ with parts from $R\cup S\cup I$ and $p_{R>S,I}(n)$ be the number of such…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We investigate some asymptotic properties of extrema to a two-dimensional variational problem in the unit disk. Some results about non-radialicity of solutions are given.
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
We study properties of spectral minimal partitions of metric graphs within the framework recently introduced in [Kennedy et al, Calc. Var. 60 (2021), 61]. We provide sharp lower and upper estimates for minimal partition energies in…
We carry out the asymptotic analysis as $n \to \infty$ of a class of orthogonal polynomials $p_{n}(z)$ of degree $n$, defined with respect to the planar measure \begin{equation*} d\mu(z) = (1-|z|^{2})^{\alpha-1}|z-x|^{\gamma}\mathbf{1}_{|z|…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
A set partition $\sigma$ of $[n]=\{1,\cdots ,n\}$ contains another set partition $\omega$ if a standardized restriction of $\sigma$ to a subset $S\subseteq[n]$ is equivalent to $\omega$. Otherwise, $\sigma$ avoids $\omega$. Sagan and Goyt…
The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…
Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide a more general bivariate asymptotic using the multivariate…
We study the asymptotic distribution of the two following combinatorial parameters: the number of arc crossings in the linear representation, ${\mathrm cr^{(\ell)}$, and the number of chord crossings in the circular representation,…
We analyze the practices of reservoir computing in the framework of statistical learning theory. In particular, we derive finite sample upper bounds for the generalization error committed by specific families of reservoir computing systems…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.
The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,\delta)$:= (relative transmission rate, relative minimal…
In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…
We discuss a general approach to building non-asymptotic confidence bounds for stochastic optimization problems. Our principal contribution is the observation that a Sample Average Approximation of a problem supplies upper and lower bounds…
Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…
Problems in exponential asymptotics are typically characterized by divergence of the associated asymptotic expansion in the form of a factorial divided by a power. In this paper, we demonstrate that in certain classes of problems that…