English
Related papers

Related papers: When is the complement of the diagonal of a LOTS f…

200 papers

We study some aspects of countably additive vector measures with values in $\ell_\infty$ and the Banach lattices of real-valued functions that are integrable with respect to such a vector measure. On the one hand, we prove that if $W…

Functional Analysis · Mathematics 2023-02-16 S. Okada , J. Rodríguez , E. A. Sánchez-Pérez

We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…

Logic · Mathematics 2025-07-25 Andrew DeLapo , David Gonzalez

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…

General Topology · Mathematics 2013-10-22 Marion Scheepers

We show in ZF that: (i) Every subcompact metrizable space is completely metrizable, and every completely metrizable space is countably subcompact. (ii) A metrizable space X=(X,T) is countably compact iff it is countably subcompact relative…

General Topology · Mathematics 2021-02-23 Kyriakos Keremedis

We introduce the property of countable separation for a locally convex Hausdorff space $X$ and relate it to the existence of a metrizable coarser topology. Building on this, we demonstrate how the separability of $X$ is equivalent to the…

Functional Analysis · Mathematics 2025-10-10 Thomas Ruf

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

Functional Analysis · Mathematics 2020-11-11 Michael Dymond , Olga Maleva

Michael asked whether every productively Lindel\"of space is powerfully Lindel\"of. Building of work of Alster and De la Vega, assuming the Continuum Hypothesis, we show that every productively Lindel\"of space of countable tightness is…

General Topology · Mathematics 2017-11-22 Andrea Medini , Lyubomyr Zdomskyy

All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

Combinatorics · Mathematics 2013-01-22 Milan Janjic , Boris Petkovic

A function F:R^2->R is sup-measurable if F_f:R->R given by F_f(x)=F(x,f(x)), x in R, is measurable for each measurable function f:R->R. It is known that under different set theoretical assumptions, including CH, there are sup-measurable…

Logic · Mathematics 2007-05-23 Krzysztof Ciesielski , Saharon Shelah

In connection with recent work on gaps in the asymptotic subranks of complex tensors the question arose whether the number of nonnegative real numbers that arise as the asymptotic subrank of some complex tensor is countable. In this short…

Algebraic Geometry · Mathematics 2022-12-26 Andreas Blatter , Jan Draisma , Filip Rupniewski

A metric continuum $X$ is indecomposable if it cannot be put as the union of two of its proper subcontinua. A subset $R$ of $X$ is said to be continuumwise connected provided that for each pair of points $p,q\in R$, there exists a…

Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…

Combinatorics · Mathematics 2026-03-04 Florian Bridoux , Christophe Crespelle , Thi Ha Duong Phan , Adrien Richard

We study the function M(t,n) = Floor[ 1 / {t^(1/n)} ], where t is a positive real number, Floor[.] and {.} are the floor and fractional part functions, respectively. In a recent article in the Monthly, Nathanson proved that if log(t) is…

Number Theory · Mathematics 2015-06-11 Kevin O'Bryant

Let $X$ be a Banach space and $K$ an absolutely convex, weak$^\ast$-compact subset of $X^\ast$. We study consequences of $K$ having a large or undefined Szlenk index and subsequently derive a number of related results concerning basic…

Functional Analysis · Mathematics 2019-09-04 Philip A. H. Brooker

We study a strengthening of the notion of a perfectly meager set. We say that that a subset $A$ of a perfect Polish space $X$ is countably perfectly meager in $X$, if for every sequence of perfect subsets $\{P_n: n \in {\mathbb N}\}$ of…

Logic · Mathematics 2021-06-08 Roman Pol , Piotr Zakrzewski

In this paper we study the functional central limit theorem for stationary Markov chains with self-adjoint operator and general state space. We investigate the case when the variance of the partial sum is not asymptotically linear in n; and…

Probability · Mathematics 2013-05-10 Martial Longla , Costel Peligrad , Magda Peligrad

A regular topological space $X$ is defined to be a $\mathfrak P_0$-space if it has countable Pytkeev network. A network $\mathcal N$ for $X$ is called a Pytkeev network if for any point $x\in X$, neighborhood $O_x\subset X$ of $x$ and…

General Topology · Mathematics 2016-11-10 Taras Banakh

A multidimensional sofic shift is called countably covered if it has an SFT cover containing only countably many configurations. In contrast to the one-dimensional setting, not all countable sofic shifts are countably covered. We…

Dynamical Systems · Mathematics 2025-10-20 Ilkka Törmä

A topological space is called Loeb if the collection of all its non-empty closed sets has a choice function. In this article, in the absence of the axiom of choice, connections between Loeb and sequential spaces are investigated. Among…

General Topology · Mathematics 2019-04-16 Kyriakos Keremedis , Eliza Wajch