Related papers: Ramsey-like theorems for separable permutations

We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set $A$ of natural numbers is $n$--cohesive (respectively, $n$--r--cohesive) if $A$ is almost…

In a previous paper, the author introduced the idea of intrinsic density --- a restriction of asymptotic density to sets whose density is invariant under computable permutation. We prove that sets with well-defined intrinsic density (and…

This article highlights historical achievements in the partition theory of countable homogeneous relational structures, and presents recent work, current trends, and open problems. Exciting recent developments include new methods involving…

We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…

We find necessary and sufficient conditions for the finite separability of finitely generated commutative rings. Namely, we prove that every such ring is a finite extension of its torsion ideal $I_k$ where $k$ is square-free, and $I_k$ is a…

The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

We consider the Arveson-Douglas conjecture on the essential normality of homogeneous submodules corresponding to algebraic subvarieties of the unit ball. We prove that the property of essential normality is preserved by isomorphisms between…

Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…

Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…

Ramsey's theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In this paper, we study a strengthening of Ramsey's theorem for pairs due to Erdos and Rado, which states that every…

The thin set theorem for $n$-tuples and $k$ colors ($\mathsf{TS}^n_k$) states that every $k$-coloring of $[\mathbb{N}]^n$ admits an infinite set of integers $H$ such that $[H]^n$ avoids at least one color. In this paper, we study the…

While finite-variable fragments of the propositional modal logic S5--complete with respect to reflexive, symmetric and transitive frames--are polynomial-time decidable, the restriction to finite-variable formulas for logics of reflexive and…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

Confidence sequences, anytime p-values (called p-processes in this paper), and e-processes all enable sequential inference for composite and nonparametric classes of distributions at arbitrary stopping times. Examining the literature, one…

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 determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function…

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…