46,95 €
46,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
23 °P sammeln
46,95 €
46,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
23 °P sammeln
Als Download kaufen
46,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
23 °P sammeln
Jetzt verschenken
46,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
23 °P sammeln
  • Format: PDF

This book is organized in two parts, the first of which develops an account of polynomial symmetry that relies on considerations of algebra and geometry. The second explores beyond polynomials to spaces consisting of choices ranging from mundane decisions to evolutionary algorithms that search for optimal outcomes.

  • Geräte: PC
  • ohne Kopierschutz
  • eBook Hilfe
  • Größe: 221.08MB
Produktbeschreibung
This book is organized in two parts, the first of which develops an account of polynomial symmetry that relies on considerations of algebra and geometry. The second explores beyond polynomials to spaces consisting of choices ranging from mundane decisions to evolutionary algorithms that search for optimal outcomes.


Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Scott Crass is a professor of mathematics at California State University, Long Beach, where he created the Long Beach Project in Geometry and Symmetry. The project's centerpiece is The Geometry Studio, where students explore math in experimental and perceptual ways. Advised by Peter Doyle, his Ph.D. thesis at UCSD was 'Solving the Sextic by Iteration: A Complex Dynamical Approach'. His research interests involve blending the algebra and geometry induced by finite group actions on complex spaces, in an effort to discover and study symmetrical structures and associated dynamical systems. A prominent feature of his work involves using maps with symmetry in order to construct elegant algorithms that home in on a polynomial's roots.