New Combinatorial Properties of Linear Groups
نویسندگان
چکیده
منابع مشابه
Some combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملOn Combinatorial Properties of Linear Program Digraphs
An LP-digraph is a directed graph which consists of the vertices and edges of a polytope P directed by a linear function in general position. It is known that an LP-digraph satisfies three necessary conditions: it is acyclic, each face of P has a unique sink (USO), and the Holt-Klee condition holds. These three conditions are not sufficient in general for a directed graph on P to be an LP-digra...
متن کاملsome combinatorial aspects of finite hamiltonian groups
in this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite hamiltonian group. the coverings with three proper subgroups and the principal series of such a group are also counted. finally, we give a complete description of the lattice of characteristic subgroups of a finite h...
متن کاملLinear Groups and Square Properties in Rings
In [1] a proof was given of Fermat’s Two-Square Theorem using the group theoretical structure of the classical modular group. This has been extended in many directions and to other square properties in general rings. In particular in [2] a two-square theorem was given for the Gaussian integers in terms of when ii is a quadratic residue. In this note we examine and survey this technique and the ...
متن کاملCombinatorial and Arithmetical Properties of Linear Numeration Systems
with digits δl{0, 1} for 0 ≤ l ≤ L, where the digits are computed by the greedy algorithm: there is a unique integer L such that GL ≤ n < GL+1. Then n can be written as n = δLGL + nL with 0 ≤ nL < GL and by iterating this procedure with nL the expansion (1.3) is obtained. An extensive description of digital expansions with respect to linear recurring base sequences is given in [15, 19, 20, 21]....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2001
ISSN: 0021-8693
DOI: 10.1006/jabr.2000.8413