UB Paderborn / Katalog / Suche / in CDI

Discrimination in a General Algebraic Setting

TheScientificWorld, 2015, Vol.2015, p.824268-9

2015

Link zum Volltext

Verfügbarkeit prüfen

On Turner's theorem and first-order theory

Communications in algebra, 2017-01, Vol.45 (1), p.29-46

2017

Link zum Volltext

Verfügbarkeit prüfen

Baumslag's big powers in metabelian groups

Journal of group theory, 2013-05, Vol.16 (3), p.445-460

2013

Link zum Volltext

Verfügbarkeit prüfen

The Relatively Free Groups F ( N c ∧ A 2 ) Satisfy Noncentral Commutative Transitivity

Algebra (Hindawi), 2014-10, Vol.2014, p.1-12

2014

Link zum Volltext

Verfügbarkeit prüfen

A loopless implementation of a gray code for signed permutations

Publications de l'Institut mathématique (Belgrade), 2011, Vol.89 (103), p.37-47

2011

Link zum Volltext

Verfügbarkeit prüfen

Almost Locally Free Groups and a Theorem of Magnus: Some Questions

Groups, complexity, cryptology, 2009-10, Vol.1 (2), p.181-198

2009

Link zum Volltext

Verfügbarkeit prüfen

Note on a question of Reinhold Baer on pregroups II

Publications de l'Institut mathématique (Belgrade), 2012, Vol.92 (106), p.109-115

2012

Link zum Volltext

Verfügbarkeit prüfen

An Extension of Greendlinger's Results on the Word Problem

Proceedings of the American Mathematical Society, 1964, Vol.15 (1), p.37-43

Lipschutz, Seymour

1964

Link zum Volltext

Verfügbarkeit prüfen

Note on Infinite Families of Trivalent Semisymmetric Graphs

European journal of combinatorics, 2002-08, Vol.23 (6), p.707-711

2002

Link zum Volltext

Verfügbarkeit prüfen

Note on Gray codes for permutation lists

Publications de l'Institut mathématique (Belgrade), 2005, Vol.78 (92), p.87-92

2005

Link zum Volltext

Verfügbarkeit prüfen

Loopless Algorithms And SchrÖder Trees

International journal of computer mathematics, 2003-06, Vol.80 (6), p.709-725

2003

Link zum Volltext

Verfügbarkeit prüfen

Shifts and loopless generation of k-ary trees

Information processing letters, 1998-03, Vol.65 (5), p.235-240

1998

Link zum Volltext

Verfügbarkeit prüfen

Generating Multiset Permutations in Constant Time

Journal of algorithms, 1997-11, Vol.25 (2), p.321-335

1997

Link zum Volltext

Verfügbarkeit prüfen

On powers, conjugacy classes and small-cancellation groups

Conference on Group Theory, 2006, p.126-132

Lipschutz, Seymour

2006

Link zum Volltext

Verfügbarkeit prüfen

Revisiting matrix representations of the braid group

Linear & multilinear algebra, 1987-06, Vol.21 (2), p.163-172

Lipschutz, Seymour

1987

Link zum Volltext

Verfügbarkeit prüfen

Note on Graphs and Matrix Inequalities

The American mathematical monthly, 1985-04, Vol.92 (4), p.277-280

Lipschutz, Seymour

1985

Link zum Volltext

Verfügbarkeit prüfen

On Weighted Geodesics in Groups

Canadian mathematical bulletin, 1987-03, Vol.30 (1), p.86-91

Lipschutz, Seymour

1987

Link zum Volltext

Verfügbarkeit prüfen

Note on Graphs and Matrix Inequalities

The American mathematical monthly, 1985-04, Vol.92 (4), p.277

Lipschutz, Seymour

1985

Link zum Volltext

Verfügbarkeit prüfen

On Embeddable Prees

Journal of algebra, 1993-09, Vol.160 (1), p.1-15

1993

Link zum Volltext

Verfügbarkeit prüfen

On the Conjugacy Problem and Greendlinger's Eighth-Groups

Proceedings of the American Mathematical Society, 1969-10, Vol.23 (1), p.101

Lipschutz, Seymour

1969

Link zum Volltext

Verfügbarkeit prüfen

Generalization of Dehn's Result on the Conjugacy Problem

Proceedings of the American Mathematical Society, 1966, Vol.17 (3), p.759-762

Lipschutz, Seymour

1966

Link zum Volltext

Verfügbarkeit prüfen

Groups with solvable conjugacy problems

Illinois journal of mathematics, 1980-01, Vol.24 (2)

Lipschutz, Seymour

1980

Link zum Volltext

Verfügbarkeit prüfen

A generalization of Stallings' pregroup

Journal of algebra, 1988-11, Vol.119 (1), p.170-184

1988

Link zum Volltext

Verfügbarkeit prüfen

An Extension of Greendlinger's Results on the Word Problem

Proceedings of the American Mathematical Society, 1964-02, Vol.15 (1), p.37

Lipschutz, Seymour

1964

Link zum Volltext

Verfügbarkeit prüfen

Note on a Paper by Shepperd on the Braid Group

Proceedings of the American Mathematical Society, 1963, Vol.14 (2), p.225-227

Lipschutz, Seymour

1963

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

Discrimination in a General Algebraic Setting

On Turner's theorem and first-order theory

Baumslag's big powers in metabelian groups

The Relatively Free Groups F ( N c ∧ A 2 ) Satisfy Noncentral Commutative Transitivity

A loopless implementation of a gray code for signed permutations

Almost Locally Free Groups and a Theorem of Magnus: Some Questions

Note on a question of Reinhold Baer on pregroups II

An Extension of Greendlinger's Results on the Word Problem

Note on Infinite Families of Trivalent Semisymmetric Graphs

Note on Gray codes for permutation lists

Loopless Algorithms And SchrÖder Trees

Shifts and loopless generation of k-ary trees

Generating Multiset Permutations in Constant Time

On powers, conjugacy classes and small-cancellation groups

Revisiting matrix representations of the braid group

Note on Graphs and Matrix Inequalities

On Weighted Geodesics in Groups

Note on Graphs and Matrix Inequalities

On Embeddable Prees

On the Conjugacy Problem and Greendlinger's Eighth-Groups

Generalization of Dehn's Result on the Conjugacy Problem

Groups with solvable conjugacy problems

A generalization of Stallings' pregroup

An Extension of Greendlinger's Results on the Word Problem

Note on a Paper by Shepperd on the Braid Group

Suchergebnisse filtern