English
Related papers

Related papers: An Erd\H{o}s-Ko-Rado theorem in general linear gro…

200 papers

Fix non-zero reals $\alpha_1,\ldots,\alpha_n$ with $n\ge 2$ and let $K$ be a non-empty open connected set in a topological vector space such that $\sum_{i\le n}\alpha_iK\subseteq K$ (which holds, in particular, if $K$ is an open convex cone…

Functional Analysis · Mathematics 2019-06-03 Paolo Leonetti , Jens Schwaiger

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Classical Analysis and ODEs · Mathematics 2025-03-14 Paige Bright , Manik Dhar

Let $\mathcal{G}$ be a smooth linear group scheme of finite type. For any positive integer $k$ and a finite field $\mathbb{F}$, let $W_k(\mathbb{F})$ be the ring of Witt vectors of length $k$ over $\mathbb{F}$. We show that the group…

Representation Theory · Mathematics 2022-07-14 Itamar Hadas

For a complex number $x$, $\Vert x\Vert:=\min\{|x-m|:m\in\mathbb{Z}\}$. Let $k\geq 1$ be an integer, and $K$ be a number field. Let $\alpha_1,\ldots,\alpha_k$ be algebraic numbers with $|\alpha_i|\geq 1$ and let $d_i$ denotes the degree of…

Number Theory · Mathematics 2025-12-15 Veekesh Kumar , Gorekh Prasad

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…

Combinatorics · Mathematics 2022-11-23 Jagannath Bhanja , Sayan Goswami

Let $\mathscr{F}$ and $\mathscr{G}$ be families of $k$- and $\ell$-dimensional subspaces, respectively, of a given $n$-dimensional vector space over a finite field $\mathbb{F}_q$. Suppose that $x \cap y \ne 0$ for all $x \in \mathscr{F}$…

Combinatorics · Mathematics 2014-03-27 Sho Suda , Hajime Tanaka

We give a canonical partition of shifted intersecting set systems, from which one can obtain unified and elementary proofs of the Erd\H{o}s-Ko-Rado and Hilton-Milner Theorem, as well as a characterization of maximal shifted $k$-uniform…

Combinatorics · Mathematics 2022-06-28 Nguyen Trong Tuan , Nguyen Anh Thi

Let $\mathbb {F}_q$ be finite field with $q$ elements. Let $\alpha\leqslant n$ be positive integers. Consider the general linear group $\mathrm{GL}(\alpha+n, \mathbb {F}_q) $ and its subgroup $H(n)$, which fixes the first $\alpha$ basis…

Representation Theory · Mathematics 2025-08-25 Yury A. Neretin

A family $\mathcal F$ has covering number $\tau$ if the size of the smallest set intersecting all sets from $\mathcal F$ is equal to $\tau$. Let $M(n,k,\tau)$ stand for the size of the largest intersecting family $\mathcal F$ of $k$-element…

Combinatorics · Mathematics 2023-05-09 Peter Frankl , Andrey Kupavskii

Ellis, Filmus, and Friedgut proved an old conjecture of Simonovits and S\'os showing that the maximum size of a triangle-intersecting family of graphs on $n$ vertices has size at most $2^{\binom{n}{2} - 3}$, with equality for the family of…

Combinatorics · Mathematics 2021-04-02 Aaron Berger , Yufei Zhao

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…

Combinatorics · Mathematics 2022-09-21 Barnabás Janzer

Throughout this abstruct $A$ will denote a noetherian commutative ring of dimension $n$. The paper has two parts. Among the interesting results in Part-1 are the following: 1) {\it suppose that $f_1, f_2, ..., f_r$ (with $r \leq n$) is a…

alg-geom · Mathematics 2008-02-03 Satya Mandal

Let $G$ be a $k$-degenerate graph of order $n.$ It is well-known that $G\ $has no more edges than $S_{n,k},$ the join of a complete graph of order $k$ and an independent set of order $n-k.$ In this note it is shown that $S_{n,k}$ is…

Combinatorics · Mathematics 2014-03-25 V. Nikiforov

Let $L(X)$ be a monic $q$-linearized polynomial over $F_q$ of degree $q^n$, where $n$ is an odd prime. Recently Gow and McGuire showed that the Galois group of $L(X)/X-t$ over the field of rational functions $F_q(t)$ is $GL_n(q)$ unless…

Number Theory · Mathematics 2026-05-19 Peter Müller

A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal…

Combinatorics · Mathematics 2023-06-22 Ran Pan , Jeffrey B. Remmel

In this paper we investigate Erd\H{o}s-Ko-Rado theorems in ovoidal circle geometries. We prove that in M\"obius planes of even order greater than 2, and ovoidal Laguerre planes of odd order, the largest families of circles which pairwise…

Combinatorics · Mathematics 2022-03-23 Sam Adriaensen

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

For a family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$, let $\mathcal{D}(\mathcal{F}) = \{F\setminus G: F, G \in \mathcal{F}\}$ be the collection of all (setwise) differences of $\mathcal{F}$. The family $\mathcal{F}$ is called a…

Combinatorics · Mathematics 2022-11-09 Jagannath Bhanja , Sayan Goswami

We apply Fourier analysis on finite groups to obtain simplified formulations for the Lov\'asz theta-number of a Cayley graph. We put these formulations to use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made in a…

Optimization and Control · Mathematics 2014-06-19 Evan DeCorte , David de Laat , Frank Vallentin

We give a new proof of the Frankl-R\"odl theorem on forbidden intersections, via the probabilistic method of dependent random choice. Our method extends to codes with forbidden distances, where over large alphabets our bound is…

Combinatorics · Mathematics 2014-02-26 Peter Keevash , Eoin Long