Related papers: Partition theorems from creatures and idempotent u…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.…
The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
This article surveys results regarding the Tukey theory of ultrafilters on countable base sets. The driving forces for this investigation are Isbell's Problem and the question of how closely related the Rudin-Keisler and Tukey…
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.
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We study the obstructions to coarse universality in separable dual Banach spaces. We prove coarse non-universality of several classes of dual spaces, including those with conditional spreading bases, as well as generalized James and James…
We study ultrafilters from the perspective of the algebra in the \v{C}ech-Stone compactification of the natural numbers, and idempotent elements therein. The first two results that we prove establish that, if $p$ is a Q-point (resp. a…
Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…
We illustrate the main features of a recently proposed method based on ensemble density functional theory to divide rigorously a complex molecular system into its parts [M.H. Cohen and A. Wasserman, J. Phys. Chem. A 111, 2229 (2007)]. The…
In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as…
Motivated by Tukey classification problems and building on work in \cite{Dobrinen/Todorcevic11}, we develop a new hierarchy of topological Ramsey spaces $\mathcal{R}_{\alpha}$, $\alpha<\omega_1$. These spaces form a natural hierarchy of…