Related papers: Selection principles and proofs from the Book
Starting with the Brezis-Browder principle, we give stronger versions of many variational principles and minimal element theorems which appeared in the recent literature. Relationships among the elements of different sets of assumptions are…
We present a comprehensive report on the relationships between variations of the Menger and Rothberger selection properties with respect to $\omega$-covers and $k$-covers in the most general topological setting and address the finite…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
Sidorenko's Conjecture says that the minimum density of a bigraph $G$ in a bigraphon $W$ of a given edge density is attained when $W$ is a constant function. A consequence of a result by B. Szegedy is that it is enough to show Sidorenko's…
Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…
May's Theorem (1952), a celebrated result in social choice, provides the foundation for majority rule. May's crucial assumption of symmetry, often thought of as a procedural equity requirement, is violated by many choice procedures that…
In this article, which is dedicated to my friend and colleague Boris Zilber on the occasion of his 75th birthday, I put forward a strategy for proving his quasiminimality conjecture for the complex exponential field. That is, for showing…
In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…
We give a unified treatment of the convergence of random series and the rate of convergence of strong law of large numbers in the framework of game-theoretic probability of Shafer and Vovk (2001). We consider games with the quadratic hedge…
We collect some of our favorite proofs of Brooks' Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, such as greedy coloring, Kempe chains, hitting sets, and the…
In this paper we consider the idea of I - convergence of nets of partial function from a metric space (X; d) to a metric space (Y; ?) and derive several basic characterization. This idea extends the concept of convergence of nets of partial…
A classical question about a metric space is whether Borel measures on the space are determined by their values on balls. We show that for any given measure this property is stable under Gromov-Wasserstein convergence of metric measure…
We establish a second-order almost sure limit theorem for the minimal position in a one-dimensional super-critical branching random walk, and also prove a martingale convergence theorem which answers a question of Biggins and Kyprianou [9].…
Michael's selection theorem implies that a closed convex nonempty-valued mapping from the Sorgenfrey line to a euclidean space is inner semicontinuous if and only if the mapping can be represented as the image closure of right-continuous…
Applying the Tubular Neighborhood Theorem, we give a short and new proof of the Pontryagin Maximum Principle on a smooth manifold. The idea is as follows. Given a control system on a manifold $M$, we embed it into an open subset of some…
Eagleson's Theorem asserts that, given a probability-preserving map, ifrenormalized Birkhoff sums of a function converge in distribution, thenthey also converge with respect to any probability measure which isabsolutely continuous with…
In a seminal 2005 paper, Haagerup and Thorbj{\o}rnsen discovered that the norm of any noncommutative polynomial of independent complex Gaussian random matrices converges to that of a limiting family of operators that arises from…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
The important Kemeny problem, which consists of computing median consensus rankings of an election with respect to the Kemeny voting rule, admits important applications in biology and computational social choice and was generalized recently…