Anna M. Bigatti - Böcker
Visar alla böcker från författaren Anna M. Bigatti. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
Computations and Combinatorics in Commutative Algebra
EACA School, Valladolid 2013
Häftad, Engelska, 2017
694 kr
Skickas inom 10-15 vardagar
Featuring up-to-date coverage of three topics lying at the intersection of combinatorics and commutative algebra, namely Koszul algebras, primary decompositions and subdivision operations in simplicial complexes, this book has its focus on computations. "Computations and Combinatorics in Commutative Algebra" has been written by experts in both theoretical and computational aspects of these three subjects and is aimed at a broad audience, from experienced researchers who want to have an easy but deep review of the topics covered to postgraduate students who need a quick introduction to the techniques. The computational treatment of the material, including plenty of examples and code, will be useful for a wide range of professionals interested in the connections between commutative algebra and combinatorics.
Del 2083 - Lecture Notes in Mathematics
Monomial Ideals, Computations and Applications
Häftad, Engelska, 2013
536 kr
Skickas inom 10-15 vardagar
This work covers three important aspects of monomials ideals in the three chapters "Stanley decompositions" by Jürgen Herzog, "Edge ideals" by Adam Van Tuyl and "Local cohomology" by Josep Álvarez Montaner. The chapters, written by top experts, include computer tutorials that emphasize the computational aspects of the respective areas. Monomial ideals and algebras are, in a sense, among the simplest structures in commutative algebra and the main objects of combinatorial commutative algebra. Also, they are of major importance for at least three reasons. Firstly, Gröbner basis theory allows us to treat certain problems on general polynomial ideals by means of monomial ideals. Secondly, the combinatorial structure of monomial ideals connects them to other combinatorial structures and allows us to solve problems on both sides of this correspondence using the techniques of each of the respective areas. And thirdly, the combinatorial nature of monomial ideals also makes them particularly well suited to the development of algorithms to work with them and then generate algorithms for more general structures.