Related papers: A direct proof of Tychonoff's theorem

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

The main result of this paper is a formula for the limit cycle of a 1-parameter family of subvarieties of a tropical compactification, expressed in terms of tropical intersections. Our theorem generalizes results of…

Torelli's theorem is proven by the study of the convolution product of the intersection cohomology sheaf of the thetadivisor.

We present a much simplified proof of Dehn's theorem on the infinitesimal rigidity of convex polytopes. Our approach is based on the ideas of Trushkina and Schramm.

We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…

We prove a compact embedding theorem in a class of spaces of piecewise H1 functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

This article presents a clear proof of the Riemann Mapping Theorem via Riemann's method, uncompromised by any appeals to topological intuition.

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.

Given a convergence theorem in analysis, under very general conditions a model-theoretic compactness argument implies that there is a uniform bound on the rate of metastability. We illustrate with three examples from ergodic theory.

We prove Union-Closed sets conjecture.

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…

We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…

For a complete noncompact connected Riemannian manifold with bounded geometry, we prove a compactness result for sequences of finite perimeter sets with uniformly bounded volume and perimeter in a larger space obtained by adding limit…

For any Tychonoff space $X$ let $D(X)$ be either the set $C(X)$ of all continuous functions on $X$ or the set $C^*(X)$ of all bounded continuous functions on $X$. When $D(X)$ is endowed with the point convergence topology, we write…

We give a simple proof of the exponential de Finetti theorem due to Renner. Like Renner's proof, ours combines the post-selection de Finetti theorem, the Gentle Measurement lemma, and the Chernoff bound, but avoids virtually all…