English
Related papers

Related papers: Splitting families and complete separability

200 papers

In the framework of Asplund spaces, we use two equivalent instruments - rich families and suitable models from logic - for performing separable reductions of various statements on Frechet subdifferentiability of functions. This way,…

Functional Analysis · Mathematics 2016-01-22 Marek Cuth , Marian Fabian

Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…

Logic · Mathematics 2021-11-09 Pablo Andújar Guerrero

We say that a family of $k$-subsets of an $n$-element set is intersecting, if any two of its sets intersect. In this paper we study different extremal properties of intersecting families, as well as the structure of large intersecting…

Combinatorics · Mathematics 2019-02-06 Andrey Kupavskii

We give a new proof that there are arbitrarily large indecomposable abelian groups; moreover, the groups constructed are absolutely indecomposable, that is, they remain indecomposable in any generic extension. However, any absolutely rigid…

Logic · Mathematics 2007-05-23 Paul C. Eklof , Saharon Shelah

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko

In this paper we introduce a new homology theory devoted to the study of families such as semi-algebraic or subanalytic families and in general to any family definable in an o-minimal structure (such as Denjoy-Carleman definable or $ln-exp$…

Algebraic Geometry · Mathematics 2008-01-15 Guillaume Valette

Let $A\subset \mathbb{N}^{n}$ be an $r$-wise $s$-union family, that is, a family of sequences with $n$ components of non-negative integers such that for any $r$ sequences in $A$ the total sum of the maximum of each component in those…

Combinatorics · Mathematics 2016-06-03 Peter Frankl , Masashi Shinohara , Norihide Tokushige

We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for…

Logic · Mathematics 2025-05-08 Vera Fischer , Lukas Schembecker , David Schrittesser

We study two different types of (maximal) almost disjoint families: very mad families and (maximal) cofinitary groups. For the very mad families we prove the basic existence results. We prove that MA implies there exist many pairwise…

Logic · Mathematics 2009-10-05 Bart Kastermans

We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…

Quantum Algebra · Mathematics 2013-08-09 Steve Bennoun , Hendryk Pfeiffer

We describe a method for determining a complete set of integrals for a classical Hamiltonian that separates in orthogonal subgroup coordinates. As examples, we use it to determine complete sets of integrals, polynomial in the momenta, for…

Mathematical Physics · Physics 2015-05-14 E. G. Kalnins , J. M. Kress , W. Miller

An $m \times n$ matrix $\mathsf{A}$ with column supports $\{S_i\}$ is $k$-separable if the disjunctions $\bigcup_{i \in \mathcal{K}} S_i$ are all distinct over all sets $\mathcal{K}$ of cardinality $k$. While a simple counting bound shows…

Combinatorics · Mathematics 2017-11-27 Matthew Aldridge , Leonardo Baldassini , Karen Gunderson

We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family…

Logic · Mathematics 2023-06-19 Vera Fischer , Corey Bacal Switzer

An infinite family of exactly-solvable and integrable potentials on a plane is introduced. It is shown that all already known rational potentials with the above properties allowing separation of variables in polar coordinates are particular…

Mathematical Physics · Physics 2015-05-13 Frédérick Tremblay , Alexander V. Turbiner , Pavel Winternitz

Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory,…

Discrete Mathematics · Computer Science 2016-10-26 Chong Shangguan , Gennian Ge

The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…

Logic · Mathematics 2010-05-28 Gido Scharfenberger-Fabian

While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…

Logic · Mathematics 2024-08-20 Calliope Ryan-Smith

Let $G$ be a finite group. We will say that $M$ and $S$ form a \textsl{complete splitting} (\textsl{splitting}) of $G$ if every element (nonzero element) $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$,…

Combinatorics · Mathematics 2020-03-31 Kevin Zhao

A family $\mathcal{F}$ of $k$-subsets of an $n$-set is called $s$-almost $t$-intersecting if each member is $t$-disjoint with at most $s$ members. In this paper, we prove that, if $\left|\mathcal{F}\right|$ is maximum, then $\mathcal{F}$…

Combinatorics · Mathematics 2026-01-13 Dehai Liu , Kaishun Wang , Tian Yao

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…

Logic · Mathematics 2019-02-20 Vera Koponen