中文
相关论文

相关论文: A Special Class of Almost Disjoint Families

200 篇论文

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

组合数学 · 数学 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

We recall some classical results relating normality and some natural weakenings of normality in $\Psi$-spaces over almost disjoint families of branches in the Cantor tree to special sets of reals like $Q$-sets, $\lambda$-sets and…

一般拓扑 · 数学 2021-12-21 Vinicius Rodrigues , Victor dos Santos Ronchim , Paul Szeptycki

Given a family $F$ of pairwise almost disjoint sets on a countable set $S$, we study maximal almost disjoint (mad) families $F^+$ extending $F$. We define $a^+(F)$ to be the minimal possible cardinality of $F^+\setminus F$ for such $F^+$,…

逻辑 · 数学 2017-03-08 Sakaé Fuchino , Stefan Geschke , Osvaldo Guzman , Lajos Soukup

A subset of vertices is a {\it maximum independent set} if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a {\it maximum dissociation set} if it induces a subgraph with vertex…

组合数学 · 数学 2020-08-28 Tu Jianhua , Zhang Zhipeng , Shi Yongtang

We answer a question from Raghavan and Stepr{\=a}ns' paper on weakly tight families by showing that $\mathfrak{s} = {\mathfrak{s}}_{\omega, \omega}$. Then we use this to construct a completely separable maximal almost disjoint family under…

逻辑 · 数学 2019-08-15 Heike Mildenberger , Dilip Raghavan , Juris Steprāns

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

逻辑 · 数学 2024-05-22 Vera Fischer , Corey Bacal Switzer

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}$…

组合数学 · 数学 2026-01-13 Dehai Liu , Kaishun Wang , Tian Yao

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…

逻辑 · 数学 2009-10-05 Bart Kastermans

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…

组合数学 · 数学 2021-03-22 Peter Frankl , Andrey Kupavskii

We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…

逻辑 · 数学 2011-11-01 Dilip Raghavan , Saharon Shelah

Let $G$ be a simple graph. A dissociation set of $G$ is defined as a set of vertices that induces a subgraph in which every vertex has a degree of at most 1. A dissociation set is maximal if it is not contained as a proper subset in any…

组合数学 · 数学 2024-10-29 Ziyuan Wang , Lei Zhang , Jianhua Tu , Liming Xiong

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

逻辑 · 数学 2019-12-24 Vera Fischer

We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here disjoint can mean vertex-disjoint or edge-disjoint, and the…

组合数学 · 数学 2023-02-06 Niklas Schlomberg , Hanjo Thiele , Jens Vygen

We construct a new family of groups that is non-contracting and weakly regular branch over the derived subgroup. This gives the first example of an infinite family of groups acting on a $d$-adic tree, with $d \geq 2$, with these properties.

群论 · 数学 2020-05-21 Marialaura Noce

In this paper, we focus on families of bipartitions, i.e. set partitions consisting of at most two components. We say that a family of bipartitions is a separating family for a set $S$ if every two elements in $S$ can be separated by some…

组合数学 · 数学 2011-11-08 Takahisa Toda , Ivo Vigan

Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one…

组合数学 · 数学 2015-08-25 Zsolt Lángi , Márton Naszódi , János Pach , Gábor Tardos , Géza Tóth

We explore almost-normality in Isbell-Mr\'owka spaces and some related concepts. We use forcing to provide an example of an almost-normal not normal almost disjoint family, explore the concept of semi-normality in Isbell-Mr\'owka spaces,…

一般拓扑 · 数学 2020-12-04 Vinicius de Oliveira Rodrigues , Victor dos Santos Ronchim

We introduce a new class of almost disjoint families which we call fin-intersecting almost disjoint families. They are related to almost disjoint families whose Vietoris Hyperspace of their Isbell-Mr\'owka spaces are pseudocompact. We show…

一般拓扑 · 数学 2023-04-26 Cesar Corral , Vinicius de O. Rodrigues

A family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is called $k$-wise intersecting if any $k$ members of $\mathcal{F}$ have non-empty intersection, and it is called maximal $k$-wise intersecting if no family strictly containing…

组合数学 · 数学 2022-09-21 Barnabás Janzer

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…

逻辑 · 数学 2019-01-04 Osvaldo Guzmán , Michael Hrušák , Piotr Koszmider
‹ 上一页 1 2 3 10 下一页 ›