Related papers: Dominic Welsh (1938-2023)
We review the work of Dominic Welsh (1938-2023), tracing his remarkable influence through his theorems, expository writing, students, and interactions. He was particularly adept at bringing different fields together and fostering the…
In writing this biographical memoir of John Hammersley, we have tried to communicate something of the character of the person, and of the impact of his scientific achievements across lattice models (for example, percolation, self-avoiding…
Biography and publications list for Donald Arthur Preece, who died on 6 January 2014, who made many contributions in statistics (experimental design) and in combinatorics.
In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…
A fundamental theorem of matroid theory establishes that a transversal matroid is representable over fields of any characteristic. It was proved in 1970 by Piff and Welsh: their proof is elegant and concise and, moveover, constructive.…
This is about the mathematics and life of Donald Gordon Higman, 1928-2006. He did important work in representation theory of groups and algebras and in algebraic combinatorics. Charles C. Sims and Donald Higman discovered and constructed…
Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. One of the main reasons for this growth is the tight…
A variation of Dyck paths allows for down-steps of arbitrary length, not just one. Credits for this invention are given to Emeric Deutsch. Surprisingly, the enumeration of them is somewhat akin to the analysis of Motzkin-paths; the last…
We discuss the significance of some interesting results by Barbara Rokowska about combinatorial constructions. Her interest in finite mathematics and number theory began with an embellishment and detailing of some work by Erdos. Rokowska…
Efficient handling of sparse data is a key challenge in Computer Science. Binary convolutions, such as polynomial multiplication or the Walsh Transform are a useful tool in many applications and are efficiently solved. In the last decade,…
We study a random perturbation of the Euclidean plane, and show that it is unlikely that the distance-minimizing path between the two points can be extended into an infinite distance-minimizing path. More precisely, we study a large class…
One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…
We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a theorem of Erd\H{o}s-Delange, the mean…
Charles Peirce develops a scheme for classifying different kinds of monadic, dyadic and triadic relations. His account of these different classes of relations figures prominently in the development of his algebraic and diagrammatic systems…
I attempted to write the full translation of this article to make the remarkable proof of Pierre Deligne available to a greater number of people. Overviews of the proofs can be found elsewhere. I especially recommend the notes of James…
The Poisson clumping heuristic has lead Aldous to conjecture the value of the first passage percolation on the hypercube in the limit of large dimensions. Aldous' conjecture has been rigorously confirmed by Fill and Pemantle [Annals of…
This is the second of a series of papers surveying some small part of the remarkable work of our friend and colleague Nigel Kalton. We have written it as part of a tribute to his memory. It does not contain new results. One of the many…
G\'{e}rard Watts predicted a formula for the probability in percolation that there is both a left--right and an up--down crossing, which was later proved by Julien Dub\'{e}dat. Here we present a simpler proof due to Oded Schramm, which…
Patrick Moss (1947--2024) had two distinct lives as a mathematician. The first was as a ring theorist in the late 1970s, in which he worked with Ginn and Lenagan as a student. After a long career as an inspirational mathematics teacher,…
Walsh has recently proved the norm convergence of all nonconventional ergodic averages involving polynomial sequences in discrete nilpotent acting groups. He deduces this convergence from an equivalent, `finitary' assertion of stability…