Related papers: Stieltjes moment sequences for pattern-avoiding pe…
A classical fact of the theory of almost periodic functions is the existence of their asymptotic distributions. In probabilistic terms, this means that if $f$ is a Besicovitch almost periodic function and $V$ is a random variable uniformly…
We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…
In the "stochastic $\delta N$ formalism", the statistics of the inflationary density perturbation are obtained from the first passage distribution of a stochastic process. We develop a general framework in which to evaluate the rare tail of…
We enumerate several classes of pattern-avoiding rectangulations. We establish new bijective links with pattern-avoiding permutations, prove that their generating functions are algebraic, and confirm several conjectures by Merino and…
The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths…
In this paper we introduce and investigate moment generating Stirling numbers of the first kind, "`MSN1"'. They are inverses of MSN2's, which make the representation of the moments for a lot of statistical distributions in closed formulas…
For a set of permutation patterns $\Pi$, let $F^\text{st}_n(\Pi,q)$ be the st-polynomial of permutations avoiding all patterns in $\Pi$. Suppose $312\in\Pi$. For a class of permutation statistics which includes inversion and descent…
(Work in progress) Marcus and Tardos \cite{MarcusTardos2004} proved the Stanley--Wilf conjecture by reducing pattern avoidance to an extremal problem on $0$--$1$ matrices. We give a parallel proof for classical permutation patterns that…
Let $\mathcal{H}$ be a complex Hilbert space and let $\big\{A_{n}\big\}_{n\geq 1}$ be a sequence of bounded linear operators on $\mathcal{H}$. Then a bounded operator $B$ on a Hilbert space $\mathcal{K} \supseteq \mathcal{H}$ is said to be…
This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…
An order-$s$ Davenport-Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function…
The truncated multidimensional moment problem is studied in terms of the Stieltjes transform as the interpolation problem. A step-by-step algorithm is constructed for the multidimensional moment problem and the set of solutions is found in…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
In [GM] Guibert and Mansour studied involutions on n letters avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary pattern on k letters. They also established a bijection between 132-avoiding…
This work explores new classes of nonstationary stochastic sequences associated with polynomial hypergroups. Their covariance structures are analyzed through positive definite kernels and corresponding Hilbert spaces. Novel consistent…
In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…
In this paper, we prove convergence for contractive time discretisation schemes for semi-linear stochastic evolution equations with irregular Lipschitz nonlinearities, initial values, and additive or multiplicative Gaussian noise on…
The present paper is an addendum to the paper ``L\'evy models amenable to efficient calculations", where we introduced a general class of Stieltjes-L\'evy processes (SL-processes) and signed SL processes defined in terms of certain…
We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations…
The sequence $A067549$ of The On-Line Encyclopedia of Integer Sequences is defined as $(a_k)_{k \geq 1}$ with $a_k$ being the determinant of the $k \times k$ matrix whose diagonal contains the first $k$ prime numbers and all other elements…