Computational Aspects of Polynomial Identities, Kanel-Belov, Alexei , Rowen, Louis Halle

Автор: Kanel-Belov, Alexei , Karasik, Yakov , Rowen, Lo
Название: Computational Aspects of Polynomial Identities
ISBN: 0367445808 ISBN-13(EAN): 9780367445805
Издательство: Taylor&Francis
Рейтинг:
Цена: 9798.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This edition presents the underlying ideas in recent polynomial identity (PI)-theory and demonstrates the validity of the proofs of PI-theorems. It gives all the details involved in Kemer`s proof of Specht`s conjecture for affine PI-algebras in characteristic 0. This edition presents a tighter formulation of Zubrilin`s theory and contains a more

Автор: Teo Mora
Название: Solving Polynomial Equation Systems I
ISBN: 0521811546 ISBN-13(EAN): 9780521811545
Издательство: Cambridge Academ
Рейтинг:
Цена: 27562.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Mora covers the classical theory of finding roots of a univariate polynomial, emphasising computational aspects. He shows that solving a polynomial equation really means finding algorithms that help one manipulate roots rather than simply computing them; to that end he also surveys algorithms for factorizing univariate polynomials.

Автор: N.Z. Shor
Название: Nondifferentiable Optimization and Polynomial Problems
ISBN: 0792349970 ISBN-13(EAN): 9780792349976
Издательство: Springer
Рейтинг:
Цена: 27245.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This work is devoted to an investigation of polynomial optimization problems, including Boolean problems which are the most important part of mathematical programming. It demonstrates methods of nondifferentiable optimization that can be used for finding solutions to many polynomial problems.

Автор: Franz Winkler
Название: Polynomial Algorithms in Computer Algebra
ISBN: 3211827595 ISBN-13(EAN): 9783211827598
Издательство: Springer
Рейтинг:
Цена: 13549.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Offers an introduction to the mathematical underpinnings of computer algebra. This book treats subjects that range from arithmetic of integers and polynomials to fast factorization methods, Grobner bases, and algorithms in algebraic geometry. It is suitable for both mathematics and computer science students.

Автор: Graziano Chesi; Andrea Garulli; Alberto Tesi; Anto
Название: Homogeneous Polynomial Forms for Robustness Analysis of Uncertain Systems
ISBN: 1848827806 ISBN-13(EAN): 9781848827806
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book presents a number of techniques for robustness analysis of uncertain systems. In it, convex relaxations for several robustness problems are derived by exploiting and providing new results on the theory of homogenous polynomial forms.

Автор: Mora
Название: Solving Polynomial Equation Systems III
ISBN: 0521811554 ISBN-13(EAN): 9780521811552
Издательство: Cambridge Academ
Рейтинг:
Цена: 18216.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This third volume of four describes all the most important techniques, mainly based on Groebner bases. It covers the `standard` solutions (Gianni-Kalkbrener, Auzinger-Stetter, Cardinal-Mourrain) as well as the more innovative (Lazard-Rouillier, Giusti-Heintz-Pardo). The author also explores the historical background, from Bezout to Macaulay.

Автор: Richard Zippel
Название: Effective Polynomial Computation
ISBN: 0792393759 ISBN-13(EAN): 9780792393757
Издательство: Springer
Рейтинг:
Цена: 23751.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Kaarli, Kalle , Pixley, Alden F.
Название: Polynomial Completeness in Algebraic Systems
ISBN: 0367398338 ISBN-13(EAN): 9780367398330
Издательство: Taylor&Francis
Рейтинг:
Цена: 9798.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Boolean algebras have historically played a special role in the development of the theory of general or universal algebraic systems, providing important links between algebra and analysis, set theory, mathematical logic, and computer science. It is not surprising then that focusing on specific properties of Boolean algebras has lead to new directions in universal algebra.

In the first unified study of polynomial completeness, Polynomial Completeness in Algebraic Systems focuses on and systematically extends another specific property of Boolean algebras: the property of affine completeness. The authors present full proof that all affine complete varieties are congruence distributive and that they are finitely generated if and only if they can be presented using only a finite number of basic operations. In addition to these important findings, the authors describe the different relationships between the properties of lattices of equivalence relations and the systems of functions compatible with them.

An introductory chapter surveys the appropriate background material, exercises in each chapter allow readers to test their understanding, and open problems offer new research possibilities. Thus Polynomial Completeness in Algebraic Systems constitutes an accessible, coherent presentation of this rich topic valuable to both researchers and graduate students in general algebraic systems.

Автор: Arno van den Essen
Название: Polynomial Automorphisms
ISBN: 3034895674 ISBN-13(EAN): 9783034895675
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Motivated by some notorious open problems, such as the Jacobian conjecture and the tame generators problem, the subject of polynomial automorphisms has become a rapidly growing field of interest.

Автор: Giovanni Cancellieri
Название: Polynomial Theory of Error Correcting Codes
ISBN: 3319378708 ISBN-13(EAN): 9783319378701
Издательство: Springer
Рейтинг:
Цена: 22201.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Numerous examples and indexed definitions make this detailed guide to polynomial theory in error-correcting codes a highly accessible resource. New codes and a unitary approach to block and convolutional codes will enhance readers` understanding of the topic.