Results 41 to 50 of about 283,373 (79)
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. +7 more
core +1 more source
Supersolvable descent for rational points
International audienceWe construct an analogue of the classical descent theory of Colliot-Thélène and Sansuc in which algebraic tori are replaced with finite supersolvable groups.
Harpaz, Yonatan, Wittenberg, Olivier
core +1 more source
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
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
Supersolvable saturated matroids and chordal graphs [PDF]
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, A., Mayhew, D.
core +1 more source
List Decoding Group Homomorphisms Between Supersolvable Groups [PDF]
, 2014 We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al. (Proc. STOC 2008) who studied the case where the groups are abelian. Moreover,
Guo, Alan +3 more
core +1 more source
CONSTRUCTION OF TRANSITIVE SUPERSOLVABLE PERMUTATION GROUPS [PDF]
, 2018 In this paper, we used wreath products of two permutation groups in constructing transitive supersolvable permutation groups. We verified these groups using some groups theoretical concepts and also validate our work using a standard program; GAP ...
Musa, Sani +3 more
core
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
On the Cohen-Macaulay connectivity of supersolvable lattices and the homotopy type of posets [PDF]
, 1995 It is a well known fact that a supersolvable lattice is EL-shellable. Hence a supersolvable lattice (resp., its Stanley-Reisner ring) is Cohen-Macaulay.
Welker, Volkmar
core +1 more source
Computing irreducible representations of supersolvable groups
, 1994 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 O ( n 2
Ulrich Baum, Michael Clausen
core +1 more source