arXiv subjects

David Bradley-Williams

Publications and source records attributed to David Bradley-Williams.

8 recordsLinked to original sources

arXiv2025

Ramsey expansions of metrically homogeneous graphs

We investigate Ramsey expansions, the coherent extension property for partial isometries (EPPA), and the existence of a stationary independence relation for all classes of metrically homogeneous graphs from Cherlin's catalogue. We show that, with the exception of tree-like graphs, all metric spaces in the catalogue have precompact Ramsey expansions (or lifts) with the expansion property. With two exceptions we can also characterise the existence of a stationary independence relation and coherent EPPA. Our results are a contribution to Nešetřil's classification programme of Ramsey classes and can be seen as empirical evidence of the recent convergence in techniques employed to establish the Ramsey property, the expansion property, EPPA and the existence of a stationary independence relation. At the heart of our proof is a canonical way of completing edge-labelled graphs to metric spaces in Cherlin's classes. The existence of such a ``completion algorithm'' then allows us to apply several strong results in the areas that imply EPPA or the Ramsey property. The main results have numerous consequences for the automorphism groups of the Fraisse limits of the classes. As corollaries, we prove amenability, unique ergodicity, existence of universal minimal flows, ample generics, small index property, 21-Bergman property and Serre's property (FA).

math.CO↗

arXiv2024

EPPA numbers of graphs

If $G$ is a graph, $A$ and $B$ its induced subgraphs, and $f\colon A\to B$ an isomorphism, we say that $f$ is a \emph{partial automorphism} of $G$. In 1992, Hrushovski proved that graphs have the \emph{extension property for partial automorphisms} (\emph{EPPA}, also called the \emph{Hrushovski property}), that is, for every finite graph $G$ there is a finite graph $H$, an \emph{EPPA-witness} for $G$, such that $G$ is an induced subgraph of $H$ and every partial automorphism of $G$ extends to an automorphism of $H$. The EPPA number of a graph $G$, denoted by $\mathop{\mathrm{eppa}}\nolimits(G)$, is the smallest number of vertices of an EPPA-witness for $G$, and we put $\mathop{\mathrm{eppa}}\nolimits(n) = \max\{\mathop{\mathrm{eppa}}\nolimits(G) : \lvert G\rvert = n\}$. In this note we review the state of the area, prove several lower bounds (in particular, we show that $\mathop{\mathrm{eppa}}\nolimits(n)\geq \frac{2^n}{\sqrt{n}}$, thereby identifying the correct base of the exponential) and pose many open questions. We also briefly discuss EPPA numbers of hypergraphs, directed graphs, and $K_k$-free graphs.

math.CO↗

arXiv2024

A Characterization of Quasi-homogeneous Bivariate Polynomials

If a reduced bivariate polynomial is quasi-homogeneous, then its discriminant is a monomial. Over fields of characteristic $0$, we show that if one adds another simple condition, this becomes an equivalence. We also give a third equivalent condition that is stated geometrically.

math.AC↗

arXiv2024

Riso-stratifications and a tree invariant

We introduce a new notion of stratification (``riso-stratification''), which is canonical and which exists in a variety of settings, including different topological fields like $\mathbb{C}$, $\mathbb{R}$ and $\mathbb{Q}_p$, and also including different o-minimal structures on $\mathbb{R}$. Riso-stratifications are defined directly in terms of a suitable notion of triviality along strata; the key difficulty and main result is that the strata defined in this way are ``algebraic in nature'', i.e., definable in the corresponding first-order language. As an example application, we show that local motivic Poincaré series are, in some sense, trivial along the strata of the riso-stratification. Behind the notion of riso-stratification lies a new invariant of singularities, which we call the ``riso-tree'', and which captures, in a canonical way, information that was contained in the non-canonical strata of a Lipschitz stratification. On our way to the Poincaré series application, we show, among others, that our notions interact well with motivic integration.

math.AG↗

arXiv2022

On limits of betweenness relations

We give a flexible method for constructing a wide variety of limits of betweenness relations. This unifies work of Adeleke, who constructed a Jordan group preserving a limit of betweenness relations, and Bhattacharjee and Macpherson who gave an alternative method using a Frassé-type construction. A key ingredient in their work is the notion of a tree of B-sets. We employ this, and extend its use to a wider class of examples.

math.GR↗

arXiv2022

Spherically complete models of Hensel minimal valued fields

We prove that Hensel minimal expansions of finitely ramified Henselian valued fields admit spherically complete immediate elementary extensions. More precisely, the version of Hensel minimality we use is $0$-hmix-minimality (which, in equi-characteristic $0$, amounts to $0$-h-minimality).

math.LO↗

arXiv2019

Completing graphs to metric spaces

We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.

math.CO↗

arXiv2016

The universal homogeneous binary tree

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which we denote by S2. We study the reducts of S2, that is, the relational structures with the same domain as S2 all of whose relations are first-order definable in S2. Our main result is a classification of the model-complete cores of the reducts of S2. From this, we also obtain a classification of reducts up to first-order interdefinability, which is equivalent to a classification of all closed permutation groups that contain the automorphism group of S2.

math.LO↗