Algebraic Operads: An Algorithmic Companion | Agenda Bookshop Skip to content
Please note that books with a 10-20 working days delivery time may not arrive before Christmas.
Please note that books with a 10-20 working days delivery time may not arrive before Christmas.
A01=Murray R. Bremner
A01=Vladimir Dotsenko
Age Group_Uncategorized
Age Group_Uncategorized
Author_Murray R. Bremner
Author_Vladimir Dotsenko
automatic-update
Category1=Non-Fiction
Category=PBF
Category=PBH
COP=United Kingdom
Delivery_Pre-order
Language_English
PA=Not yet available
Price_€50 to €100
PS=Forthcoming
softlaunch

Algebraic Operads: An Algorithmic Companion

English

By (author): Murray R. Bremner Vladimir Dotsenko

Algebraic Operads: An Algorithmic Companion presents a systematic treatment of Gröbner bases in several contexts. The book builds up to the theory of Gröbner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra.

The authors present a variety of topics including: noncommutative Gröbner bases and their applications to the construction of universal enveloping algebras; Gröbner bases for shuffle algebras which can be used to solve questions about combinatorics of permutations; and operadic Gröbner bases, important for applications to algebraic topology, and homological and homotopical algebra.

The last chapters of the book combine classical commutative Gröbner bases with operadic ones to approach some classification problems for operads. Throughout the book, both the mathematical theory and computational methods are emphasized and numerous algorithms, examples, and exercises are provided to clarify and illustrate the concrete meaning of abstract theory.

See more
Current price €83.59
Original price €87.99
Save 5%
A01=Murray R. BremnerA01=Vladimir DotsenkoAge Group_UncategorizedAuthor_Murray R. BremnerAuthor_Vladimir Dotsenkoautomatic-updateCategory1=Non-FictionCategory=PBFCategory=PBHCOP=United KingdomDelivery_Pre-orderLanguage_EnglishPA=Not yet availablePrice_€50 to €100PS=Forthcomingsoftlaunch

Will deliver when available. Publication date 14 Oct 2024

Product Details
  • Weight: 710g
  • Dimensions: 156 x 234mm
  • Publication Date: 14 Oct 2024
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: United Kingdom
  • Language: English
  • ISBN13: 9781032921082

About Murray R. BremnerVladimir Dotsenko

Murray R. Bremner PhD is a professor at the University of Saskatchewan in Canada. He attended that university as an undergraduate and received an M. Comp. Sc. degree at Concordia University in Montréal. He obtained a doctorate in mathematics at Yale University with a thesis entitled On Tensor Products of Modules over the Virasoro Algebra. Prior to returning to Saskatchewan he held shorter positions at MSRI in Berkeley and at the University of Toronto. Dr. Bremner authored the book Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications and is a co-translator with M. V. Kotchetov of Selected Works of A. I. Shirshov in English Translation. His primary research interests are algebraic operads nonassociative algebra representation theory and computer algebra.Vladimir Dotsenko PhD is an assistant professor in pure mathematics at Trinity College Dublin in Ireland. He studied at the Mathematical High School 57 in Moscow Independent University of Moscow and Moscow State University. His PhD thesis is titled Analogues of OrlikSolomon Algebras and Related Operads. Dr. Dotsenko also held shorter positions at Dublin Institute for Advanced Studies and the University of Luxembourg. His collaboration with Murray started in February 2013 in CIMAT (Guanajuato Mexico) where they both lectured in the research school Associative and Nonassociative Algebras and Dialgebras: Theory and Algorithms. His primary research interests are algebraic operads homotopical algebra combinatorics and representation theory.

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept