A Strengthened Freiheitssatz
نویسندگان
چکیده
منابع مشابه
Free Algebras and the Freiheitssatz
We prove the Freiheitssatz for free associative algebras over any field. This extends the previous result of Marker-Limanov and immediately implies the Freiheitssatz for free restricted Lie algebras and free Lie algebras. We prove the Freiheitssatz for free Poisson algebras over a field of characteristic zero. This answers a question of MarkerLimanov and Umirbaev in the affirmative.
متن کاملThe Freiheitssatz and the Automorphisms of Free Right-symmetric Algebras
We prove the Freiheitssatz for right-symmetric algebras and the decidability of the word problem for right-symmetric algebras with a single defining relation. We also prove that two generated subalgebras of free right-symmetric algebras are free and automorphisms of two generated free right-symmetric algebras are tame. Mathematics Subject Classification (2000): Primary 17A36, 17A50; Secondary 1...
متن کاملOn asphericity and the Freiheitssatz for certain (nitely presented groups
The classical results of Magnus on one-relator groups (such as the Freiheitssatz and the solvability of the generalized word problem for Magnus subgroups) are generalized to some (nitely presented groups whose relators are constructed inductively. The diagrammatic asphericity of such group presentations is also proven. c © 2001 Elsevier Science B.V. All rights reserved. MSC: Primary 20F05; 20F0...
متن کاملOn a strengthened Hardy-Hilbert type inequality
*Correspondence: [email protected] 2Department of Construction and Information Engineering, Guangxi Modern Vocational Technology College, Hechi, Guangxi 547000, China Full list of author information is available at the end of the article Abstract We derive a strengthenment of a Hardy-Hilbert type inequality by using the Euler-Maclaurin expansion for the zeta function and estimating the weight...
متن کاملRIPEMD-160: A Strengthened Version of RIPEMD
Cryptographic hash functions are an important tool in cryptography for applications such as digital fingerprinting of messages, message authentication, and key derivation. During the last five years, several fast software hash functions have been proposed; most of them are based on the design principles of Ron Rivest’s MD4. One such proposal was RIPEMD, which was developed in the framework of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 2010
ISSN: 0019-2082
DOI: 10.1215/ijm/1299679736