中文
相关论文

相关论文: All $2$-transitive groups have the EKR-module prop…

200 篇论文

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…

组合数学 · 数学 2013-03-01 Bahman Ahmadi , Karen Meagher

Two families $\mathcal{A}$ and $\mathcal{B}$, of $k$-subsets of an $n$-set, are {\em cross $t$-intersecting} if for every choice of subsets $A \in \mathcal{A}$ and $B \in \mathcal{B}$ we have $|A \cap B| \geq t$. We address the following…

组合数学 · 数学 2015-03-17 Peter Frankl , Sang June Lee , Mark Siggers , Norihide Tokushige

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

群论 · 数学 2015-10-19 Timothy C. Burness , Hung P. Tong-Viet

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

群论 · 数学 2020-07-23 Nicolas Radu

A family of sets is $s$-intersecting if every pair of its sets has at least $s$ elements in common. It is an $s$-star if all its members have some $s$ elements in common. A family of sets is called $s$-EKR if all its $s$-intersecting…

组合数学 · 数学 2025-04-09 Neal Bushaw , James Danielsson , Glenn Hurlbert

Let $A$ be a graded complete intersection over a field and $B$ the monomial complete intersection with the generators of the same degrees as $A$. The EGH conjecture says that if $I$ is a graded ideal in $A$, then there should be an ideal…

交换代数 · 数学 2016-01-27 Tadahito Harima , Akihito Wachi , Junzo Watanabe

Given a finite transitive group $G\leq \operatorname{Sym}{\Omega}$, the {intersection density} of $G$ is defined as the ratio between the size of the largest subsets of $G$ in which any two permutations agree on at least one element of…

We prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…

概率论 · 数学 2020-10-27 Zijie Zhuang

A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…

组合数学 · 数学 2024-08-26 David Galvin , Yufei Zhang

Let $G$ be a finite group and let $k$ be an algebraically closed field of characteristic $2$ and let $M$ be an indecomposable $kG$-module which affords a non-degenerate $G$-invariant symmetric bilinear form. We introduce the symmetric…

表示论 · 数学 2016-04-21 John C. Murray

In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…

群论 · 数学 2023-10-20 Angsuman Das , Arnab Mandal

We consider the Siegel modular variety of genus 2 and a p-integral model of it for a good prime p>2, which parametrizes principally polarized abelian varieties of dimension two with a level structure. We consider cycles on this model which…

alg-geom · 数学 2007-05-23 S. Kudla , M. Rapoport

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

组合数学 · 数学 2019-11-13 Heather A. Newman , Hector Miranda , Darren A. Narayan

In this paper, we prove a criterion of elementary equivalence of stable linear groups over fields of characteristic two.

群论 · 数学 2023-01-16 Elena Bunina , Alexander Mikhalev , Igor Soloviev

The matching number of a $k$-graph is the maximum number of pairwise disjoint edges in it. The $k$-graph is called $t$-resilient if omitting $t$ vertices never decreases its matching number. The complete $k$-graph on $sk+k-1$ vertices has…

组合数学 · 数学 2025-03-12 Peter Frankl , Jian Wang

More than $30$ years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive $2$-design, with blocks of size $k$, could leave invariant a nontrivial point-partition, but only if the number of points was bounded…

组合数学 · 数学 2023-08-25 Carmen Amarra , Alice Devillers , Cheryl E. Praeger

Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A vertex…

组合数学 · 数学 2023-10-09 Subhabrata Paul , Kamal Santra

Let $G$ be a permutation group on a finite set $\Omega$. The $k$-closure $G^{(k)}$ of the group $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ having the same orbits as $G$ on the $k$-th Cartesian power $\Omega^k$ of $\Omega$.…

群论 · 数学 2019-09-13 Andrey V. Vasil'ev , Dmitry Churikov

In this paper, we provide a combinatorial characterization of those collections of cells whose inner $2$-minor ideals are complete intersections. More precisely, given a collection of cells $\mathcal C$ and its associated inner $2$-minor…

交换代数 · 数学 2026-03-24 Rodica Dinu , Francesco Navarra

We give a group theoretic proof of the splitting of sharply 2-transitive groups of characteristic 3.

群论 · 数学 2008-09-08 Seyfi Turkelli