scholarly journals Computing nilpotent quotients in finitely presented Lie rings

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Csaba Schneider
Keyword(s):  
Abelian Group ◽  
Word Problem ◽  
Np Hard ◽  
Linear Combinations ◽  
Lie Ring ◽  
Lie Rings ◽  
Central Factor ◽  
Structure Theorems ◽  
International Audience ◽  
Finitely Presented

International audience A nilpotent quotient algorithm for finitely presented Lie rings over \textbfZ (and \textbfQ) is described. The paper studies the graded and non-graded cases separately. The algorithm computes the so-called nilpotent presentation for a finitely presented, nilpotent Lie ring. A nilpotent presentation consists of generators for the abelian group and the products expressed as linear combinations for pairs formed by generators. Using that presentation the word problem is decidable in L. Provided that the Lie ring L is graded, it is possible to determine the canonical presentation for a lower central factor of L. Complexity is studied and it is shown that optimising the presentation is NP-hard. Computational details are provided with examples, timing and some structure theorems obtained from computations. Implementation in C and GAP interface are available.

Derivations of differentially semiprime rings

2019 ◽  
Vol 12 (05) ◽  
pp. 1950079
Author(s):  
Ahmad Al Khalaf ◽  
Iman Taha ◽  
Orest D. Artemovych ◽  
Abdullah Aljouiiee
Keyword(s):  
Commutative Ring ◽  
Semiprime Ring ◽  
Prime Rings ◽  
Commutative Case ◽  
Lie Ring ◽  
Lie Rings ◽  
Semiprime Rings ◽  
Torsion Free

Earlier D. A. Jordan, C. R. Jordan and D. S. Passman have investigated the properties of Lie rings Der [Formula: see text] of derivations in a commutative differentially prime rings [Formula: see text]. We study Lie rings Der [Formula: see text] in the non-commutative case and prove that if [Formula: see text] is a [Formula: see text]-torsion-free [Formula: see text]-semiprime ring, then [Formula: see text] is a semiprime Lie ring or [Formula: see text] is a commutative ring.

A. A. Fridman. Stépéni nérazréšimosti problémy toždéstva v konéčno oprédélénnyh gruppah. Doklady Akadémii Nauk SSSR, vol. 147 (1962), pp. 805–808. - A. A. Fridman. Degrees of insolvability of the word problem in finitely defined groups. English translation of the preceding by Sue Ann Walker. Soviet mathematics, vol. 3 no. 6 (1962), pp. 1733–1737. - C. R. J. Clapham. Finitely presented groups with word problems of arbitrary degrees of insolubility. Proceedings of the London Mathematical Society, ser. 3 vol. 14 (1964), pp. 633–676. - William W. Boone. Finitely presented group whose word problem has the same degree as that of an arbitrarily given Thue system (an application of methods of Britton). Proceedings of the National Academy of Sciences, vol. 53 (1965), pp. 265–269. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems. Annals of mathematics, ser. 2 vol. 83 (1966), pp. 520–571. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups. Annals of mathematics, ser. 2 vol. 84 (1966), pp. 49–84.

1968 ◽  
Vol 33 (2) ◽  
pp. 296-297
Author(s):  
J. C. Shepherdson
Keyword(s):  
Word Problem ◽  
Word Problems ◽  
Nauk Sssr ◽  
London Mathematical Society ◽  
National Academy Of Sciences ◽  
Doklady Akademii Nauk Sssr ◽  
Finitely Presented Groups ◽  
Recursively Enumerable ◽  
Finitely Presented ◽  
Degrees Of Unsolvability

scholarly journals RATIONAL POLYHEDRA AND PROJECTIVE LATTICE-ORDERED ABELIAN GROUPS WITH ORDER UNIT

2012 ◽  
Vol 14 (03) ◽  
pp. 1250017 ◽  
Author(s):  
LEONARDO CABRER ◽  
DANIELE MUNDICI
Keyword(s):  
Abelian Group ◽  
Algebraic Topology ◽  
Lattice Structure ◽  
Order Unit ◽  
Finitely Generated ◽  
Lattice Order ◽  
Translation Invariant ◽  
Projective Lattice ◽  
Rational Polyhedra ◽  
Finitely Presented

An ℓ-groupG is an abelian group equipped with a translation invariant lattice-order. Baker and Beynon proved that G is finitely generated projective if and only if it is finitely presented. A unital ℓ-group is an ℓ-group G with a distinguished order unit, i.e. an element 0 ≤ u ∈ G whose positive integer multiples eventually dominate every element of G. Unital ℓ-homomorphisms between unital ℓ-groups are group homomorphisms that also preserve the order unit and the lattice structure. A unital ℓ-group (G, u) is projective if whenever ψ : (A, a) → (B, b) is a surjective unital ℓ-homomorphism and ϕ : (G, u) → (B, b) is a unital ℓ-homomorphism, there is a unital ℓ-homomorphism θ : (G, u) → (A, a) such that ϕ = ψ ◦ θ. While every finitely generated projective unital ℓ-group is finitely presented, the converse does not hold in general. Classical algebraic topology (à la Whitehead) is combined in this paper with the Włodarczyk–Morelli solution of the weak Oda conjecture for toric varieties, to describe finitely generated projective unital ℓ-groups.

scholarly journals Taming the hydra: The word problem and extreme integer compression

2018 ◽  
Vol 28 (07) ◽  
pp. 1299-1381
Author(s):  
W. Dison ◽  
E. Einstein ◽  
T. R. Riley
Keyword(s):  
Word Problem ◽  
Polynomial Time ◽  
Complexity Measure ◽  
Dehn Function ◽  
Dehn Functions ◽  
Fast Growing ◽  
Defining Relations ◽  
Finitely Presented Group ◽  
Direct Attack ◽  
Finitely Presented

For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by applying the defining relations. Dison and Riley showed that a “hydra phenomenon” gives rise to novel groups with extremely fast growing (Ackermannian) Dehn functions. Here, we show that nevertheless, there are efficient (polynomial time) solutions to the word problems of these groups. Our main innovation is a means of computing efficiently with enormous integers which are represented in compressed forms by strings of Ackermann functions.

THE 2-GENERATOR RESTRICTED BURNSIDE GROUP OF EXPONENT 7

2002 ◽  
Vol 12 (04) ◽  
pp. 575-592 ◽  
Author(s):  
E. A. O'BRIEN ◽  
MICHAEL VAUGHAN-LEE
Keyword(s):  
Nilpotency Class ◽  
Lie Ring ◽  
Derived Length ◽  
Lie Rings ◽  
Associated Lie Ring

We report on our construction of a power-commutator presentation for R(2,7), the largest finite 2-generator group of exponent 7. Our calculations show that R(2,7) has order 720416, nilpotency class 28, and derived length 5. The calculations also imply that the associated Lie ring of R(2,7) satisfies relations which are not consequences of the multilinear identities which hold in the associated Lie rings of groups of exponent 7.

scholarly journals Metabelian groups with the same finite quotients

1974 ◽  
Vol 11 (1) ◽  
pp. 115-120 ◽  
Author(s):  
P.F. Pickel
Keyword(s):  
Abelian Group ◽  
Finite Abelian Group ◽  
Metabelian Group ◽  
Metabelian Groups ◽  
Isomorphism Classes ◽  
Split Extensions ◽  
Finite Quotients ◽  
Finitely Presented

Let F(G) denote the set of isomorphism classes of finite quotients of the group G. Two groups G and H are said to have the same finite quotients if F(G) = F(H). We construct infinitely many nonisomorphic finitely presented metabelian groups with the same finite quotients, using modules over a suitably chosen ring. These groups also give an example of infinitely many nonisomorphic split extensions of a fixed finitely presented metabelian group by a fixed finite abelian group, all having the same finite quotients.

Rings with simple Lie rings of Lie and Jordan derivations

2018 ◽  
Vol 17 (04) ◽  
pp. 1850078
Author(s):  
Ahmad Al Khalaf ◽  
Orest D. Artemovych ◽  
Iman Taha
Keyword(s):  
Noetherian Ring ◽  
Associative Ring ◽  
Lie Ring ◽  
Lie Rings ◽  
Lie Derivations ◽  
Torsion Free

Let [Formula: see text] be an associative ring. We characterize rings [Formula: see text] with simple Lie ring [Formula: see text] of all Lie derivations, reduced noncommutative Noetherian ring [Formula: see text] with the simple Lie ring [Formula: see text] of all derivations and obtain some properties of [Formula: see text]-torsion-free rings [Formula: see text] with the simple Lie ring [Formula: see text] of all Jordan derivations.

Separating Classes of Groups by First-Order Sentences

2003 ◽  
Vol 13 (03) ◽  
pp. 287-302 ◽  
Author(s):  
André Nies
Keyword(s):  
Nilpotent Group ◽  
Word Problem ◽  
Finitely Generated ◽  
Finitely Presented Groups ◽  
First Order ◽  
Solvable Word Problem ◽  
Rank 2 ◽  
Finitely Presented ◽  
Solvable Word

For various proper inclusions of classes of groups [Formula: see text], we obtain a group [Formula: see text] and a first-order sentence φ such that H⊨φ but no G∈ C satisfies φ. The classes we consider include the finite, finitely presented, finitely generated with and without solvable word problem, and all countable groups. For one separation, we give an example of a f.g. group, namely ℤp ≀ ℤ for some prime p, which is the only f.g. group satisfying an appropriate first-order sentence. A further example of such a group, the free step-2 nilpotent group of rank 2, is used to show that true arithmetic Th(ℕ,+,×) can be interpreted in the theory of the class of finitely presented groups and other classes of f.g. groups.

scholarly journals Embeddings into groups with only a few defining relations

1974 ◽  
Vol 18 (1) ◽  
pp. 1-7 ◽  
Author(s):  
W. W. Boone ◽  
D. J. Collins
Keyword(s):  
Word Problem ◽  
Finitely Presented Groups ◽  
Fixed Group ◽  
Defining Relations ◽  
Finitely Presented Group ◽  
One Relator Groups ◽  
Finitely Presented ◽  
Unsolvable Word Problem ◽  
Trivial Consequence

It is a trivial consequence of Magnus' solution to the word problem for one-relator groups [9] and the existence of finitely presented groups with unsolvable word problem [4] that not every finitely presented group can be embedded in a one-relator group. We modify a construction of Aanderaa [1] to show that any finitely presented group can be embedded in a group with twenty-six defining relations. It then follows from the well-known theorem of Higman [7] that there is a fixed group with twenty-six defining relations in which every recursively presented group is embedded.

Sign in / Sign up

Export Citation Format

Share Document