Related papers: Dominic Welsh (1938-2023)
We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…
When modeling real world domains we have to deal with information that is incomplete or that comes from sources with different trust levels. This motivates the need for managing uncertainty in the Semantic Web. To this purpose, we…
Systems whose time evolutions are entirely deterministic can nevertheless be studied probabilistically, i.e. in terms of the evolution of probability distributions rather than individual trajectories. This approach is central to the…
A result for subadditive ergodic cocycles is proved that provides more delicate information than Kingman's subadditive ergodic theorem. As an application we deduce a multiplicative ergodic theorem generalizing an earlier result of…
Dunkl theory is a far reaching generalization of Fourier analysis and special function theory related to root systems. During the sixties and seventies, it became gradually clear that radial Fourier analysis on rank one symmetric spaces was…
In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson's conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson's conjecture to the higher order integral polynomial case. However, they did not…
This biographical account of the life and work of David Kendall includes details of his personal and professional activities. Kendall is probably best known for his work in applied probability, especially queueing theory, and in stochastic…
We generalize Coincidence theorem due to Walsh for symmetric and linear polynomial in n complex variables, that is linear in each of them having total degre n. We discuss case when total degree is smaller then n. This case has been already…
In a variety of applications, the problem comes up of describing the principal part of the inverse of a holomorphic operator at an eigenvalue in terms of left and right root functions associated to the eigenvalue. Such a description was…
Translation of Ludwig Boltzmann's paper "\"Uber die Eigenschaften monozyklischer und anderer damit verwandter Systeme" Crelles Journal 98. S. 68-94. 1884 u. 1885 from German into English. In this foundational paper Boltzmann introduced two…
Prosopography is usually used to globally describe a large population of ordinary subjects. It is thus opposed to biography, as a genre devoted to exceptional individuals. I show in this article how to use prosopography to study a single…
This is an exposition of the contributions of L\'aszl\'o Lov\'asz to mathematics and computer science written on the occasion of the bestowal of the Abel Prize~2021 to him. Our survey, of course, cannot be exhaustive. We sketch remarkable…
We explain how the moments of the (weight function of the) Askey Wilson polynomials are related to the enumeration of the staircase tableaux introduced by the first and fourth authors. This gives us a direct combinatorial formula for these…
In this pedagogical text aimed at those wanting to start thinking about or brush up on probabilistic inference, I review the rules by which probability distribution functions can (and cannot) be combined. I connect these rules to the…
According to Paul Erd\H{o}s [Some notes on Tur\'an's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Tur\'an who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erd\H{o}s…
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…
Some of the most common mathematical models in biology, chemistry, physics, and engineering, are polynomial dynamical systems, i.e., systems of differential equations with polynomial right-hand sides. Inspired by notions and results that…
Large deviations in the context of first-passage percolation was first studied in the early 1980s by Grimmett and Kesten, and has since been revisited in a variety of studies. However, none of these studies provides a precise relation…
We revisit the concepts of acyclic orderings and number of acyclic orderings of acyclic digraphs in terms of dispositions and counters for arbitrary multidigraphs. We prove that when we add a sequence of nested directed paths to a directed…
Most of Markov Chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) algorithms in existing probabilistic programming systems suboptimally use only model priors as proposal distributions. In this work, we describe an approach for…