Related papers: Dominic Welsh (1938-2023)
This papers studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs). It presents a new framework using discrete ODEs as a central tool for computation and provides several implicit characterizations…
This monograph is a comprehensive study of the combinatorial structure of various operads of wiring diagrams and undirected wiring diagrams. Our first main objective is to prove a finite presentation theorem for each operad of wiring…
We consider a wide class of ergodic first passage percolation processes on Z^2 and prove that there exist at least four one-sided geodesics a.s. We also show that coexistence is possible with positive probability in a four color…
We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of…
Perhaps the most significant, if not the most important, achievements in chemistry and physics are the Periodic Table of the Elements in Chemistry and the Standard Model of Elementary Particles in Physics. A comparable achievement in…
We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…
Differential lambda-calculus was first introduced by Thomas Ehrhard and Laurent Regnier in 2003. Despite more than 15 years of history, little work has been done on a differential calculus with integration. In this paper, we shall propose a…
We consider $\ell$-adic trace functions over finite fields taking values in cyclotomic integers, such as characters and exponential sums. Through ideas of Deligne and Katz, we explore probabilistic properties of the reductions modulo a…
The "peak reduction" method is a powerful combinatorial technique with applications in many different areas of mathematics as well as theoretical computer science. It was introduced by Whitehead, a famous topologist and group theorist, who…
This article presents a very gentle introduction to the field of aperiodic order, aimed at a general audience. It is intended to provide a "Snapshot of Modern Mathematics" relating to the Oberwolfach mini-workshop "Dynamical versus…
This article, dedicated to Herbert Saul Wilf on the occaison of his forthcoming 80-th birthday, describes two complementary approaches to enumeration, the "positive" and the "negative", each with its advantages and disadvantages. Both…
The central question of knot theory is that of distinguishing links up to isotopy. The first polynomial invariant of links devised to help answer this question was the Alexander polynomial (1928). Almost a century after its introduction, it…
In the last ten years, the employment of symbolic methods has substantially extended both the theory and the applications of statistics and probability. This survey reviews the development of a symbolic technique arising from classical…
There are three aims of this note. The first one is to report some advances around the dynamical Mordell-Lang (=DML) conjecture. Second, we generalize some known results. For example, the Dynamical Mordell-lang conjecture was known for…
We study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like G\"odel's $\mathbb{T}$ with various forms of probabilistic choice…
The theory of equidistribution is about hundred years old, and has been developed primarily by number theorists and theoretical computer scientists. A motivated uninitiated peer could encounter difficulties perusing the literature, due to…
Collatz Conjecture is one of the most famous, for its simple form, proposed more than eighty years ago. This paper presents a full attempt to prove the affirmative answer to the question proposed by the conjecture. In the first section, we…
One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.
First-passage times are often the most relevant aspect of a complex Markovian network, because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks…
Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we…