相关论文: Is there a Ramsey-Hindman theorem ?

We reconsider the generalization of standard quantum mechanics in which the position operators do not commute. We argue that the standard formalism found in the literature leads to theories that do not share the symmetries present in the…

We investigate Hindman- and Owings-type Ramsey-theoretic statements in Zermelo-Fraenkel set theory without the Axiom of Choice, with some occasional extra assumptions (such as the Axiom of Dependent Choice and/or the Axiom of Determinacy).…

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…

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

We study the Ramsey property for vector spaces over finite fields with bilinear forms. We prove that symplectic spaces over finite fields do not have the Ramsey property. We also describe vector spaces with skew symmetric bilinear forms and…

We prove a generalized version of the no-broadcasting theorem, applicable to essentially \emph{any} nonclassical finite-dimensional probabilistic model satisfying a no-signaling criterion, including ones with ``super-quantum'' correlations.…

The no-masking theorem for quantum information proves that it is impossible to encode an arbitrary input state into a larger bipartite entangled state such that the full information is stored in the correlation but the individual subsystems…

We prove some theorems on decomposable continua. In particular, we prove; (i) the property of being a Wilder continuum is not a Whitney reversible property, (ii) inverse limits of D**-continua with surjective monotone upper semi-continuous…

We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Ne\v{s}et\v{r}il-R\"odl Theorem, the Ramsey property of partial orders and metric spaces as well…

The Central Sets Theorem, a fundamental result in Ramsey theory, is a joint extension of both Hindman's theorem and van der Waerden's theorem. It was originally introduced by H. Furstenberg using methods from topological dynamics. Later,…

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…

One of the central questions in Ramsey theory asks how small can be the size of the largest clique and independent set in a graph on $N$ vertices. By the celebrated result of Erd\H{o}s from 1947, the random graph on $N$ vertices with edge…

$IP$ sets play fundamental role in arithmetic Ramsey theory. A set is called an additive $IP$ set if it is of the form $FS\left(\langle x_{n}\rangle_{n\in \mathbb{N}}\right)=\left\{ \sum_{t\in H}x_{t}:H\right.$ is a nonempty finite subset…

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…

We establish the Strong Poisson Hypothesis for symmetric closed networks. In particular, the asymptotic independence of the nodes -- as the size of the system tends to infinity -- is proved.

Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse…

In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…

We show that in contrast to the Rado graph, the Henson graphs are not computably indivisible.

In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…