Related papers: A survey on big Ramsey structures
In 2003, Kechris, Pestov and Todorcevic showed that the structure of certain separable metric spaces - called ultrahomogeneous - is closely related to the combinatorial behavior of the class of their finite metric spaces. The purpose of the…
In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the…
Oscillation stability is an important concept in Banach space theory which happens to be closely connected to discrete Ramsey theory. For example, Gowers proved oscillation stability for the Banach space $c_0$ using his now famous Ramsey…
The metric Ramsey problem asks for the largest subset $S$ of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version…
We introduce geometric consideration into the theory of formal languages. We aim to shed light on our understanding of global patterns that occur on infinite strings. We utilise methods of geometric group theory. Our emphasis is on large…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
In this paper the notion of Dirac structure in finite dimension is extended to the convenient setting. In particular, we introduce the notion of partial Dirac structure on convenient Lie algebroids and manifolds. We then look for those…
We study in this paper some connections between the Fraisse theory of amalgamation classes and ultrahomogeneous structures, Ramsey theory, and topological dynamics of automorphism groups of countable structures.
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
We prove additive and multiplicative partition theorems, obtaining combinatorial results for p-quasicyclic groups, where p is a prime number. We also get density results for p-quasicyclic groups via left F{\o}lner sequences of non-empty…
Gaussian graphical models provide a powerful framework to reveal the conditional dependency structure between multivariate variables. The process of uncovering the conditional dependency network is known as structure learning. Bayesian…
Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…
We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
The celebrated theorem of Kechris, Pestov and Todor\v{c}evi\'c connecting structural Ramsey theory with topological dynamics has as a consequence that the Fra\"{\i}ss\'e limit of a Ramsey class of non-trivial finite relational structures…
A network is a typical expressive form of representing complex systems in terms of vertices and links, in which the pattern of interactions amongst components of the network is intricate. The network can be static that does not change over…
We provide a characterisation of differentially large fields in arbitrary characteristic and a single derivation in the spirit of Blum axioms for differentially closed fields. In the case of characteristic zero, we use these axioms to…
A first-order structure $M$ is said to have the infinite sunflower property if, for each $k \in \mathbb{N}_+$ and each structure $M' \cong M$ whose elements are $k$-sets, there is $S \subseteq M'$, $S \cong M$, such that $S$ is a sunflower:…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…