Related papers: Big Ramsey degrees in universal inverse limit stru…
The paper has two purposes. First, we start to develop a theory of infinite global fields, i.e., of infinite algebraic extensions either of ${\mathbb{Q}}$ or of ${\mathbb{F}}_r(t)$. We produce a series of invariants of such fields, and we…
We prove a first inverse theorem for Gowers norms on all finite abelian groups that uses only nilmanifolds (rather than possibly more general nilspaces). This makes progress toward confirming the Jamneshan--Tao conjecture. The correlating…
Showing that the Ramsey property holds for a class of finite structures can be an extremely challenging task and a slew of sophisticated methods have been proposed in literature. In this paper we propose a new strategy to show that a class…
In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
We present a new unified theory of critical finite-size scaling for lattice statistical mechanical models with periodic boundary conditions above the upper critical dimension. Our theory is based on recent mathematically rigorous results…
We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…
In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as non-colourability of auxiliary hypergraphs. Our main technical result gives…
We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the class $\mathrm{TM}_{r, p}(d)$ of $p$-labeled arbitrary graphs whose underlying unlabeled graphs have tree models of height $d$ and $r$…
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…
An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring of the edges of a complete graph there exist large highly…
We study the obstructions to coarse universality in separable dual Banach spaces. We prove coarse non-universality of several classes of dual spaces, including those with conditional spreading bases, as well as generalized James and James…
We give upper and lower bounds for the Hausdorff dimensions for a class of graph-directed measures when its underlying directed graph is the infinite N-ary tree. These measures are different from graph-directed self-similar measures driven…
We prove that, for all $k \ge 3,$ and any integers $\Delta, n$ with $n \ge \Delta,$ there exists a $k$-uniform hypergraph on $n$ vertices with maximum degree at most $\Delta$ whose $4$-color Ramsey number is at least $\mathrm{tw}_k(c_k…
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…
We prove a sampling theorem for infinite-dimensional Paley-Wiener spaces on graphs which allows for stable frame reconstruction. We prove that all sampling sets for a fixed Paley-Wiener space are complements of lambda-sets (i.e. sets where…
The Ramsey numbers $R(T_n,W_8)$ are determined for each tree graph $T_n$ of order $n\geq 7$ and maximum degree $\Delta(T_n)$ equal to either $n-4$ or $n-5$. These numbers indicate strong support for the conjecture, due to Chen, Zhang and…
Chv\'atal showed that for any tree $T$ with $k$ edges the Ramsey number $R(T,n)=k(n-1)+1$ ("Tree-complete graph Ramsey numbers." Journal of Graph Theory 1.1 (1977): 93-93). For $r=3$ or $4$, we show that, if $T$ is an $r$-uniform…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
A problem of Banach asks whether every infinite-dimensional Banach space which is isomorphic to all its infinite-dimensional subspaces must be isomorphic to a separable Hilbert space. In this paper we prove a result of a Ramsey-theoretic…