Finite Geometry Combinatorial Applications by Ball Simeon (30 results)

Paperback. Condition: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Condition: New. SUPER FAST SHIPPING.

Condition: New. pp. 250 Index.

Condition: New. pp. 250 35 Illus.

Condition: New. pp. 250.

Paperback. Condition: Brand New. 1st edition. 295 pages. 8.75x5.75x0.75 inches. In Stock.

Paperback. Condition: new. Paperback. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objects. More than 100 exercises and solutions are provided. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Condition: New. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objec.

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condition: New. SUPER FAST SHIPPING.

Condition: New.

Taschenbuch. Condition: Neu. Neuware - A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.

Hardcover. Condition: Like New. Like New. book.

Hardcover. Condition: new. Hardcover. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objects. More than 100 exercises and solutions are provided. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: New. In.

Hardcover. Condition: Brand New. 250 pages. 9.06x6.06x0.87 inches. In Stock.

Condition: New. pp. 250 Index.

Hardback. Condition: New. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.

Hardback. Condition: New. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.

Paperback. Condition: Brand New. 1st edition. 295 pages. 8.75x5.75x0.75 inches. In Stock. This item is printed on demand.

Paperback. Condition: new. Paperback. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objects. More than 100 exercises and solutions are provided. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 461.

Hardcover. Condition: Brand New. 250 pages. 9.06x6.06x0.87 inches. In Stock. This item is printed on demand.

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objec.

Hardcover. Condition: new. Hardcover. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objects. More than 100 exercises and solutions are provided. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Buch. Condition: Neu. Finite Geometry and Combinatorial Applications | Simeon Ball | Buch | Gebunden | Englisch | 2015 | Cambridge University Press | EAN 9781107107991 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Condition: New. Print on Demand pp. 250 35 Illus.

Hardcover. Condition: new. Hardcover. The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry. For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries arising from vector spaces over finite fields but also shows how these geometries can be applied to various combinatorial objects. More than 100 exercises and solutions are provided. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Condition: New. PRINT ON DEMAND pp. 250.