中文
相关论文

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

200 篇论文

We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.

组合数学 · 数学 2026-02-11 Jan Kurkofka , Tim Planken

Let $V$ be a left $R$-module where $R$ is a (not necessarily commutative) ring with unit. The intersection graph $\cG(V)$ of proper $R$-submodules of $V$ is an undirected graph without loops and multiple edges defined as follows: the vertex…

环与代数 · 数学 2013-02-20 Ergün Yaraneri

A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…

组合数学 · 数学 2012-08-14 Michael D. Barrus

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

组合数学 · 数学 2021-12-07 G. Arunkumar , Peter J. Cameron , Rajat Kanti Nath , Lavanya Selvaganesh

The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…

概率论 · 数学 2019-10-23 Remco van der Hofstad , Júlia Komjáthy , Viktória Vadon

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

组合数学 · 数学 2019-01-03 Michael Giudici , Gabriel Verret

Let $\mathcal A\subset\mathbb P^{k-1}$ be a rank $k$ arrangement of $n$ hyperplanes, with the property that any $k$ of the defining linear forms are linearly independent (i.e., $\mathcal A$ is called $k-$generic). We show that for any…

代数几何 · 数学 2016-01-27 Stefan Tohaneanu

Let X be a smooth projective curve of genus g bigger then 2. For any vector bundle E on X let M_k(E) be the scheme of all rank k subbundles of E with maximal degree. For every integers r, k and x with 0<k<r, x positive and either x less…

代数几何 · 数学 2007-05-23 E. Ballico , B. Russo

The famous Burnside-Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2-transitive or isomorphic to a subgroup of a 1-dimensional affine group of prime degree. It is known that…

群论 · 数学 2007-05-23 Sergei Evdokimov , Ilia Ponomarenko

Using a characterization of parabolics in reductive Lie groups due to Furstenberg, elementary properties of buildings, and some algebraic topology, we give a new proof of Tits' classification of 2-transitive Lie groups.

微分几何 · 数学 2007-05-23 Linus Kramer

We demonstrate that superconductivity driven by strong quantum-critical fluctuations can emerge near relativistic Mott transitions in twisted two-dimensional materials, taking on a remarkably rich character. In twisted double-bilayer…

强关联电子 · 物理学 2025-10-09 Veronika C. Stangier , Mathias S. Scheurer , Daniel E. Sheehy , Jörg Schmalian

By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…

表示论 · 数学 2007-05-23 Mark Wildon

In this paper, I construct noncompact analogs of the Chern classes of equivariant vector bundles over complex reductive groups. For the tangent bundle, these Chern classes yield an adjunction formula for the Euler characteristic of complete…

代数几何 · 数学 2007-05-23 Valentina Kiritchenko

A collection of sets is {\em intersecting} if every two members have nonempty intersection. We describe the structure of intersecting families of $r$-sets of an $n$-set whose size is quite a bit smaller than the maximum ${n-1 \choose r-1}$…

组合数学 · 数学 2016-02-08 Alexandr Kostochka , Dhruv Mubayi

Define an embedding of graph $G=(V,E)$ with $V$ a finite set of distinct points on the unit circle and $E$ the set of line segments connecting the points. Let $V_1,\ldots,V_k$ be a labeled partition of $V$ into equal parts. A 2-factor is…

组合数学 · 数学 2014-05-06 Drew J. Lipman

A set partition is $c$-uniform if every block has size $c$. Two families of $c$-uniform partitions of a finite set are said to be cross $t$-intersecting if two partitions from different families share at least $t$ blocks. In this paper, we…

组合数学 · 数学 2025-09-30 Tian Yao , Mengyu Cao , Haixiang Zhang

A set $A$ $t$-intersects a set $B$ if $A$ and $B$ have at least $t$ common elements. Families $\mathcal{A}_1, \mathcal{A}_2, \dots, \mathcal{A}_k$ of sets are cross-$t$-intersecting if, for every $i$ and $j$ in $\{1, 2, \dots, k\}$ with $i…

组合数学 · 数学 2018-05-15 Peter Borg

We prove that the completely irregular set is Baire generic for every non-uniquely ergodic transitive continuous map which satisfies the shadowing property and acts on a compact metric space without isolated points. We also show that, under…

动力系统 · 数学 2023-07-20 Maria Carvalho , Vinícius Coelho , Luciana Salgado

For any positive integers $k,r,n$ with $r \leq \min\{k,n\}$, let $\mathcal{P}_{k,r,n}$ be the family of all sets $\{(x_1,y_1), \dots, (x_r,y_r)\}$ such that $x_1, \dots, x_r$ are distinct elements of $[k] = \{1, \dots, k\}$ and $y_1, \dots,…

组合数学 · 数学 2014-03-11 Peter Borg , Karen Meagher

In this note, we prove that a finite vertex-transitive graph which has a clique which intersects all maximal cliques is a complete graph. This gives a positive answer in the case of vertex-transitive graphs to a question raised by Berge and…

组合数学 · 数学 2018-02-28 Etienne Fieux , Bertrand Jouve