Results 31 to 40 of about 344,627 (72)

Supersolvable posets and fiber-type abelian arrangements

Selecta Mathematica
AbstractWe present a combinatorial analysis of fiber bundles of generalized configuration spaces on connected abelian Lie groups. These bundles are akin to those of Fadell–Neuwirth for configuration spaces, and their existence is detected by a combinatorial property of an associated finite partially ordered set.
Bibby, Christin, Delucchi, Emanuele
openaire   +3 more sources

The Orlik-Solomon algebra and the supersolvable class of arrangements

International Journal of Algebra, 2014
According to the powerful geometric properties of the hypersolvable order on the hyperplanes of a supersolvable arrangement, we introduced a sufficient condition on the Orlik-Solomon algebra for any central arrangement to have supersolvable analogue and we showed this condition as a necessary condition (not sufficient) on the Orlik-Solomon algebra for ...
openaire   +1 more source

Nilpotent by Supersolvable M-Groups

, 1985
A character of a finite group G is monomial if it is induced from a linear (degree one) character of a subgroup of G. A group G is an M-group if all its complex irreducible characters (the set Irr(G)) are monomial.In [1], Dade gave an example of an M ...
Alan E. Parks
core   +1 more source

Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements

European Journal of Combinatorics
For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge between any two vertices whose corresponding regions are separated by a single hyperplane from $\mathcal{H}$.
Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze   +4 more
openaire   +4 more sources

Coprime actions with supersolvable fixed-point groups

, 2018
Let A be an elementary abelian r-group acting on a finite r ′
Hangyang Meng, Xiuyun Guo
core   +1 more source

Optimal arrangement of data in a tree directory [PDF]

, 2001
We define the decision problem {\textsc {data arrangement}}, which involves arranging the vertices of a graph $G$ at the leaves of a $d$-ary tree so that a weighted sum of the distances between pairs of vertices measured with respect to the tree ...
Noble, S. D., Luczak, M J, Noble, S.D., Luczak, M.J., Luczak, Malwina J., Noble, S D, M.J. Luczak, S.D. Noble   +7 more
core   +1 more source

Hamiltonian Cycles in Simplicial and Supersolvable Hyperplane Arrangements

Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable arrangements. We confirm Hamiltonicity for all 3-dimensional simplicial arrangements listed in the Grünbaum--Cuntz ...
Körber, Veronika, Schnieders, Tobias, Stricker, Jan, Walizadeh, Jasmin   +3 more
openaire   +2 more sources

A Generalization of Semimodular Supersolvable Lattices

, 1999
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.
Bruce E. Sagan, Curtis Bennett
core  

A survey of the number of supersolvable subgroups of finite groups

, 2022
In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups.
Acosta-Humánez, Primitivo B., Liriano, Orieta, Mora-Ferreras, Francis   +2 more
core  

Supersolvable saturated matroids and chordal graphs

, 2023
A matroid is supersolvable if it has a maximal chain of flats each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolvable saturated matroids as analogues to chordal graphs, and we show that ...
Probert, Andrew, Mayhew, Dillon
core