中文
相关论文

相关论文: Non-trivial $t$-intersecting families for symplect…

200 篇论文

Let $\mathscr{P}$ be a symplectic polar space over a finite field $\mathbb{F}_q$, and $\mathscr{P}_m$ denote the collection of all $k$-dimensional totally isotropic subspace in $\mathscr{P}$. Let $\mathscr{F}_1\subset\mathscr{P}_{m_1}$ and…

组合数学 · 数学 2022-02-25 Tian Yao , Kaishun Wang

Let $V$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$. In this paper we describe the structure of maximal non-trivial $t$-intersecting families of $k$-dimensional subspaces of $V$ with large size. We also determine…

组合数学 · 数学 2020-07-24 Mengyu Cao , Benjian Lv , Kaishun Wang , Sanming Zhou

Let $V$ be an $(n+\ell)$-dimensional vector space over a finite field, and $W$ a fixed $\ell$-dimensional subspace of $V$. Write ${V\brack n,0}$ to be the set of all $n$-dimensional subspaces $U$ of $V$ satisfying $\dim(U\cap W)=0$. A…

组合数学 · 数学 2021-03-23 Mengyu Cao , Benjian Lv , Kaishun Wang

Denote the collection of all $k$-flats in $AG(n,\mathbb{F}_q)$ by $\mathscr{M}(k,n)$. Let $\mathscr{F}_1\subset\mathscr{M}(k_1,n)$ and $\mathscr{F}_2\subset\mathscr{M}(k_2,n)$ satisfy $\dim(F_1\cap F_2)\ge t$ for any $F_1\in\mathscr{F}_1$…

组合数学 · 数学 2022-02-16 Tian Yao , Kaishun Wang

Let $[n]:=\lbrace 1,2,\ldots,n \rbrace$, and $M$ be a set of positive integers. Denote the family of all subsets of $[n]$ with sizes in $M$ by $\binom{\left[n\right]}{M}$. The non-empty families…

组合数学 · 数学 2024-02-08 Shuang Li , Dehai Liu , Deping Song , Tian Yao

Guo and Xu determined the maximum size of intersecting families over finite affine spaces and showed that any family reaches maximum size must be trivial. In this paper, we characterize non-trivial intersecting family with maximum size.

组合数学 · 数学 2020-04-27 Chao Gong , Benjian Lv , Kaishun Wang

Let $V$ be a finite dimensional vector space over a finite field, and $\mathcal{F}$ a family consisting of $k$-subspaces of $V$. The family $\mathcal{F}$ is called $t$-intersecting if $\dim(F_{1}\cap F_{2})\geq t$ for any $F_{1}, F_{2}\in…

组合数学 · 数学 2024-12-18 Lijun Ji , Dehai Liu , Kaishun Wang , Tian Yao , Shuhui Yu

We say a family of sets is intersecting if any two of its sets intersect, and we say it is trivially intersecting if there is an element which appears in every set of the family. In this paper we study the maximum size of a non-trivially…

组合数学 · 数学 2019-07-01 Matthew Kwan , Benny Sudakov , Pedro Vieira

Let $\mathcal{F}$ be a family of $k$-dimensional subspaces of an $n$-dimensional vector space. Write $\mathcal{D}_{\mathcal{F}}(H;t)=\{F\in \mathcal{F}\colon \dim(F\cap H)\leq t \}$ for a subspace $H$. The family $\mathcal{F}$ is called…

组合数学 · 数学 2024-12-19 Shuhui Yu , Lijun Ji

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$. Suppose that $\mathscr{F}$ is an intersecting family of $m$-dimensional subspaces of $V$. The covering number of $\mathscr{F}$ is the minimum dimension of a…

组合数学 · 数学 2020-02-17 Chao Gong , Benjian Lv , Kaishun Wang

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$, and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. The families $\mathcal{F}_1\subseteq{V\brack k_1},\mathcal{F}_2\subseteq{V\brack…

组合数学 · 数学 2022-01-19 Mengyu Cao , Mei Lu , Benjian Lv , Kaishun Wang

We consider families of k-subsets of the standard n-set. Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all…

组合数学 · 数学 2022-09-07 Peter Frankl

In this paper, we describe the structure of maximal non-trivial uniform $t$-intersecting families with large size for finite sets. In the special case when $t=1$, our result gives rise to Kostochka and Mubayi's result in 2017.

组合数学 · 数学 2020-11-17 Mengyu Cao , Benjian Lv , Kaishun Wang

For positive integers $n,r,k$ with $n\ge r$ and $k\ge2$, a set $\{(x_1,y_1),(x_2,y_2),\dots,(x_r,y_r)\}$ is called a $k$-signed $r$-set on $[n]$ if $x_1,\dots,x_r$ are distinct elements of $[n]$ and $y_1\dots,y_r\in[k]$. We say a…

组合数学 · 数学 2021-04-28 Tian Yao , Benjian Lv , Kaishun Wang

Let $V$ be a finite dimensional vector space over a finite field. Suppose that $\mathscr{F}_1$, $\mathscr{F}_2$, $\dots$, $\mathscr{F}_r$ are $r$-cross $t$-intersecting families of $k$-subspaces of $V$. In this paper, we determine the…

组合数学 · 数学 2024-05-01 Tian Yao , Dehai Liu , Kaishun Wang

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F} _{q} $, and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. The families $\mathcal{F},\mathcal{G}\subseteq {V\brack k}$ are said to be…

组合数学 · 数学 2026-02-13 Dehai Liu , Jinhua Wang , Tian Yao

In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…

组合数学 · 数学 2026-02-24 Jie Wen , Benjian Lv

The study of intersecting structures is central to extremal combinatorics. A family of permutations $\mathcal{F} \subset S_n$ is \emph{$t$-intersecting} if any two permutations in $\mathcal{F}$ agree on some $t$ indices, and is…

组合数学 · 数学 2015-01-12 József Balogh , Shagnik Das , Michelle Delcourt , Hong Liu , Maryam Sharifzadeh

Let $\mathcal T_n$ denote the set of all labelled spanning trees of $K_n$. A family $\mathcal F \subset \mathcal T_n$ is $t$-intersecting if for all $A, B \in \mathcal F$ the trees $A$ and $B$ share at least $t$ edges. In this paper, we…

组合数学 · 数学 2025-07-25 Elizaveta Iarovikova , Andrey Kupavskii

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$ and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. A family $\mathcal{F}\subseteq {V\brack k}$ is called $k$-uniform $r$-wise…

组合数学 · 数学 2025-03-11 Haixiang zhang , Mengyu Cao , Mei Lu , Jiaying Song
‹ 上一页 1 2 3 10 下一页 ›