Related papers: A survey on big Ramsey structures
In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…
In 2012 M. Soki\'c proved that the class of all finite permutations has the Ramsey property. Using different strategies the same result was then reproved in 2013 by J. B\"ottcher and J. Foniok, in 2014 by M. Bodirsky and in 2015 yet another…
In recent years there has been much progress in graph theory on questions of the following type. What is the threshold for a certain large substructure to appear in a random graph? When does a random graph contain all structures from a…
The exterior degree of a finite group has been introduced in [P. Niroomand and R. Rezaei, On the exterior degree of finite groups, Comm. Algebra 39 (2011), 335--343] and the present paper is devoted to study the exterior degree of infinite…
Finite mixture models have been a very important tool for exploring complex data structures in many scientific areas, for example, economics, epidemiology, finance. In the past decade, semiparametric techniques have been popularly…
There have been several attempts in recent years to extend the notions of symplectic and Poisson structures in order to create a suitable geometrical framework for classical field theories, trying to achieve a success similar to the use of…
We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…
The field of structural engineering is vast, spanning areas from the design of new infrastructure to the assessment of existing infrastructure. From the onset, traditional entry-level university courses teach students to analyse structural…
This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…
A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every…
The recent investigation of the gauge structure of extended geometry is generalised to situations when ancillary transformations appear in the commutator of two generalised diffeomorphisms. The relevant underlying algebraic structure turns…
For a finite dimensional vector space equipped with a $\mathbb C$-algebra structure, one can define rational maps using the algebraic structure. In this paper, we describe the growth of the degree sequences for this type of rational maps.
Whereas for a substantial part, Finite Geometry during the past 50 years has focussed on geometries over finite fields, geometries over finite rings that are not division rings have got less attention. Nevertheless, several important…
Inspired by the network routing literature \cite{aggarwal1996efficient}, we develop what we call a ``Pre-Emptive Greedy Algorithm" to embed bounded degree induced trees in sparse expanders. This generalises a powerful and central result of…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
We prove a new characterization of the Ramsey property of categories in terms of a generalized form of K\H{o}nig's tree lemma. Afterwards, we discuss its applications to structural Ramsey theory. In particular, we provide a new proof of the…
Fine structure of giant resonances (GR) has been established in recent years as a global phenomenon across the nuclear chart and for different types of resonances. A quantitative description of the fine structure in terms of characteristic…
We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…