Related papers: An infinite quantum Ramsey theorem

Recent work in hypergraph Ramsey theory has involved the introduction of a "lifting map" that associates a certain $3$-uniform hypergraph to a given graph, bounding cliques in a predictable way. In this paper, we interpret the lifting map…

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

We prove that for any homogeneous structure $\mathbf{K}$ in a language with finitely many relation symbols of arity at most two satisfying SDAP$^+$ (or LSDAP$^+$), there are spaces of subcopies of $\mathbf{K}$, forming subspaces of the…

We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…

The theorem on the existence of maximal nonnegative invariant subspaces for a special class of dissipative operators in Hilbert space with indefinite inner product is proved in the paper. It is shown in addition that the spectra of the…

We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…

A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type…

We develop a notion of rank one properly convex domains (or Hilbert geometries) in the real projective space. This is in the spirit of rank one non-positively curved Riemannian manifolds and CAT(0) spaces. We define rank one isometries for…

Inspired by Ramsey's theorem for pairs, Rival and Sands proved what we refer to as an inside/outside Ramsey theorem: every infinite graph $G$ contains an infinite subset $H$ such that every vertex of $G$ is adjacent to precisely none, one,…

An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey Theorem on uncountable cardinals asserting…

We introduce and study a variant of Ramsey numbers for edge-ordered graphs, that is, graphs with linearly ordered sets of edges. The edge-ordered Ramsey number $\overline{R}_e(\mathfrak{G})$ of an edge-ordered graph $\mathfrak{G}$ is the…

We show that any bounded operator $T$ on a separable, reflexive, infinite-dimensional Banach space $X$ admits a rank one perturbation which has an invariant subspace of infinite dimension and codimension. In the non-reflexive spaces, we…

We prove a recognition principle for motivic infinite P1-loop spaces over a perfect field. This is achieved by developing a theory of framed motivic spaces, which is a motivic analogue of the theory of E-infinity-spaces. A framed motivic…

Given a finite collection $\mathbf{V}:=(V_1,\dots,V_N)$ of closed linear subspaces of a real Hilbert space $H$, let $P_i$ denote the orthogonal projection operator onto $V_i$ and $P_{i,\lambda}:= (1-\lambda)I + \lambda P_i$ denote its…

We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or…

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

If $\P^\infty$ is the projective ind-space, i.e. $\P^\infty$ is the inductive limit of linear embeddings of complex projective spaces, the Barth-Van de Ven-Tyurin (BVT) Theorem claims that every finite rank vector bundle on $\P^\infty$ is…

The structural Ramsey theory is a field on the boundary of combinatorics and model theory with deep connections to topological dynamics. Most of the known Ramsey classes in finite binary symmetric relational language can be shown to be…

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…