Results 1  10
of
163
Frobenius groups of automorphisms and their xed points
"... Suppose that a finite group G admits a Frobenius group of automorphisms FH with kernel F and complement H such that the fixedpoint subgroup of F is trivial: CG(F) = 1. In this situation various properties of G are shown to be close to the corresponding properties of CG(H). By using Clifford’s theo ..."
Abstract
 Add to MetaCart
. The exponent of G is bounded in terms of FH  and the exponent of CG(H) by using Lazard’s Lie algebra associated with the Jennings–Zassenhaus filtration and its connection with powerful subgroups. The nilpotency class of G is bounded in terms of H  and the nilpotency class of CG(H) by considering Lie rings
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up ..."
Abstract
 Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up
Communications in Algebra, (), 1–15 (2001) Finite
"... subnormal coverings of certain solvable groups ..."
3 USING DOPERATORS TO CONSTRUCT ORTHOGONAL POLYNOMIALS SATISFYING HIGHER ORDER qDIFFERENCE EQUATIONS
"... ar ..."
RG is nil implies R is nil“ is equivalent to the “Koethe conjecture
 Houston J. Math
, 1983
"... ABSTRACT. Suppose that G is a finite group of automorphisms of an associative ring Rwhich has no additive IGltorsion and R G denotes the fixed subring of R. THEOREM. The implication "R G is nil implies that R is nil " is logically equivalent to the "Koethe Conjecture." õ 1. Let ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. It should be noted that some restriction on [GI is necessary for Bergman [2] has an example with R G = 0 yet R is not nil. In [3] Kharchenko pr ved the converse under the more stringent restrictions that R is an ideal of an algebra K (with unity) over a field which satisfies t(K)K = K. The restriction
Chapter 1 Stabilization and Control over Gaussian Networks
"... Abstract We provide an overview and some recent results on realtime communication and control over Gaussian channels. In particular, the problem of remote stabilization of linear systems driven by Gaussian noise over Gaussian relay channels is considered. Necessary and sufficient conditions for mea ..."
Abstract
 Add to MetaCart
Abstract We provide an overview and some recent results on realtime communication and control over Gaussian channels. In particular, the problem of remote stabilization of linear systems driven by Gaussian noise over Gaussian relay channels is considered. Necessary and sufficient conditions
und Computeralgebra (CDC) Algebraic methods in analyzing lightweight cryptographic symmetric primitives
"... Algebraic methods in analyzing ..."
Elliptic Curves over Q
, 2005
"... All polynomials and rational functions in this essay are assumed to have coefficients in Q. Fix an integer n ≥ 1. An affine variety is a simultaneous irreducible system of polynomial equations in n variables. The Qpoints, Rpoints and Cpoints of the affine variety are all solutions of the polynomi ..."
Abstract
 Add to MetaCart
+ f =0 is expressed in homogeneous coordinates as aX 2 + bXY + cY 2 + dXZ + eY Z + fZ 2 =0; irreducibility implies smoothness in this case. Triples (X, Y, Z) satisfying this equation with Z = 0 are called points at infinity. Let F denote a smooth projective curve and F (C)denotetheCpoints of F
Results 1  10
of
163