Results 11 to 20 of about 361 (51)
An approach to Quillen’s conjecture via centralisers of simple groups
Forum of Mathematics, Sigma, 2021 For any given subgroup H of a finite group G, the Quillen poset ${\mathcal {A}}_p(G)$ of nontrivial elementary abelian p-subgroups is obtained from ${\mathcal {A}}_p(H)$ by attaching elements via their centralisers in H.
Kevin Iván Piterman
doaj +1 more source
Dynamics of plane partitions: Proof of the Cameron–Fon-Der-Flaass conjecture
Forum of Mathematics, Sigma, 2020 One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conjecture of P. Cameron and D. Fon-Der-Flaass (1995): consider a plane partition P in an $a \times b \times c$ box ${\sf B}$ . Let $\Psi (P)$
Rebecca Patrias, Oliver Pechenik
doaj +1 more source
Symmetric Bipartite Graphs and Graphs with Loops [PDF]
, 2014 We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges its two parts.
Cairns, Grant, Mendan, Stacey
core +3 more sources
Antichains and counterpoint dichotomies [PDF]
, 2012 We construct a special type of antichain (i. e., a family of subsets of a set, such that no subset is contained in another) using group-theoretical considerations, and obtain an upper bound on the cardinality of such an antichain.
Agustín-Aquino, Octavio A.
core +3 more sources
A note on non-reduced reflection factorizations of Coxeter elements [PDF]
, 2019 We extend a result of Lewis and Reiner from finite Coxeter groups to all Coxeter groups by showing that two reflection factorizations of a Coxeter element lie in the same Hurwitz orbit if and only if they share the same multiset of conjugacy classes ...
Wegener, Patrick, Yahiatene, Sophiane
core +3 more sources
Elusive Codes in Hamming Graphs [PDF]
, 2012 We consider a code to be a subset of the vertex set of a Hamming graph. We examine elusive pairs, code-group pairs where the code is not determined by knowledge of its set of neighbours.
Gillespie, Neil I. +2 more
core +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
THE EXPECTED JAGGEDNESS OF ORDER IDEALS
Forum of Mathematics, Sigma, 2017 The jaggedness of an order ideal $I$ in a poset $P$ is the
MELODY CHAN +3 more
doaj +1 more source
On the $\operatorname{rix}$ statistic and valley-hopping [PDF]
Discrete Mathematics & Theoretical Computer ScienceThis paper studies the relationship between the modified Foata$\unicode{x2013}$Strehl action (a.k.a. valley-hopping)$\unicode{x2014}$a group action on permutations used to demonstrate the $\gamma$-positivity of the Eulerian polynomials$\unicode{x2014 ...
Nadia Lafrenière, Yan Zhuang
doaj +1 more source
Abelian Carter subgroups in finite permutation groups
, 2013 We show that a finite permutation group containing a regular abelian self-normalizing subgroup is soluble.Comment: 6 ...
Jabara, Enrico, Spiga, Pablo
core +1 more source