Algorithmic Algebraic Combinatorics and Gröbner Bases (eBook)
XII, 311 Seiten
Springer Berlin (Verlag)
978-3-642-01960-9 (ISBN)
This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries. There is special emphasis on algorithmic aspects and the use of the theory of Gröbner bases.
Mikhail Klin graduated from Kiev State University. He has taught future engineers, chemists, teachers of mathematics, and programmers in Ukraine and Russia, serving as a Senior Research Associate in the USSR Academy of Sciences N.D.Zelinskii Institute of Organic Chemistry. Since 1992 he has lived in Israel, visiting universities in the USA, Germany and Fiji. He works in areas of algebraic combinatorics, computer algebra
and permutation group theory, and is coauthor of a textbook and co-editor of several collections of papers.
Gareth Jones graduated from Oxford University, and has spent his career at Southampton University where he is a professor of mathematics. He is co-author of three textbooks, and has published over 60 papers, mainly on group theory and its applications to combinatorics, Galois theory, topology, physics and chemistry.
Aleksandar Jurisic received Ph.D. from the University of Waterloo in '95 in the field of algebraic combinatorics. He teaches mathematics, cryptography and computer security
at the Faculty of Computer and Informatic Science, the University of Ljubljana. His main research interests are discrete mathematics and geometry. In 2005 he co-founded the Slovenian Society of Cryptology.
Mikhail Muzychuk got his Ph.D. from Kiev State University in 1988. In 1991 he moved to Israel. Since then he has been teaching mathematical courses for students of different specialities. Nowadays he is a professor at Netanya Academic College. His main research areas are algebraic combinatorics and group theory. He had published 60
papers in these areas and edited two collections of papers.
Ilya Ponomarenko graduated from the St.Petersburg (Leningrad) State University in 1979 with a degree in Operations Research. After working for 11 years as a
programmer, he worked as a researcher (now leading researcher) in the V.A.Steklov Institute of Mathematics at St.Petersburg, Russian Academy of Sciences, Laboratory of Representation Theory and Computational Methods. In 1986 he obtained his PhD, working on polynomial-time isomorphism testing for graphs, and in 2006 his Dr.Sci., on automorphism groups of association schemes. He is interested in algebraic combinatorics (coherent configurations and permutation groups) and computational complexity (especially the Graph Isomorphism Problem). He has over 50 papers published in refereed mathematical journals.
Mikhail Klin graduated from Kiev State University. He has taught future engineers, chemists, teachers of mathematics, and programmers in Ukraine and Russia, serving as a Senior Research Associate in the USSR Academy of Sciences N.D.Zelinskii Institute of Organic Chemistry. Since 1992 he has lived in Israel, visiting universities in the USA, Germany and Fiji. He works in areas of algebraic combinatorics, computer algebraand permutation group theory, and is coauthor of a textbook and co-editor of several collections of papers. Gareth Jones graduated from Oxford University, and has spent his career at Southampton University where he is a professor of mathematics. He is co-author of three textbooks, and has published over 60 papers, mainly on group theory and its applications to combinatorics, Galois theory, topology, physics and chemistry. Aleksandar Jurisic received Ph.D. from the University of Waterloo in '95 in the field of algebraic combinatorics. He teaches mathematics, cryptography and computer securityat the Faculty of Computer and Informatic Science, the University of Ljubljana. His main research interests are discrete mathematics and geometry. In 2005 he co-founded the Slovenian Society of Cryptology. Mikhail Muzychuk got his Ph.D. from Kiev State University in 1988. In 1991 he moved to Israel. Since then he has been teaching mathematical courses for students of different specialities. Nowadays he is a professor at Netanya Academic College. His main research areas are algebraic combinatorics and group theory. He had published 60papers in these areas and edited two collections of papers. Ilya Ponomarenko graduated from the St.Petersburg (Leningrad) State University in 1979 with a degree in Operations Research. After working for 11 years as aprogrammer, he worked as a researcher (now leading researcher) in the V.A.Steklov Institute of Mathematics at St.Petersburg, Russian Academy of Sciences, Laboratory of Representation Theory and Computational Methods. In 1986 he obtained his PhD, working on polynomial-time isomorphism testing for graphs, and in 2006 his Dr.Sci., on automorphism groups of association schemes. He is interested in algebraic combinatorics (coherent configurations and permutation groups) and computational complexity (especially the Graph Isomorphism Problem). He has over 50 papers published in refereed mathematical journals.
Tutorials.- Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics.- Siamese Combinatorial Objects via Computer Algebra Experimentation.- Using Gröbner Bases to Investigate Flag Algebras and Association Scheme Fusion.- Enumerating Set Orbits.- The 2-dimensional Jacobian Conjecture: A Computational Approach.- Research Papers.- Some Meeting Points of Gröbner Bases and Combinatorics.- A Construction of Isomorphism Classes of Oriented Matroids.- Algorithmic Approach to Non-symmetric 3-class Association Schemes.- Sets of Type (d 1,d 2) in Projective Hjelmslev Planes over Galois Rings.- A Construction of Designs from PSL(2,q) and PGL(2,q), q=1 mod 6, on q+2 Points.- Approaching Some Problems in Finite Geometry Through Algebraic Geometry.- Computer Aided Investigation of Total Graph Coherent Configurations for Two Infinite Families of Classical Strongly Regular Graphs.
| Erscheint lt. Verlag | 24.12.2009 |
|---|---|
| Zusatzinfo | XII, 311 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Informatik |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Technik | |
| Schlagworte | Algebra • algorithms • area • association scheme • coding theory • combinatorics • Computer • Computer Algebra • Construction • finite Geometry • Graph • Gröbner Bases • MSC (2000): 05E30, 13P10, 20B25, 68-04 • Permutation |
| ISBN-10 | 3-642-01960-9 / 3642019609 |
| ISBN-13 | 978-3-642-01960-9 / 9783642019609 |
| Haben Sie eine Frage zum Produkt? |
PDF (Wasserzeichen)Größe: 4,0 MB
DRM: Digitales Wasserzeichen
Dieses eBook enthält ein digitales Wasserzeichen und ist damit für Sie personalisiert. Bei einer missbräuchlichen Weitergabe des eBooks an Dritte ist eine Rückverfolgung an die Quelle möglich.
Dateiformat: PDF (Portable Document Format)
Mit einem festen Seitenlayout eignet sich die PDF besonders für Fachbücher mit Spalten, Tabellen und Abbildungen. Eine PDF kann auf fast allen Geräten angezeigt werden, ist aber für kleine Displays (Smartphone, eReader) nur eingeschränkt geeignet.
Systemvoraussetzungen:
PC/Mac: Mit einem PC oder Mac können Sie dieses eBook lesen. Sie benötigen dafür einen PDF-Viewer - z.B. den Adobe Reader oder Adobe Digital Editions.
eReader: Dieses eBook kann mit (fast) allen eBook-Readern gelesen werden. Mit dem amazon-Kindle ist es aber nicht kompatibel.
Smartphone/Tablet: Egal ob Apple oder Android, dieses eBook können Sie lesen. Sie benötigen dafür einen PDF-Viewer - z.B. die kostenlose Adobe Digital Editions-App.
Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook-orders from other countries.
aus dem Bereich
