|
![]() |
|||
|
||||
OverviewComputers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above. Full Product DetailsAuthor: Wieb Bosma , Alf van der PoortenPublisher: Springer Imprint: Springer Edition: Softcover reprint of hardcover 1st ed. 1995 Volume: 325 Dimensions: Width: 15.50cm , Height: 1.70cm , Length: 23.50cm Weight: 0.522kg ISBN: 9789048145607ISBN 10: 9048145600 Pages: 322 Publication Date: 04 December 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of Contents1 Calculating Growth Functions for Groups Using Automata.- 2 The Minimal Faithful Degree of a Finite Commutative Inverse Semigroup.- 3 Generalisations of the Todd-Coxeter Algorithm.- 4 Computing Left Kan Extensions Using the Todd—Coxeter Procedure.- 5 Computing Finite Soluble Quotients.- 6 Computing Automorphism Groups of p-Groups.- 7 The Art and Science of Computing in Large Groups.- 8 Does the Set of Points of an Elliptic Curve Determine the Group?.- 9 An Implementation of the Elliptic Curve Integer Factorization Method.- 10 Continued Fractions of Algebraic Numbers.- 11 Bounds for Class Numbers of Quadratic Orders.- 12 Short Representation of Quadratic Integers.- 13 A Density Conjecture for the Negative Pell Equation.- 14 Computing Aurifeuillian Factors.- 15 Computation of Cyclotomic Polynomials with Magma.- 16 On Some Characteristics of Uniformity of Distribution and Their Applications.- 17 Recent Progress on Consistency Testing for Polynomial Systems.- 18 A New Generalisation of the Kummer Congruence.- 19 Series Expansions of Algebraic Functions.- 20 Generation of Cocyclic Hadamard Matrices.- 21 Large Cayley Graphs and Digraphs with Small Degree and Diameter.- 22 Hyperbolic Pyritohedra Constructed from the Coxeter Group [4,3,5].ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |