Related papers: Partition theorems from creatures and idempotent u…

In this series of papers we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in particular solve two problems from [CKS21]. It is…

Using tools from representation theory, we derive expressions for the coincidence rate of partially-distinguishable particles in an interferometry experiment. Our expressions are valid for either bosons or fermions, and for any number of…

We analyze the strength of the existence of idempotent ultrafilters in higher-order reverse mathematics. Let (Uidem) be the statement that an idempotent ultrafilter on the natural numbers exists. We show that over ACA_0^w, the higher-order…

We show that the Ramsey theory of block sequences in infinite-dimensional discrete vector spaces can be parametrized by perfect sets. As special cases, we prove combinatorial dichotomies for definable families of partitions and linear…

We investigate families of partitions of omega which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these…

Decompositional theories describe the ways in which a global physical system can be split into subsystems, facilitating the study of how different possible partitions of a same system interplay, e.g. in terms of inclusions or signalling. In…

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those…

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…

We calculate the partition function for "composite particles". For any finite number of states d, and in the following two cases: 1)all states have the same energy, 2)the energy is linearly distributed over the states, we transform the…

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…

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…

Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…

We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a…

We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.

We further develop the theory of layered semigroups, as introduced by Farah, Hindman and McLeod, providing a general framework to prove Ramsey statements about such a semigroup $S$. By nonstandard and topological arguments, we show Ramsey…

We introduce the notion of Ramsey partition regularity, a generalisation of partition regularity involving infinitary configurations. We provide characterisations of this notion in terms of certain ultrafilters related to tensor products…