相关论文: Reverse mathematics of a uniform Kruskal-Friedman …

This paper describes a new link between combinatorial number theory and geometry. The main result states that A is a finite set of relatively prime positive integers if and only if A = (K-K) \cap N, where K is a compact set of real numbers…

We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

The Grassmann convexity conjecture gives a conjectural formula for the maximal total number of real zeros of the consecutive Wronskians of an arbitrary fundamental solution to a disconjugate linear ordinary differential equation with real…

We prove a general form of the regularity theorem for uniformity norms, and deduce an inverse theorem for these norms which holds for a class of compact nilspaces including all compact abelian groups, and also nilmanifolds; in particular we…

Given a sequence of subsets A_n of {0,...,n-1}, the Furstenberg correspondence principle provides a shift-invariant measure on Cantor space that encodes combinatorial information about infinitely many of the A_n's. Here it is shown that…

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

Let $\Gamma$ be a countable abelian group, let $k\geq 1$, and let $\mathrm{X}=(X,\mathcal{X},\mu,T)$ be an ergodic $\Gamma$-system of order $k$ in the sense of Host--Kra--Ziegler. The $\Gamma$-system $\mathrm{X}$ is said to be totally…

In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [arXiv:0704.2560], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and…

If $X$ is a finite tree and $f \colon X \longrightarrow X$ is a map, as the Main Theorem of this paper we find eight conditions, each of which is equivalent to the fact that $f$ is equicontinuous. To name just a few of the results obtained:…

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

When the Canonical Ramsey's Theorem by Erd\H{o}s and Rado is applied to regressive functions one obtains the Regressive Ramsey's Theorem by Kanamori and McAloon. Taylor proved a "canonical" version of Hindman's Theorem, analogous to the…

A quasiconformal tree is a doubling (compact) metric tree in which the diameter of each arc is comparable to the distance of its endpoints. We show that for each integer $n\geq 2$, the class of all quasiconformal trees with uniform branch…

Let $\Gamma =(V,E)$ be a reflexive relation having a transitive group of automorphisms and let $v\in V.$ Let $F$ be a subset of $V$ with $F\cap \Gamma ^-(v)=\{v\}$. (i) If $F$ is finite, then $| \Gamma (F)\setminus F|\ge |\Gamma (v)|-1.$…

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

A half-tree is an edge configuration whose superimposition with a perfect matching is a tree. In this paper, we prove a half-tree theorem for the Pfaffian principal minors of a skew-symmetric matrix whose column sum is zero; introducing an…

We prove that the Krull-Remak-Schmidt-Azumaya unique decomposition theorem holds in idempotent complete additive categories with enough compact objects. In particular, this result applies to compactly generated triangulated categories. In…

We study new relations of the following statements with weak choice principles in ZF and ZFA. 1. There does not exist an infinite Hausdorff space X such that every infinite subset of X contains an infinite compact subset. 2. If a field has…

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…