Results 201 to 210 of about 974 (238)

Elementary abelian subgroups of classical groups of type $A$ [PDF]

Meizheng Fu
openalex  

Higher Algebraic K-Theory of Causality. [PDF]

Entropy (Basel)
Mahadevan S.
europepmc   +1 more source

Single-Electron Bond in Ir-Ir Dimer Stabilized under Pressure. [PDF]

Inorg Chem
Peng C, Xu M, Li J, Xie W.
europepmc   +1 more source

Unravelling the Holomorphic Twist: Central Charges. [PDF]

Commun Math Phys
Bomans P, Wu J.
europepmc   +1 more source

Fungi as Turing automata with oracles. [PDF]

R Soc Open Sci
Schumann A, Adamatzky A, Król J, Goles E.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Interlacing of elementary abelian groups

Mathematical Notes of the Academy of Sciences of the USSR, 1972
A lattice of characteristic subgroups of multiple interlacings of finite elementary abelian groups by itself is established herein.
openaire   +2 more sources

Groups with elementary Abelian centralizers of involutions

Algebra and Logic, 2007
Summary: An involution \(i\) of a group \(G\) is said to be almost perfect in \(G\) if any two involutions of \(i^G\) the order of the product of which is infinite are conjugated via a suitable involution in \(i^G\). We generalize a known result by Brauer, Suzuki, and Wall concerning the structure of finite groups with elementary Abelian centralizers ...
Sozutov, A. I., Kryukovskiĭ, A. S.
openaire   +2 more sources

Units in regular elementary abelian group rings

Archiv der Mathematik, 1986
Let A be a finite abelian group, let \(U^.(A)\) be the group of units of \({\mathbb{Z}}A\) modulo torsion and let \({\dot \alpha}\): \(\prod_{C}U^.(C)\to U^.(A)\) be the natural homomorphism, where the product is direct and C runs over all cyclic subgroups \(\neq 1\) of A. In this note the authors prove the following result. Theorem.
Hoechsmann, Klaus, Sehgal, Sudarshan K.
openaire   +1 more source

Elementary Abelian Cartesian Groups Cartesian Groups

Canadian Journal of Mathematics, 1988
Throughout the paper, G will denote an additively written, but not always abelian, group of finite order n; and X = (xij) will denote a square matrix of order n with entries from G and whose rows and columns are numbered 0, 1, …, n − 1. We call X a cartesian array (afforded by G) if(1.1) The sequence {−xmi + xki, i = 0,…, n – 1} contains all elements ...
openaire   +1 more source