Related papers: Stieltjes moment sequences for pattern-avoiding pe…
Many important statistical models fall outside classical moment-based methods due to the non-existence of moments or moment generating functions. We propose a generalised probabilistic framework in which densities are replaced by pairs…
For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…
The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…
Recent works have shown that the family of probability distributions with moments given by the Fuss-Catalan numbers permit a simple parameterized form for their density. We extend this result to the Raney distribution which by definition…
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…
In this work we study Stieltjes differential systems of which the derivators are allowed to change sign. This leads to the definition of the notion of \emph{function of controlled variation}, a characterization of precompact sets of…
An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets…
We study pattern avoidance by combinatorial objects other than permutations, namely by ordered partitions of an integer and by permutations of a multiset. In the former case we determine the generating function explicitly, for integer…
We consider the Stieltjes moment problem for the Berg-Urbanik semigroups which form a class of multiplicative convolution semigroups on $\mathbb{R}_+$ that is in bijection with the set of Bernstein functions. Berg and Dur\'an proved that…
Stieltjes integral theorem is more commonly known by the phrase 'integration by parts' and enables rearrangement of an otherwise intractable integral to a more amenable form; often permitting completion of an integral in closed form.…
Given a set $\Pi$ of permutation patterns of length at most $k$, we present an algorithm for building $S_{\le n}(\Pi)$, the set of permutations of length at most $n$ avoiding the patterns in $\Pi$, in time $O(|S_{\le n - 1}(\Pi)| \cdot k +…
Birch and Swinnerton-Dyer conjecture allows for sharp estimates on the rank of certain abelian varieties defined over $ \Q$. in the case of the jacobian of the modular curves, this problem is equivalent to the estimation of the order of…
We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…
We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in $14$ further terms of the generating function, which is now known for all patterns of length $\le 50$. We re-analyse the generating function…
Pattern-avoiding ascent sequences have recently been related to set-partition problems and stack-sorting problems. While the generating functions for several length-3 pattern-avoiding ascent sequences are known, those avoiding 000, 100,…
Partially ordered patterns (POPs) play an important role in the study of permutation patterns, providing a convenient framework for describing large families of classical patterns. The problem of enumerating permutations that avoid POPs has…
This article focuses on the mathematical problem of reconstructing dynamic permeability $K(\omega)$ of two-phase composites from data at different frequencies, utilizing the analytic structure of the Stieltjes function representation of…
Non-crossing and non-nesting permutations are variations of the well-known Stirling permutations. A permutation $\pi$ on $\{1,1,2,2,\ldots, n,n\}$ is called non-crossing if it avoids the crossing patterns $\{1212,2121\}$ and is called…
We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…
The Minkowski question mark function is a rich object which can be explored from the perspective of dynamical systems, complex dynamics, metric number theory, multifractal analysis, transfer operators, integral transforms, and as a function…