William O. J. Moser – författare
Visar alla böcker från författaren . Handla med fri frakt och snabb leverans.
7 produkter
7 produkter
Inbunden, Engelska, 2005
544 kr
Skickas inom 10-15 vardagar
Although discrete geometry has a rich history extending more than 150 years, it abounds in open problems that even a high-school student can understand and appreciate. Some of these problems are notoriously difficult and are intimately related to deep questions in other fields of mathematics. But many problems, even old ones, can be solved by a clever undergraduate or a high-school student equipped with an ingenious idea and the kinds of skills used in a mathematical olympiad.Research Problems in Discrete Geometry is the result of a 25-year-old project initiated by the late Leo Moser. It is a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.Important features include:- More than 500 open problems, some old, others new and never before published- Each chapter divided into self-contained sections, each section ending with an extensive bibliography- A great selection of research problems for graduate students looking for a dissertation topic- A comprehensive survey of discrete geometry, highlighting the frontiers and future of research- More than 120 figures- A preface to an earlier version written by the late Paul ErdosPeter Brass is Associate Professor of Computer Science at the City College of New York. William O. J. Moser is Professor Emeritus at McGill University. Janos Pach is Distinguished Professor at The City College of New York, Research Professor at the Courant Institute, NYU, and Senior Research Fellow at the Rényi Institute,Budapest.
E-bok
PDF, Engelska, 2006712 kr
Läs direkt efter köp
Although discrete geometry has a rich history extending more than 150 years, it abounds in open problems that even a high-school student can understand and appreciate. Some of these problems are notoriously difficult and are intimately related to deep questions in other fields of mathematics. But many problems, even old ones, can be solved by a clever undergraduate or a high-school student equipped with an ingenious idea and the kinds of skills used in a mathematical olympiad.
Research Problems in Discrete Geometry is the result of a 25-year-old project initiated by the late Leo Moser. It is a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.
Important features include:
- More than 500 open problems, some old, others new and never before published
- Each chapter divided into self-contained sections, each section ending with an extensive bibliography
- A great selection of research problems for graduate students looking for a dissertation topic
- A comprehensive survey of discrete geometry, highlighting the frontiers and future of research
- More than 120 figures
- A preface to an earlier version written by the late Paul Erdos
Peter Brass is Associate Professor of Computer Science at the City College of New York. William O. J. Moser is Professor Emeritus at McGill University. Janos Pach is Distinguished Professor at The City College of New York, Research Professor at the Courant Institute, NYU, and Senior Research Fellow at the Rényi Institute,Budapest.
Häftad, Engelska, 2010
544 kr
Skickas inom 10-15 vardagar
Although discrete geometry has a rich history extending more than 150 years, it abounds in open problems that even a high-school student can understand and appreciate. Some of these problems are notoriously difficult and are intimately related to deep questions in other fields of mathematics. But many problems, even old ones, can be solved by a clever undergraduate or a high-school student equipped with an ingenious idea and the kinds of skills used in a mathematical olympiad.Research Problems in Discrete Geometry is the result of a 25-year-old project initiated by the late Leo Moser. It is a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.Important features include:- More than 500 open problems, some old, others new and never before published- Each chapter divided into self-contained sections, each section ending with an extensive bibliography- A great selection of research problems for graduate students looking for a dissertation topic- A comprehensive survey of discrete geometry, highlighting the frontiers and future of research- More than 120 figures- A preface to an earlier version written by the late Paul ErdosPeter Brass is Associate Professor of Computer Science at the City College of New York. William O. J. Moser is Professor Emeritus at McGill University. Janos Pach is Distinguished Professor at The City College of New York, Research Professor at the Courant Institute, NYU, and Senior Research Fellow at the Rényi Institute,Budapest.
E-bok
PDF, Engelska, 20131 413 kr
Läs direkt efter köp
When we began to consider the scope of this book, we envisaged a catalogue supplying at least one abstract definition for any finitely generated group that the reader might propose. But we soon realized that more or less arbitrary restrictions are necessary, because interesting groups are so numerous. For permutation groups of degree 8 or less (i.e.'' .subgroups of es), the reader cannot do better than consult the tables of JosEPHINE BuRNS (1915), while keeping an eye open for misprints. Our own tables (on pages 134-142) deal with groups of low order, finite and infinite groups of congruent transformations, symmetric and alternating groups, linear fractional groups, and groups generated by reflections in real Euclidean space of any number of dimensions. The best substitute for a more extensive catalogue is the description (in Chapter 2) of a method whereby the reader can easily work out his own abstract definition for almost any given finite group. This method is sufficiently mechanical for the use of an electronic computer.
Del 14 - Ergebnisse der Mathematik und ihrer Grenzgebiete. 2. Folge
Generators and Relations for Discrete Groups
Häftad, Engelska, 2017
1 081 kr
Skickas inom 10-15 vardagar
When we began to consider the scope of this book, we envisaged a catalogue supplying at least one abstract definition for any finitely generated group that the reader might propose. But we soon realized that more or less arbitrary restrictions are necessary, because interesting groups are so numerous. For permutation groups of degree 8 or less (i.e.' .subgroups of es), the reader cannot do better than consult the tables of JosEPHINE BuRNS (1915), while keeping an eye open for misprints. Our own tables (on pages 134-142) deal with groups of low order, finite and infinite groups of congruent transformations, symmetric and alternating groups, linear fractional groups, and groups generated by reflections in real Euclidean space of any number of dimensions. The best substitute for a more extensive catalogue is the description (in Chapter 2) of a method whereby the reader can easily work out his own abstract definition for almost any given finite group. This method is sufficiently mechanical for the use of an electronic computer.
Del 14 - Ergebnisse der Mathematik und Ihrer Grenzgebiete. 1. Folge
Generators and Relations for Discrete Groups
Häftad, Engelska, 1957
866 kr
Skickas inom 10-15 vardagar
When we began to consider the scope of this book, we envisaged a catalogue supplying at least one abstract definition for any finitely generated group that the reader might propose. But we soon realized that more or less arbitrary restrictions are necessary, because interesting groups are so numerous. For permutation groups of degree 8 or less (i. e., subgroups of e ), the reader cannot do better than consult the 8 tables of JosEPHINE BuRNS (1915), while keeping an eye open for misprints. Our own tables (on pages 134-143) deal with groups of low order, finiteandinfinite groups of congruent transformations, symmetric and alternating groups, linear fractional groups, and groups generated by reflections in real Euclidean space of any number of dimensions. The best substitute foramoreextensive catalogue is the description (in Chapter 2) of a method whereby the reader can easily work out his own abstract definition for almost any given finite group. This method is sufficiently mechanical for the use of an electronic computer. There is also a topological method (Chapter 3), suitable not only for groups of low order but also for some infinite groups. This involves choosing a set of generators, constructing a certain graph (the Cayley diagram or DEHNsehe Gruppenbild), and embedding the graph into a surface. Cases in which the surface is a sphere or a plane are described in Chapter 4, where we obtain algebraically, and verify topologically, an abstract definition for each of the 17 space groups of two-dimensional crystallography.
E-bok
PDF, Engelska, 20131 105 kr
Läs direkt efter köp
When we began to consider the scope of this book, we envisaged a catalogue supplying at least one abstract definition for any finitely generated group that the reader might propose. But we soon realized that more or less arbitrary restrictions are necessary, because interesting groups are so numerous. For permutation groups of degree 8 or less (i. e., subgroups of e ), the reader cannot do better than consult the 8 tables of JosEPHINE BuRNS (1915), while keeping an eye open for misprints. Our own tables (on pages 134-143) deal with groups of low order, finiteandinfinite groups of congruent transformations, symmetric and alternating groups, linear fractional groups, and groups generated by reflections in real Euclidean space of any number of dimensions. The best substitute foramoreextensive catalogue is the description (in Chapter 2) of a method whereby the reader can easily work out his own abstract definition for almost any given finite group. This method is sufficiently mechanical for the use of an electronic computer. There is also a topological method (Chapter 3), suitable not only for groups of low order but also for some infinite groups. This involves choosing a set of generators, constructing a certain graph (the Cayley diagram or DEHNsehe Gruppenbild), and embedding the graph into a surface. Cases in which the surface is a sphere or a plane are described in Chapter 4, where we obtain algebraically, and verify topologically, an abstract definition for each of the 17 space groups of two-dimensional crystallography.