Related papers: Stieltjes moment sequences for pattern-avoiding pe…
We give a new estimate on Stieltjes integrals of H\"older continuous functions and use it to prove an existence-uniqueness theorem for solutions of ordinary differential equations with H\"older continuous forcing. We construct stochastic…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…
We enumerate the pattern class Av(2143,4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes.
By using Schur transformed sequences and Dyukarev-Stieltjes parameters we obtain a new representation of the resolvent matrix corresponding to the truncated matricial Stieltjes moment problem. Explicit relations between orthogonal matrix…
Periodic Geometry studies isometry invariants of periodic point sets that are also continuous under perturbations. The motivations come from periodic crystals whose structures are determined in a rigid form but any minimal cells can…
Enumeration problems related to words avoiding patterns as well as permutations that contain the pattern $123$ exactly once have been studied in great detail. However, the problem of enumerating words that contain the pattern $123$ exactly…
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…
This work is devoted to the obtaining of a new numerical scheme based in quadrature formulas for the Lebesgue-Stieltjes integral for the approximation of Stieltjes ordinary differential equations. This novel method allows us to numerically…
Permutation pattern-avoidance is a central concept of both enumerative and extremal combinatorics. In this paper we study the effect of permutation pattern-avoidance on the complexity of optimization problems. In the context of the dynamic…
A new method of verifying the subnormality of unbounded Hilbert space operators based on an approximation technique is proposed. Diverse sufficient conditions for subnormality of unbounded weighted shifts on directed trees are established.…
Beginning with work of Zeilberger on classical pattern counts, there are a variety of structural results for moments of permutation statistics applied to random permutations. Using tools from representation theory, Gaetz and Ryba…
We derive the algebraic generating function for inversion sequences avoiding the patterns $201$ and $210$ by describing a set of succession rules, converting them to a system of generating function equations with one catalytic variable, and…
We consider a class of stochastic kinetic equations, depending on two time scale separation parameters $\epsilon$ and $\delta$: the evolution equation contains singular terms with respect to $\epsilon$, and is driven by a fast ergodic…
We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…
In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…
Sequence pattern avoidance is a central topic in combinatorics. A sequence $s$ contains a sequence $u$ if some subsequence of $s$ can be changed into $u$ by a one-to-one renaming of its letters. If $s$ does not contain $u$, then $s$ avoids…
We consider the series of reciprocals of those positive integers with exactly $k$ occurrences of a given $b$-ary digit $d$ (Irwin series), and obtain geometrically convergent representations for their sums. They are expressed in terms of…
We present a new asymptotic formula for the Stieltjes constants which is both simpler and more accurate than several others published in the literature (see e.g. \cite{Fekih-Ahmed}, \cite{Knessl Coffey}, \cite{Paris}). More importantly, it…
We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…
Logarithmic Sobolev inequalities are a powerful way to estimate the rate of convergence of Markov chains and to derive concentration inequalities on distributions. We prove that the log-Sobolev constant of any isotropic logconcave density…