相关论文: Block Combinatorics
The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence…
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…
A system of uniform families on an infinite subset $M$ of $\nn$ is a collection $(\cca_{\xi})_{\xi<\omega_1}$ of families of finite subsets of $\nn$ (where, $\cca_k$ consists of all $k$--element subset of $M$, for $k\in \nn$) with the…
We develop local forms of Ramsey-theoretic dichotomies for block sequences in infinite-dimensional vector spaces, analogous to Mathias' selective coideal form of Silver's theorem for analytic partitions of $[\mathbb{N}]^\infty$. Under large…
A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical…
Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed…
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…
Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…
A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense…
Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…
Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…
We study the topological version of the partition calculus in the setting of countable ordinals. Let $\alpha$ and $\beta$ be ordinals and let $k$ be a positive integer. We write $\beta\to_{top}(\alpha,k)^2$ to mean that, for every red-blue…
Andrews and El Bachraoui recently studied integer partitions where the smallest part is repeated a specified number of times and any other parts are distinct. Their results included two ``surprising identities'' for which they requested…
We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many ``building blocks'', independent of the number of…
In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…
Let $\mathcal{G}$ be a countably infinite group of unitary operators on a complex separable Hilbert space $H$. Let $X = \{x_{1},...,x_{r}\}$ and $Y = \{y_{1},...,y_{s}\}$ be finite subsets of $H$, $r < s$, $V_{0} = \bar{span}…
We prove a generalization of the infinite quantum Ramsey theorem of Kennedy et al. (arXiv:1711.09526), showing that it follows from an archetypical "selective" pattern satisfied by certain families of projections in an infinite-dimensional…
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$,…