Buy Algebraic Operads by Murray R. Bremner - Bookswagon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science Textbooks > Mathematics > Algebra > Algebraic Operads: An Algorithmic Companion
Algebraic Operads: An Algorithmic Companion

Algebraic Operads: An Algorithmic Companion


     0     
5
4
3
2
1



Available


X
About the Book

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.

Table of Contents:
Normal Forms for Vectors and Univariate Polynomials. Noncommutative Associative Algebras. Nonsymmetric Operads. Twisted Associative Algebras and Shuffle Algebras. Symmetric Operads and Shuffle Operads. Operadic Homological Algebra and Gröbner Bases. Commutative Gröbner Bases. Linear Algebra over Polynomial Rings. Case Study of Nonsymmetric Binary Cubic Operads. Case Study of Nonsymmetric Ternary Quadratic Operads. Appendices: Maple Code for Buchberger’s Algorithm.

About the Author :
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 Orlik–Solomon 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.

Review :
"This book presents a systematic treatment of Gröbner bases, and more generally of the problem of normal forms, departing from linear algebra, going through commutative and noncommutative algebra, to operads. The algorithmic aspects are especially developed, with numerous examples and exercises."- Loϊc Foissy "By balancing computational methods and abstract reasoning, the authors of the book under review have written an excellent up-to-date introduction to Grobner basis methods applicable to associative structures, especially including operads. The book will be of interest to a wide range of readers, from undergraduates to experts in the field." ~ Ralf Holtkamp, Mathematical Reviews, March 2018 "This book presents a systematic treatment of Gröbner bases, and more generally of the problem of normal forms, departing from linear algebra, going through commutative and noncommutative algebra, to operads. The algorithmic aspects are especially developed, with numerous examples and exercises."- Loϊc Foissy "By balancing computational methods and abstract reasoning, the authors of the book under review have written an excellent up-to-date introduction to Grobner basis methods applicable to associative structures, especially including operads. The book will be of interest to a wide range of readers, from undergraduates to experts in the field." ~ Ralf Holtkamp, Mathematical Reviews, March 2018


Best Sellers


Product Details
  • ISBN-13: 9781032921082
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: Chapman & Hall/CRC
  • Height: 234 mm
  • No of Pages: 384
  • Weight: 548 gr
  • ISBN-10: 1032921080
  • Publisher Date: 14 Oct 2024
  • Binding: Paperback
  • Language: English
  • Sub Title: An Algorithmic Companion
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algebraic Operads: An Algorithmic Companion
Taylor & Francis Ltd -
Algebraic Operads: An Algorithmic Companion
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algebraic Operads: An Algorithmic Companion

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!