English
Related papers

Related papers: Erdos-Ko-Rado theorem for the group $\textrm{PSU}(…

200 papers

We examine various perspectives on the decay of correlation for the uniform distribution over proper $q$-edge colorings of graphs with maximum degree $\Delta$. First, we establish the coupling independence property when $q\ge 3\Delta$ for…

Data Structures and Algorithms · Computer Science 2025-06-03 Zejia Chen , Yulin Wang , Chihao Zhang , Zihan Zhang

In the present paper, we study various Erd\H{o}s type geometric problems in the setting of the integers modulo $q$, where $q=p^l$ is an odd prime power. More precisely, we prove certain results about the distribution of triangles and…

Combinatorics · Mathematics 2014-06-26 Esen Aksoy Yazici

Let $h=\prod_{i=1}^{t}p_i^{s_i}$ be its decomposition into a product of powers of distinct primes, and $\mathbb{Z}_{h}$ be the residue class ring modulo $h$. Let $1\leq r\leq m\leq n$ and $\mathbb{Z}_{h}^{m\times n}$ be the set of all…

Combinatorics · Mathematics 2020-02-11 Jun Guo

This paper addresses a theory of R(p,q)-deformed combinatorics in discrete probability. It mainly focuses on R(p,q)-deformed factorials, binomial coefficients, Vandermonde's formula, Cauchy's formula, binomial and negative binomial…

General Mathematics · Mathematics 2019-06-10 Mahouton Norbert Hounkonnou , Fridolin Melong

Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…

Combinatorics · Mathematics 2017-08-28 Sebastian M. Cioabă , Felix Lazebnik , Shuying Sun

We consider the Cayley graph on the symmetric group Sn generated by derangements. It is well known that the eigenvalues of this grpah are indexed by partitions of n. We investigate how these eigenvalues are determined by the shape of their…

Combinatorics · Mathematics 2008-03-21 Cheng Yeaw Ku , David B. Wales

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

Combinatorics · Mathematics 2016-08-17 Arran Hamm , Jeff Kahn

The celebrated Erd\H{o}s-Ko-Rado (EKR) theorem for Paley graphs (of square order) states that all maximum cliques are canonical in the sense that each maximum clique arises from the subfield construction. Recently, Asgarli and Yip extended…

Combinatorics · Mathematics 2024-02-02 Chi Hoi Yip

A subset $S$ of the alternating group on $n$ points is {\it intersecting} if for any pair of permutations $\pi,\sigma$ in $S$, there is an element $i\in \{1,\dots,n\}$ such that $\pi(i)=\sigma(i)$. We prove that if $S$ is intersecting, then…

Combinatorics · Mathematics 2013-03-01 Bahman Ahmadi , Karen Meagher

A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least…

Combinatorics · Mathematics 2020-08-20 Shaun Fallat , Karen Meagher , Mahsa N. Shirazi

Given a graph $G$, we have the adjacency matrix $A(G)$ and degree diagonal matrix $D(G)$. The $Q$-spectrum is the all eigenvalues of $Q$-matrix $Q(G)=A(G)+D(G)$. A class of graphs is determined by their generalized $Q$-spectrum (DGQS for…

Spectral Theory · Mathematics 2023-11-07 Liwen Gao , Xuejun Guo

A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two…

Combinatorics · Mathematics 2011-06-29 Hannah Jackson , Kathryn Nyman , Les Reid

Let $h=\prod_{i=1}^{t}p_i^{s_i}$ be its decomposition into a product of powers of distinct primes, and $\mathbb{Z}_{h}$ be the residue class ring modulo $h$. Let $\mathbb{Z}_{h}^{n}$ be the $n$-dimensional row vector space over…

Combinatorics · Mathematics 2022-01-04 Jun Guo

A family of sets is intersecting if any two sets in the family intersect. Given a graph $G$ and an integer $r\geq 1$, let $\mathcal{I}^{(r)}(G)$ denote the family of independent sets of size $r$ of $G$. For a vertex $v$ of $G$, the family…

Combinatorics · Mathematics 2020-08-25 Carl Feghali , Glenn Hurlbert , Vikram Kamat

Regular maps on linear fractional groups $PSL(2,q)$ and $PGL(2,q$) have been studied for many years and the theory is well-developed, including generating sets for the asscoiated groups. This paper studies the properties of self-duality,…

Combinatorics · Mathematics 2018-07-31 Grahame Erskine , Katarína Hriňáková , Olivia Jeans

Let $V:=(\mathbb{F}_q)^d$ be a $d$-dimensional vector space over the field $\mathbb{F}_q$ of order $q$. Fix positive integers $e_1,e_2$ satisfying $e_1+e_2=d$. Motivated by analysing a fundamental algorithm in computational group theory for…

Group Theory · Mathematics 2025-02-19 S. P. Glasby , Alice C. Niemeyer , Cheryl E. Praeger

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…

Combinatorics · Mathematics 2023-06-27 József Balogh , William Linz

We consider an Erd\H{o}s-Ko-Rado type sum that weights each member of a uniform family according to its smallest intersection with the rest of the family. We prove that once the ground set is sufficiently large this sum is at most one, with…

Combinatorics · Mathematics 2026-05-07 Casey Tompkins

We develop further the theory of $q$-deformations of real numbers introduced by Morier-Genoud and Ovsienko, and focus in particular on the class of real quadratic irrationals. Our key tool is a $q$-deformation of the modular group…

Number Theory · Mathematics 2021-01-11 Ludivine Leclere , Sophie Morier-Genoud

For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…

Combinatorics · Mathematics 2022-02-22 Cyrus Rashtchian , William Raynaud