Related papers: Hindman's Theorem is only a countable phenomenon

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

One can view quantum mechanics as a generalization of classical probability theory that provides for pairwise interference among alternatives. Adopting this perspective, we ``quantize'' the classical random walk by finding, subject to a…

A recent paper [M. H. Lee, Phys. Rev. Lett. 98, 190601 (2007)] has called attention to the fact that irreversibility is a broader concept than ergodicity, and that therefore the Khinchin theorem [A. I. Khinchin, Mathematical Foundations of…

We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…

We are able to rederive in a very simple way the standard generalized Wick's theorem for overlaps of mean field wave functions by using the extension of the statistical Wick's theorem (Gaudin's theorem) in the appropriate limits.

In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…

We address an idea of applying generalized entropies in counting problems. First, we consider some entropic properties that are essential for such purposes. Using the $\alpha$-entropies of Tsallis-Havrda-Charv\'{a}t type, we derive several…

A great number of articles widen a known scientific result $P(a)$ (such as: a theorem, an inequality, or a math/physics/chemical etc. proposition or formula) by a simple recurrence procedure and using, in the proof, the proposition $P(a)$…

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

In 1891 Cantor presented two proofs with the purpose to establish a general theorem that any set can be replaced by a set of greater power. Cantor's power set theorem can be considered to be an extension of Cantor's 1891 second proof and…

Several variants of the Halpern-L\"auchli Theorem for trees of uncountable height are investigated. For $\kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one…

We prove an analogue of the classical ballot theorem that holds for any random walk in the range of attraction of the normal distribution. Our result is best possible: we exhibit examples demonstrating that if any of our hypotheses are…

A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter ranges. The conjecture would provide a unified…

If kappa is any strongly unfoldable cardinal, then this is preserved in a forcing extension in which Diamond_kappa(REG) fails. This result continues the progression of the corresponding results for weakly compact cardinals, due to Woodin,…

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

Kingman's Theorem on skeleton limits---passing from limits as $n\to \infty $ along $nh$ ($n\in \mathbb{N}$) for enough $h>0$ to limits as $t\to \infty $ for $t\in \mathbb{R}$---is generalized to a Baire/measurable setting via a topological…

We show that there exists a bitsequence that is not computably random for which its odd bits are computably random and its even bits are computably random relative to the odd bits. This implies that the uniform variant of van Lambalgen's…

Hadamard's global inverse theorem provides conditions for a function to be globally invertible on Rn. In this note we show that the conditions are robust enough for the conclusion to hold even if we relax the conditions by removing the…

We observe that the so-called Generalised Equipartition Law for hamiltonian systems is actually valid only under specific hypotheses -- unfortunately omitted in some textbooks -- which limit its applicability when dealing with nonlinear…

A dual pair formulation for asymmetric locally convex spaces is developed that strictly generalises the ordinary vector space setting. The concept of a polar topology carries over to the asymmetric case and some familiar results are…