相关论文: Ramsey, for Auld Lang Syne
May randomness (real numbers, opinions) evolve into order (regularity) with time? We study some polarization and symmetry properties, which emerge in time evolution of opinions (real numbers) within entries of two and three-dimensional…
We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.
The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite…
Extending a result of K. Milliken \cite{Mi2}, in this paper we prove a Ramsey classification result for equivalence relations defined on uniform families of finite strong subtrees of a finite sequence $(U_i)_{i\in d}$ of fixed trees $U_i$,…
We derive a number of extremal and Ramsey stability results for cycles.
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \geq 2$, Ramsey's…
In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.
The notion of geometric version of an infinitely divisible law is introduced. Concepts parallel to attraction and partial attraction are developed and studied in the setup of geometric summing of random variables.
We give asymptotically optimal constructions in generalized Ramsey theory using results about conflict-free hypergraph matchings. For example, we present an edge-coloring of $K_{n,n}$ with $2n/3 + o(n)$ colors such that each $4$-cycle…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
The structural Ramsey theory is a field on the boundary of combinatorics and model theory with deep connections to topological dynamics. Most of the known Ramsey classes in finite binary symmetric relational language can be shown to be…
In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the…
In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, a correspondence between anti-Ramsey properties of partitions and chain conditions of the natural forcing notions that homogenize colorings over…
This is set of notes prepared for the Summer School on non-Abelian Hodge theory in Abbaye de Saint-Jacut de la Mer June, 6-19, 2022. We cover the following topics: Lecture 1. Harmonic Maps Between Riemannian Manifolds Lecture 2. Existence…
We continue the study (initiated in [1]) of Borel measures whose time evolution is provided by an interacting Hamiltonian structure. Here, the principal focus is the development and advancement of deficency in the measure caused by…
Much of the recent progress in String Theory can be traced to a precise strategy: a careful study of the few models known since the beginnings of the subject, and the abstraction from them of basic properties that one would like to demand…
Inspired by empirical work in neuroscience for Bayesian approaches to brain function, we give a unified probabilistic account of various types of symbolic reasoning from data. We characterise them in terms of formal logic using the…
We develop a Ramsey-like theorem for subsets of the two and three-dimensional simplex. A generalization of the combinatorial theorem presented here to all dimensions would produce a new proof that $\textrm{Homeo}_+[0,1]$ is extremely…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…