English
Related papers

Related papers: Splitting families and complete separability

200 papers

We show that if $K$ is a nilpotent finite complex, then $\Omega K$ can be built from spheres using fibrations and homotopy (inverse) limits. This is applied to show that if ${\mathrm {map}}_*(X,S^n)$ is weakly contractible for all $n$, then…

Algebraic Topology · Mathematics 2007-05-23 Jeffrey Strom

We have defined almost separable space. We show that like separability, almost separability is $c$ productive and converse also true under some restrictions. We establish a Baire Category theorem like result in Hausdorff, Pseudocompacts…

General Topology · Mathematics 2020-02-13 Sagarmoy Bag , Ram Chandra Manna , Sourav Kanti Patra

We study maximal orthogonal families of Borel probability measures on $2^\omega$ (abbreviated m.o. families) and show that there are generic extensions of the constructible universe $L$ in which each of the following holds: (1) There is a…

Logic · Mathematics 2011-06-22 Vera Fischer , Sy-David Friedman , Asger Tornquist

We obtain conditions guaranteeing that weak solutions of the differential inequality $$ \sum_{|\alpha| = m} \partial^\alpha a_\alpha (x, u) \ge f (x) g (|u|) \quad \mbox{in } \Omega \setminus S, $$ has a removable singular set $S \subset…

Analysis of PDEs · Mathematics 2022-02-24 A. A. Kon'kov , A. E. Shishkov

We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature.

Logic · Mathematics 2021-04-30 Uri Andrews , Omer Mermelstein

An r.e. set $A$ is speedable if for every recursive function, there exists a program enumerating membership in $A$ faster, by the desired recursive factor, on infinitely many integers. We construct a speedable set that cannot be split into…

Logic · Mathematics 2014-10-09 Ellen Chih

We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.

Group Theory · Mathematics 2012-01-24 Roman Avdeev

We show that almost split sequences in the category of comodules over a coalgebra with finite-dimensional right-hand term are direct limits of almost split sequences over finite dimensional subcoalgebras. In previous work we showed that…

Representation Theory · Mathematics 2007-05-23 William Chin , Mark Kleiner , Declan Quinn

A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…

Combinatorics · Mathematics 2025-04-29 Chenying Lin , Gilles Zémor

We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our…

Number Theory · Mathematics 2010-09-15 Steven J. Miller , Brooke Orosz , Daniel Scheinerman

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

In this article we exhibit new explicit families of congruences for the overpartition function, making effective the existence results given previously by Treneer. We give infinite families of congruences modulo $m$ for $m = 5, 7, 11$, and…

Number Theory · Mathematics 2024-10-16 Nathan C. Ryan , Nicolás Sirolli , Jean Carlos Villegas-Morales , Qi-Yang Zheng

There is much more known about the family of superstable theories when compared to stable theories. This calls for a search of an analogous "super-dependent" characterization in the context of dependent theories. This problem has been…

Logic · Mathematics 2013-03-15 Moran Cohen , Saharon Shelah

We say that a family of $k$-subsets of an $n$-element set is {\it intersecting}, if any two of its sets intersect. In this paper, we study the structure of large intersecting families. Several years ago, Han and Kohayakawa (Proc. AMS,…

Combinatorics · Mathematics 2024-12-12 Andrey Kupavskii

A space $X$ is M-separable (selectively separable) (Scheepers, 1999; Bella et al., 2009) if for every sequence $(Y_n)$ of dense subspaces of $X$ there exists a sequence $(F_n)$ such that for each $n$ $F_n$ is a finite subset of $Y_n$ and…

General Topology · Mathematics 2025-11-07 Debraj Chandra , Nur Alam , Dipika Roy

A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…

We study rigidity questions for pairs of Lie algebras $(\mathfrak{g},\mathfrak{n})$ admitting a post-Lie algebra structure. We show that if $\mathfrak{g}$ is semisimple and $\mathfrak{n}$ is arbitrary, then we have rigidity in the sense…

Rings and Algebras · Mathematics 2022-05-10 Dietrich Burde , Karel Dekimpe , Mina Monadjem

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

Combinatorics · Mathematics 2018-11-07 Ze-Chun Hu , Shi-Lun Li

An almost disjoint family $\mathcal A$ of subsets of $\mathbb N$ is said to be $\mathbb R$-embeddable if there is a function $f:\mathbb N\rightarrow \mathbb R$ such that the sets $f[A]$ are ranges of real sequences converging to distinct…

Logic · Mathematics 2019-01-04 Osvaldo Guzmán , Michael Hrušák , Piotr Koszmider

Let $n > k > 1$ be integers, $[n] = \{1, \ldots, n\}$. Let $\mathcal F$ be a family of $k$-subsets of~$[n]$. The family $\mathcal F$ is called intersecting if $F \cap F' \neq \emptyset$ for all $F, F' \in \mathcal F$. It is called almost…

Combinatorics · Mathematics 2021-03-22 Peter Frankl , Andrey Kupavskii