Related papers: Dominic Welsh (1938-2023)
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
Percolation models describe the inside of a porous material. The theory emerged timidly in the middle of the twentieth century before becoming one of the major objects of interest in probability and mathematical physics. The golden age of…
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…
In probabilistic reasoning, the traditionally discrete domain has been elevated to the hybrid domain encompassing additionally continuous random variables. Inference in the hybrid domain, however, usually necessitates to condone trade-offs…
Given a m-dimensional Gaussian process and polynomial m variables with real coefficients, we calculate the induced path odered exponenial in two different ways: one is purely algebraic in spirit and the other one is diagrammatic in spirit…
Some of Philippe Flajolet's combinatorial contributions that he wrote between 1976 and 1995, say, are described. In most of Flajolet's papers, asymptotic/analytic considerations play a major role. To be true to the spirit of the journal…
New formulas for the nth moment of the Askey-Wilson polynomials are given. These are derived using analytic techniques, and by considering three combinatorial models for the moments: Motzkin paths, matchings, and staircase tableaux. A…
We contribute to the knowledge of linear codes from special polynomials and functions, which have been studied intensively in the past few years. Such codes have several applications in secret sharing, authentication codes, association…
The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…
In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework,…
In this paper, we survey physically related applications of a class of weighted quasi-Monte Carlo methods from a theoretical, deterministic perspective, and establish quantitative universal rapid convergence results via various regularity…
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…
We prove mean convergence, as $N\to\infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f_1(T_1^{p_1(n)}x)... f_\ell(T_\ell^{p_\ell(n)}x)$, where $p_1,...,p_\ell$ are integer polynomials with distinct degrees, and…
In 1985, Odoni showed that in characteristic $0$ the Galois group of the $n$-th iterate of the generic polynomial with degree $d$ is as large as possible. That is, he showed that this Galois group is the $n$-th wreath power of the symmetric…
Dynamic Linear Models (DLMs) are commonly employed for time series analysis due to their versatile structure, simple recursive updating, ability to handle missing data, and probabilistic forecasting. However, the options for count time…
In 1935 J.G. van der Corput introduced a sequence which has excellent uniform distribution properties modulo 1. This sequence is based on a very simple digital construction scheme with respect to the binary digit expansion. Nowadays the van…
The work analyzes the theory of Dunkl operator as a moment differential operator. This last operator generalizes the first one whenever the sequence of moments satisfies appropriate classical properties, classically considered in the…
This work applies the ideas of Alekseev and Meinrenken's Non-commutative Chern-Weil Theory to describe a completely combinatorial and constructive proof of the Wheeling Theorem. In this theory, the crux of the proof is, essentially, the…
The celebrated Birkhoff Ergodic Theorem asserts that, for an ergodic map, orbits of almost every point equidistributes when sampled at integer times. This result was generalized by Bourgain to many natural sparse subsets of the integers. On…
The unitary Wilson random matrix theory is an interpolation between the chiral Gaussian unitary ensemble and the Gaussian unitary ensemble. This new way of interpolation is also reflected in the orthogonal polynomials corresponding to such…