English
Related papers

Related papers: 2-intersecting permutations

200 papers

We consider the following higher-order analog of the Erd\H{o}s--Ko--Rado theorem. For positive integers r and n with r<= n, let M^r_n be the family of all matchings of size r in the complete graph K_{2n}. For any edge e in E(K_{2n}), the…

Combinatorics · Mathematics 2013-04-02 Vikram Kamat , Neeldhara Misra

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

Combinatorics · Mathematics 2015-06-12 Peter Borg

We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

Let $\omega(\mathcal{F})=\sum_{\{A,B\}\subset\mathcal{F}}|A\cap B|$ and $\omega(\mathcal{A},\mathcal{B})=\sum_{(A,B)\in \mathcal{A}\times \mathcal{B}}|A\cap B|$. A family $\mathcal{F}$ is intersecting if $F_1\cap F_2\neq \emptyset$ for any…

Combinatorics · Mathematics 2024-02-27 Sumin Huang

Let $\sigma$ be a permutation on $n$ letters. We say that a permutation $\tau$ is an even (resp. odd) $k$th root of $\sigma$ if $\tau^k=\sigma$ and $\tau$ is an even (resp. odd) permutation. In this article, we obtain generating functions…

Combinatorics · Mathematics 2023-07-14 Lev Glebsky , Melany Licón , Luis Manuel Rivera

A subset $Y$ of the general linear group $\operatorname{GL}(n,q)$ is called $t$-intersecting if $\operatorname{rk}(x-y)\le n-t$ for all $x,y\in Y$, or equivalently $x$ and $y$ agree pointwise on a $t$-dimensional subspace of…

Combinatorics · Mathematics 2023-06-28 Alena Ernst , Kai-Uwe Schmidt

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

Combinatorics · Mathematics 2024-10-07 Gabriel Crudele , Peter Dukes , Jonathan A. Noel

In this paper, we investigate Erd\H os--Ko--Rado type theorems for families of vectors from $\{0,\pm 1\}^n$ with fixed numbers of $+1$'s and $-1$'s. Scalar product plays the role of intersection size. In particular, we sharpen our earlier…

Combinatorics · Mathematics 2020-04-21 Peter Frankl , Andrey Kupavskii

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

Classical Analysis and ODEs · Mathematics 2014-08-12 Tuomas Orponen

Let $k\ge d\ge 3$ be fixed. Let $\mathcal{F}$ be a $k$-uniform family on $[n]$. Then $\mathcal{F}$ is $(d,s)$-conditionally intersecting if it does not contain $d$ sets with union of size at most $s$ and empty intersection. Answering a…

Combinatorics · Mathematics 2020-05-18 Xizhi Liu

Erd\H{o}s-Ko-Rado (EKR) type theorems yield upper bounds on the sizes of families of sets, subject to various intersection requirements on the sets in the family. Stability versions of such theorems assert that if the size of a family is…

Combinatorics · Mathematics 2018-05-28 David Ellis , Nathan Keller , Noam Lifshitz

We initiate the study of property testing problems concerning relations between permutations. In such problems, the input is a tuple $(\sigma_1,\dotsc,\sigma_d)$ of permutations on $\{1,\dotsc,n\}$, and one wishes to determine whether this…

Data Structures and Algorithms · Computer Science 2024-07-11 Oren Becker , Alexander Lubotzky , Jonathan Mosheiff

Let $S_n$ denote the symmetric group. We consider \begin{equation*} N_{\ell}(n) := \frac{\left\vert Hom\left( \mathbb{Z}^{\ell},S_n\right) \right\vert}{n!} \end{equation*} which also counts the number of $\ell$-tuples $\pi=\left( \pi_1,…

Combinatorics · Mathematics 2024-09-10 Abdelmalek Abdesselam , Bernhard Heim , Markus Neuhauser

Two permutations of $[n]=\{1,2 \ldots n\}$ are \textit{$k$-neighbor separated} if there are two elements that are neighbors in one of the permutations and that are separated by exactly $k-2$ other elements in the other permutation. Let the…

Combinatorics · Mathematics 2017-11-22 István Kovács , Daniel Soltész

Double semigroups have two associative operations $\circ, \bullet$ related by the interchange relation: $( a \bullet b ) \circ ( c \bullet d ) \equiv ( a \circ c ) \bullet ( b \circ d )$. Kock \cite{Kock2007} (2007) discovered a…

Rings and Algebras · Mathematics 2025-07-22 Murray Bremner , Sara Madariaga

In this paper we give an affirmative answer to a conjecture proposed by Danny Neftin, that is, if the commutator of two permutations has at least n-4 fixed points where two permutations are in degree n symmetric group, then there exists a…

Group Theory · Mathematics 2021-06-17 Junyao Pan

A permutation $\sigma\in\mathfrak{S}_n$ is simsun if for all $k$, the subword of $\sigma$ restricted to $\{1,...,k\}$ does not have three consecutive decreasing elements. The permutation $\sigma$ is double simsun if both $\sigma$ and…

Combinatorics · Mathematics 2010-04-23 Wan-Chen Chuang , Sen-Peng Eu , Tung-Shan Fu , Yeh-Jong Pan

For an integer $m \geq 2$, let $\mathcal{P}_m$ be the partition of the unit interval $I$ into $m$ equal subintervals, and let $\mathcal{F}_m$ be the class of piecewise linear maps on $I$ with constant slope $\pm m$ on each element of…

Dynamical Systems · Mathematics 2015-06-10 Nigel P. Byott , Congping Lin , Yiwei Zhang

The Erd\H{o}s--Ko--Rado (EKR) theorem and its generalizations can be viewed as classifications of maximum independent sets in appropriately defined families of graphs, such as the Kneser graph $K(n,k)$. In this paper, we investigate the…

Combinatorics · Mathematics 2024-06-25 Karen Gunderson , Karen Meagher , Joy Morris , Venkata Raghu Tej Pantangi , Mahsa N. Shirazi

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…

Combinatorics · Mathematics 2024-12-18 Lijun Ji , Dehai Liu , Kaishun Wang , Tian Yao , Shuhui Yu
‹ Prev 1 8 9 10 Next ›