Related papers: Update: Remarks on Countable Tightness
We prove some extensions of Andrews inequality.
This paper gives another proof of the key lemma in my recent paper which solves the optimal paper Moebius band conjecture of Halpern and Weaver, namely Lemma T. The proof here is longer but it offers more geometric intuition about what is…
Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable.…
Adapting a homotopy reconstruction theorem for general metric compacta, we show that every countable metric or ultrametric compact space can be topologically reconstructed as the inverse limit of a sequence of finite $T_0$ spaces which are…
In this article, we prove some fixed point theorems in metric type spaces. This article is just a generalization some results previously proved in \cite{niyi-gaba}. In particular, we give some coupled common fixed points theorems under weak…
The regularity of limit spaces of Riemannian manifolds with L^p curvature bounds, $p > n/2$, is investigated under no apriori non-collapsing assumption. A regular subset, defined by a local volume growth condition for a limit measure, is…
In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…
We translate the main theorem in Tom McKay's paper "On plethysm conjectures of Stanley and Foulkes" (J. Alg. 319, 2008, pp. 2050-2071) to the language of weight spaces and projections onto invariant spaces of tensors, which makes its proof…
We investigate extremal metrics at which various types of rigidity theorems involving scalar curvatures hold. The rigidity we discuss here is related to the rigidity theorems presented by Mario Listing in his previous preprint. More…
In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…
We introduce a novel technique for checking reachability in Petri nets that relies on a recently introduced compositional algebra of nets. We prove that the technique is correct, and discuss our implementation. We report promising…
We provide a hand-checkable proof for Lemma 4.9 in the paper "Logical limit laws for minor-closed classes of graphs" by Heinig, Muller, Noy and Taraz.
This is a reply to a Comment on 'A test-tube model for rainfall', {\it Europhys. Lett.}, {\bf 106}, 40001, (2014).
We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…
On [3, p. 199] one says "We mention parenthetically that the proof of [99, Lemma 41.3] is incorrect, and we do not know whether it, [99, Theorem 41.5] and [99, Theorem 41.6] are true". The previously cited reference [99] is our reference…
This paper continues a series discussing flaws in published assertions concerning fixed points in digital metric spaces.
We attempt to review all trustworthy and well-controlled de Sitter compactifications of string theory.
The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it…
Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…
In this paper, we give the rigidity theorem for a log morphism as an extension of a fixed scheme morphism. We also give several applications of the rigidity theorem.