For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to supersolvable hyperplane arrangements.

Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).

Let σ be a permutation of the set {1,2, — -, n} and let Π(N) denote the lattice of partitions of {1,2, •••,%}. There is an obvious induced action of σ on Π(N); let Π(N)σ — L denote the lattice of partitions fixed by σ. The structure of L is analyzed with particular attention paid to ^f, the meet sublattice of L consisting of 1 together with all elements of L which are meets of coatoms of L. It ...

Stanley [18] introduced the notion of a supersolvable lattice, L, in part to combinatorially explain the factorization of its characteristic polynomial over the integers when L is also semimodular. He did this by showing that the roots of the polynomial count certain sets of atoms of the lattice. In the present work we define an object called an atom decision tree. The class of semimodular latt...

Let L be a supersolvable lattice with nonzero Möbius function. We show that the order complex of any rank-selected subposet of L admits a convex-ear decomposition. This proves many new inequalities for the h-vectors of such complexes, and shows that their g-vectors are M-

Abstract Let p be a prime and let G finite group such that the smallest divides | is . We find sharp bounds, depending on , for commuting probability average character degree to guarantee nilpotent or supersolvable.

A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...

For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NS...