Related papers: Ramseyan ultrafilters
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…
We examine two mechanisms that have been put forward to explain the selection of quasipatterns in single and multi-frequency forced Faraday wave experiments. Both mechanisms can be used to generate stable quasipatterns in a parametrically…
We study cylindric partitions with two-element profiles using MacMahon's partition analysis. We find explicit formulas for the generating functions of the number of cylindric partitions by first finding the recurrences using partition…
We study problems concerning the Samuel compactification of the automorphism group of a countable first-order structure. A key motivating question is a problem of Furstenberg and a counter-conjecture by Pestov regarding the difference…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
Building on the results of Craig, van Ittersum, and Ono, we provide a refined understanding of MacMahon's partition functions and their variants, including their quasi-modular properties and new prime-detecting expressions.
We investigate the Tukey type of the generic ultrafilter added by the quotient $\mathcal{P}(\omega \times \omega) / (\mathrm{FIN} \times \mathrm{FIN})$. We prove that this ultrafilter is not basically generated and yet does not have the…
In this paper we provide explicit dual Ramsey statements for several classes of finite relational structures (such as finite linearly ordered graphs, finite linearly ordered metric spaces and finite posets with a linear extension) and…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…
Inspired by Andrews' 2-colored generalized Frobenius partitions, we consider certain weighted 7-colored partition functions and establish some interesting Ramanujan-type identities and congruences. Moreover, we provide combinatorial…
Recently, Andrews and Paule studied Schmidt type partitions using MacMahon's Partition Analysis and obtained various interesting results. In this paper, we focus on the combinatorics of Schmidt type partition theorems and characterize them…
We study filters in the partition lattice formed by restricting to partitions by type. The M\"obius function is determined in terms of the easier-to-compute descent set statistics on permutations and the M\"obius function of filters in the…
The problem of transformation selection is thoroughly treated from a Bayesian perspective. Several families of transformations are considered with a view to achieving normality: the Box-Cox, the Modulus, the Yeo & Johnson and the Dual…
Differential systems with a Fuchsian linear part are studied in regions including all the singularities in the complex plane of these equations. Such systems are not necessarily analytically equivalent to their linear part (they are not…
The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting.…