Related papers: The externally definable Ramsey property and fixed…
In this paper, we address problems related to parameters concerning edge mappings of graphs. Inspired by Ramsey's Theorem, the quantity $m(G, H)$ is defined to be the minimum number $n$ such that for every $f: E(K_n) \rightarrow E(K_n)$…
We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general $r$-uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one…
There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…
We discuss the dynamics of $n$-expansive homeomorphisms with the shadowing property defined on compact metric spaces. For every $n\in\mathbb{N}$, we exhibit an $n$-expansive homeomorphism, which is not $(n-1)$-expansive, has the shadowing…
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five countably infinite Ramsey classes of permutations.
We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…
Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…
Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.
Topological Ramsey theory studies a class of combinatorial topological spaces, known as topological Ramsey spaces, unifying the essential features of those combinatorial frames where the Ramsey property is equivalent to the Baire property.…
Showing that the Ramsey property holds for a class of finite structures can be an extremely challenging task and a slew of sophisticated methods have been proposed in literature. In this paper we propose a new strategy to show that a class…
Researchers develop models to explain the unknowns. These models typically involve parameters that capture tangible quantities, the estimation of which is desired. Parameter identifiability investigates the recoverability of the unknown…
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:…
Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…
In recent years, there has been much progress in the field of structural Ramsey theory, in particular in the study of big Ramsey degrees. In all known examples of infinite structures with finite big Ramsey degrees, there is in fact a single…
In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…
By a result of Zucker, every Fra\"iss\'e structure $\bf F$ for which the elements of $\mathrm{Age}(\bf F)$ have finite Ramsey degrees admits a Fra\"iss\'e precompact expansion $\bf F^{*}$ whose age $\mathrm{Age}(\bf F^{*})$ has the Ramsey…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
A celebrated result by M. Davis, H. Putnam, J. Robinson, and Y. Matiyasevich shows that a set of integers is listable if and only if it is positive existentially definable in the language of arithmetic. We investigate analogues of this…
We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…