Cargando…
The bounded and precise word problems for presentations of groups /
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and...
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_on1153270295 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 200502t20202020riua ob 000 0 eng d | ||
| 040 | |a CDN |b eng |e rda |e pn |c CDN |d EBLCP |d N$T |d OCLCF |d CUY |d OCLCO |d OCLCQ |d UKAHL |d K6U |d OCLCO |d GZM |d OCLCQ |d OCLCO |d OCLCL |d S9M |d OCLCL | ||
| 020 | |a 9781470458041 |q (electronic bk.) | ||
| 020 | |a 1470458047 |q (electronic bk.) | ||
| 020 | |z 9781470441432 |q (print) | ||
| 020 | |z 1470441438 |q (print) | ||
| 029 | 1 | |a AU@ |b 000069397415 | |
| 035 | |a (OCoLC)1153270295 | ||
| 050 | 4 | |a QA174.2 | |
| 082 | 0 | 4 | |a 512/.2 |2 23 |
| 084 | |a 20F05 |a 20F06 |a 20F10 |a 68Q25 |a 68U05 |a 52B05 |a 20F65 |a 68W30 |2 msc | ||
| 049 | |a UAMI | ||
| 100 | 1 | |a Ivanov, Sergeĭ, |d 1972- |e author. |1 https://id.oclc.org/worldcat/entity/E39PBJyCGWBbwHK9H83TFDJRrq | |
| 245 | 1 | 4 | |a The bounded and precise word problems for presentations of groups / |c S.V. Ivanov. |
| 264 | 1 | |a Providence, RI : |b American Mathematical Society, |c [2020] | |
| 264 | 4 | |c ©2020 | |
| 300 | |a 1 online resource (v, 106 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Memoirs of the American Mathematical Society ; |v number 1281 | |
| 500 | |a "March 2020, volume 264, number 1281 (fourth of 6 numbers)." | ||
| 504 | |a Includes bibliographical references. | ||
| 505 | 0 | |a Cover -- Title page -- Chapter 1. Introduction -- Chapter 2. Preliminaries -- Chapter 3. Proof of Proposition 1.1 -- Chapter 4. Calculus of Brackets for Group Presentation (1.2) -- Chapter 5. Proofs of Theorem 1.2 and Corollary 1.3 -- Chapter 6. Calculus of Brackets for Group Presentation (1.4) -- Chapter 7. Proof of Theorem 1.4 -- Chapter 8. Minimizing Diagrams over (1.2) and Proofs of Theorem 1.5 and Corollary 1.6 -- Chapter 9. Construction of Minimal Diagrams over (1.4) and Proof of Theorem 1.7 -- Chapter 10. Polygonal Curves in the Plane and Proofs of Theorems 1.8, 1.9 and Corollary 1.10 | |
| 520 | |a The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and th. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Presentations of groups (Mathematics) | |
| 650 | 0 | |a Word problems (Mathematics) | |
| 650 | 6 | |a Présentations de groupes (Mathématiques) | |
| 650 | 6 | |a Problèmes des mots (Mathématiques) | |
| 650 | 7 | |a Representaciones de grupos |2 embne | |
| 650 | 0 | 7 | |a Lenguaje y lenguas-Frecuencia de palabras |2 embucm |
| 650 | 7 | |a Presentations of groups (Mathematics) |2 fast | |
| 650 | 7 | |a Word problems (Mathematics) |2 fast | |
| 650 | 7 | |a Group theory and generalizations |x Special aspects of infinite or finite groups |x Generators, relations, and presentations. |2 msc | |
| 650 | 7 | |a Group theory and generalizations |x Special aspects of infinite or finite groups |x Cancellation theory; application of van Kampen diagrams [See also 57M05]. |2 msc | |
| 650 | 7 | |a Group theory and generalizations |x Special aspects of infinite or finite groups |x Word problems, other decision problems, connections with logic and automata [See also 03B25, 03D05, 03D40, 06B25, 08. |2 msc | |
| 650 | 7 | |a Computer science {For papers involving machine computations and programs in a specific mathematical area, see Section |x 04 in that area} |x Theory of computing |x Analysis of algorithms and problem com. |2 msc | |
| 650 | 7 | |a Computer science {For papers involving machine computations and programs in a specific mathematical area, see Section |x 04 in that area} |x Computing methodologies and applications |x Computer graphics. |2 msc | |
| 650 | 7 | |a Convex and discrete geometry |x Polytopes and polyhedra |x Combinatorial properties (number of faces, shortest paths, etc.) [See also 05Cxx]. |2 msc | |
| 650 | 7 | |a Group theory and generalizations |x Special aspects of infinite or finite groups |x Geometric group theory [See also 05C25, 20E08, 57Mxx]. |2 msc | |
| 650 | 7 | |a Computer science {For papers involving machine computations and programs in a specific mathematical area, see Section |x 04 in that area} |x Algorithms {For numerical algorithms, see 65-XX; for combinat. |2 msc | |
| 758 | |i has work: |a The bounded and precise word problems for presentations of groups (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGt9ct833kB69jCJPpgbtX |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 830 | 0 | |a Memoirs of the American Mathematical Society ; |v no. 1281. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=6195968 |z Texto completo |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH38606873 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL6195968 | ||
| 938 | |a EBSCOhost |b EBSC |n 2472230 | ||
| 994 | |a 92 |b IZTAP | ||