Related papers: Classification Theory and the Construction of PAC …

In [1, arXiv:1102.1844] the author disputes the conclusion of our paper [2, arXiv:1006.0714]. He claims that the Feynman graphs of three dimensional group field theory always represent pseudo manifolds. However, [1] uses a different…

We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…

We prove, under some mild hypothesis, that an \'etale cover of curves defined over a number field has infinitely many specializations into an everywhere unramified extension of number fields. This constitutes an "absolute" version of the…

We develop a graphical calculus of manifold diagrams which generalises string and surface diagrams to arbitrary dimensions. Manifold diagrams are pasting diagrams for $(\infty, n)$-categories that admit a semi-strict composition operation…

We produce group structures on certain sets of topological vector bundles of fixed rank. In particular, we put a group structure on complex rank $2$ bundles on $\mathbb{C}P^3$ with fixed first Chern class. We show that this binary operation…

This survey is about Galois theory of curves in characteristic p, a topic which has inspired major research in algebraic geometry and number theory and which contains many open questions. We illustrate important phenomena which occur for…

This paper aims at developing model-theoretic tools to study interpretable fields and definably amenable groups, mainly in $\mathrm{NIP}$ or $\mathrm{NTP_2}$ settings. An abstract theorem constructing definable group homomorphisms from…

This paper studies Galois extensions over real quadratic number fields or cyclotomic number fields ramified only at one prime. In both cases, the ray class groups are computed, and they give restrictions on the finite groups that can occur…

In the enriched setting, the notions of injective and projective model structures on a category of enriched diagrams also make sense. In this paper, we prove the existence of these model structures on enriched diagram categories under local…

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…

In a coupled network cells can interact in several ways. There is a vast literature from the last twenty years that investigates this interacting dynamics under a graph theory formalism, namely as a graph endowed with an input-equivalence…

The paper has three main applications. The first one is this Hilbert-Grunwald statement. If $f:X\rightarrow \Pp^1$ is a degree $n$ $\Qq$-cover with monodromy group $S_n$ over $\bar\Qq$, and finitely many suitably big primes $p$ are given…

Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise…

In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…

We use Margulis' construction together with lattice counting arguments to build Cayley graphs on $\mathrm{SL}_{2}\left(\mathbb{F}_{p}\right),\;p\to\infty$ which are d-regular graphs with girth…

We show that for an arbitrary stable theory T, a group G is profinite if and only if G occurs as a Galois group of some Galois extension inside a monster model of T. We prove that any PAC substructure of the monster model of T has…

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

We give a new characterization of $SOP$ (the strict order property) in terms of the behaviour of formulas in any model of the theory as opposed to having to look at the behaviour of indiscernible sequences inside saturated ones. We refine a…

Graph neural networks (GNNs) have achieved remarkable success in processing graph-structured data across various applications. A critical aspect of real-world graphs is their dynamic nature, where new nodes are continually added and…

The one-inclusion graph algorithm of Haussler, Littlestone, and Warmuth achieves an optimal in-expectation risk bound in the standard PAC classification setup. In one of the first COLT open problems, Warmuth conjectured that this prediction…