Results 41 to 50 of about 344,627 (73)
Wake-induced transverse vibration of two interfering cylinders in tandem arrangement : modelling and analysis [PDF]
, 2013 This paper discusses wake-induced transverse vibration of two interfering cylinders in tandem ...
Armin, Milad, Srinil, Narakorn
core +3 more sources
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
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
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. +7 more
core +1 more source
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. +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
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
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