English
Related papers

Related papers: Update: Remarks on Countable Tightness

200 papers

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…

Number Theory · Mathematics 2020-06-30 K. Győry , L. Hajdu , A. Sárközy

It is a correction paper on "P.J. Wan and C.W. Yi, "Coverage by Randomly Deployed Wireless Sensor Networks", IEEE Transaction On Information Theory, vol.52, No.6, June 2006." In the above paper, Lemma (4), on page 2659 play the key role for…

Information Theory · Computer Science 2009-04-23 Bhupendra Gupta

We discuss published assertions concerning fixed points in digital metric spaces that are incorrect or incorrectly proven, or reduce to triviality.

Geometric Topology · Mathematics 2022-04-06 Laurence Boxer

The goal of this note is to fill a gap in the proof of the first two items of Theorem 5.1 in [4], which relies on Polya type inequalities and the characterization of the equality cases for monotone rearrangements given in Propositions 4.1…

Analysis of PDEs · Mathematics 2025-03-10 B. Pellacci , G. Pisante , D. Schiera

In this paper, we shall prove that the irreducibility in the sense of fine topology implies the uniqueness of invariant probability measures. It is also proven that this irreducibility is strictly weaker than the strong Feller property plus…

Probability · Mathematics 2009-02-20 Ping He , Jiangang Ying

We study tightness properties and selective versions of separability in bitopological function spaces endowed with set-open topologies.

General Topology · Mathematics 2016-05-10 Alexander V. Osipov , Selma Özçağ

This chapter provides a hands-on tutorial on the important technique known as self-reducibility. Through a series of "Challenge Problems" that are theorems that the reader will---after being given definitions and tools---try to prove, the…

Computational Complexity · Computer Science 2019-03-18 Lane A. Hemaspaandra

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

Logic · Mathematics 2026-05-06 Harald Grobner

In the context of tvs-cone metric spaces, we prove a Bishop-Phelps and a Caristi's type theorem. These results allow us to prove a fixed point theorem for $(\delta, L)$-weak contraction according to a pseudo Hausdorff metric defined by…

General Topology · Mathematics 2015-08-24 Raúl Fierro

A first order theory T is said to be "tight" if for any two deductively closed extensions U and V of T (both of which are formulated in the language of T), U and V are bi-interpretable iff U = V. By a theorem of Visser, PA (Peano…

Logic · Mathematics 2017-02-24 Ali Enayat

Remarks on the Obstructedness of Cones Over Curves of Low Genus. Reason for replacement: proof of the main lemma was significantly improved.

alg-geom · Mathematics 2008-02-03 Ciro Ciliberto , Angelo Lopez , Rick Miranda

In this paper author was proved the boundedness of the multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent. As an application we prove the boundedness of certain sublinear operators on the weighted…

Classical Analysis and ODEs · Mathematics 2013-03-05 Rovshan A. Bandaliev

In the paper different kinds of proof of a given statement are discussed. Detailed descriptions of direct and indirect methods of proof are given. Logical models illustrate the essence of specific types of indirect proofs. Direct proofs of…

History and Overview · Mathematics 2015-01-06 Vesselka Mihova , Julia Ninova

It is well-known that every weakly convergent sequence in $\ell_1$ is convergent in the norm topology (Schur's lemma). Phillips' lemma asserts even more strongly that if a sequence $(\mu_n)_{n\in\mathbb N}$ in $\ell_\infty'$ converges…

Functional Analysis · Mathematics 2022-08-30 Ahmed Bouziad

We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for $\mathrm{NIP}$…

Logic · Mathematics 2022-04-07 Erik Walsberg

In this paper, we firstly point out, by a counter example, that Proposition 6.4 of Section 6 in Bump's book (Algebraic Geometry) is error, and then give a correct statement with proof. We finally point out a gap in the proof of Theorem 3,…

Algebraic Geometry · Mathematics 2016-12-20 Guanglian Zhang

Let $A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan…

Number Theory · Mathematics 2021-04-01 Andrew Granville , Aled Walker

In this note we study several topics related to the schema of local reflection $\mathsf{Rfn}(T)$ and its partial and relativized variants. Firstly, we introduce the principle of uniform reflection with $\Sigma_n$-definable parameters,…

Logic · Mathematics 2020-10-20 Evgeny Kolmakov

An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…

Dynamical Systems · Mathematics 2025-06-11 Michael Björklund , Alexander Fish

We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…

General Topology · Mathematics 2024-04-05 Dominikus Noll