1,894 research outputs found
Quillen homology for operads via Gr\"obner bases
The main goal of this paper is to present a way to compute Quillen homology
of operads. The key idea is to use the notion of a shuffle operad we introduced
earlier; this allows to compute, for a symmetric operad, the homology classes
and the shape of the differential in its minimal model, although does not give
an insight on the symmetric groups action on the homology. Our approach goes in
several steps. First, we regard our symmetric operad as a shuffle operad, which
allows to compute its Gr\"obner basis. Next, we define a combinatorial
resolution for the "monomial replacement" of each shuffle operad (provided by
the Gr\"obner bases theory). Finally, we explain how to "deform" the
differential to handle every operad with a Gr\"obner basis, and find explicit
representatives of Quillen homology classes for a large class of operads. We
also present various applications, including a new proof of Hoffbeck's PBW
criterion, a proof of Koszulness for a class of operads coming from commutative
algebras, and a homology computation for the operads of Batalin-Vilkovisky
algebras and of Rota-Baxter algebras.Comment: 41 pages, this paper supersedes our previous preprint
arXiv:0912.4895. Final version, to appear in Documenta Mat
The calculus of multivectors on noncommutative jet spaces
The Leibniz rule for derivations is invariant under cyclic permutations of
co-multiples within the arguments of derivations. We explore the implications
of this principle: in effect, we construct a class of noncommutative bundles in
which the sheaves of algebras of walks along a tesselated affine manifold form
the base, whereas the fibres are free associative algebras or, at a later
stage, such algebras quotients over the linear relation of equivalence under
cyclic shifts. The calculus of variations is developed on the infinite jet
spaces over such noncommutative bundles.
In the frames of such field-theoretic extension of the Kontsevich formal
noncommutative symplectic (super)geometry, we prove the main properties of the
Batalin--Vilkovisky Laplacian and Schouten bracket. We show as by-product that
the structures which arise in the classical variational Poisson geometry of
infinite-dimensional integrable systems do actually not refer to the graded
commutativity assumption.Comment: Talks given at Mathematics seminar (IHES, 25.11.2016) and Oberseminar
(MPIM Bonn, 2.02.2017), 23 figures, 60 page
Termination orderings for associative-commutative rewriting systems
In this paper we describe a new class of orderings—associative path orderings—for proving termination of associative-commutative term rewriting systems .These orderings are based on the concept of simplification orderings and extend the well-known recursive path orderings to E - congruence classes, where E is an equational theory consisting of associativity and commutativity axioms. Associative path orderings are applicable to term rewriting systems for which a precedence ordering on the set of operator symbols can be defined that satisfies a certain condition,the associative path condition. The precedence ordering can often be derived from the structure of the reduction rules. We include termination proofs for various term rewriting systems (for rings,boolean algebra,etc.) and, in addition, point out ways to handle situations where the associative path condition is too restrictive
Symmetry, Gravity and Noncommutativity
We review some aspects of the implementation of spacetime symmetries in
noncommutative field theories, emphasizing their origin in string theory and
how they may be used to construct theories of gravitation. The geometry of
canonical noncommutative gauge transformations is analysed in detail and it is
shown how noncommutative Yang-Mills theory can be related to a gravity theory.
The construction of twisted spacetime symmetries and their role in constructing
a noncommutative extension of general relativity is described. We also analyse
certain generic features of noncommutative gauge theories on D-branes in curved
spaces, treating several explicit examples of superstring backgrounds.Comment: 52 pages; Invited review article to be published in Classical and
Quantum Gravity; v2: references adde
Deformation Quantization: Genesis, Developments and Metamorphoses
We start with a short exposition of developments in physics and mathematics
that preceded, formed the basis for, or accompanied, the birth of deformation
quantization in the seventies. We indicate how the latter is at least a viable
alternative, autonomous and conceptually more satisfactory, to conventional
quantum mechanics and mention related questions, including covariance and star
representations of Lie groups. We sketch Fedosov's geometric presentation,
based on ideas coming from index theorems, which provided a beautiful frame for
developing existence and classification of star-products on symplectic
manifolds. We present Kontsevich's formality, a major metamorphosis of
deformation quantization, which implies existence and classification of
star-products on general Poisson manifolds and has numerous ramifications. Its
alternate proof using operads gave a new metamorphosis which in particular
showed that the proper context is that of deformations of algebras over
operads, while still another is provided by the extension from differential to
algebraic geometry. In this panorama some important aspects are highlighted by
a more detailed account.Comment: Latex file. 40 pages with 2 figures. To appear in: Proceedings of the
meeting between mathematicians and theoretical physicists, Strasbourg, 2001.
IRMA Lectures in Math. Theoret. Phys., vol. 1, Walter De Gruyter, Berlin
2002, pp. 9--5
Nominal C-Unification
Nominal unification is an extension of first-order unification that takes
into account the \alpha-equivalence relation generated by binding operators,
following the nominal approach. We propose a sound and complete procedure for
nominal unification with commutative operators, or nominal C-unification for
short, which has been formalised in Coq. The procedure transforms nominal
C-unification problems into simpler (finite families) of fixpoint problems,
whose solutions can be generated by algebraic techniques on combinatorics of
permutations.Comment: Pre-proceedings paper presented at the 27th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur,
Belgium, 10-12 October 2017 (arXiv:1708.07854
Constrained completion: Theory, implementation, and results
The Knuth-Bendix completion procedure produces complete sets of reductions but can not handle certain rewrite rules such as commutativity. In order to handle such theories, completion procedure were created to find complete sets of reductions modulo an equational theory. The major problem with this method is that it requires a specialized unification algorithm for the equational theory. Although this method works well when such an algorithm exists, these algorithms are not always available and thus alternative methods are needed to attack problems. A way of doing this is to use a completion procedure which finds complete sets of constrained reductions. This type of completion procedure neither requires specialized unification algorithms nor will it fail due to unorientable identities.
We present a look at complete sets of reductions with constraints, developed by Gerald Peterson, and the implementation of such a completion procedure for use with HIPER - a fast completion system. The completion procedure code is given and shown correct along with the various support procedures which are needed by the constrained system. These support procedures include a procedure to find constraints using the lexicographic path ordering and a normal form procedure for constraints.
The procedure has been implemented for use under the fast HIPER system, developed by Jim Christian, and thus is quick. We apply this new system, HIPER- extension, to attack a variety of word problems. Implementation alternatives are discussed, developed, and compared with each other as well as with the HIPER system.
Finally, we look at the problem of finding a complete set of reductions for a ternary boolean algebra. Given are alternatives to attacking this problem and the already known solution along with its run in the HIPER-extension system --Abstract, page iii
Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations
AbstractIn the first part of this paper, we introducenormalized rewriting, a new rewrite relation. It generalizes former notions of rewriting modulo a set of equationsE, dropping some conditions onE. For example,Ecan now be the theory of identity, idempotence, the theory of Abelian groups or the theory of commutative rings. We give a new completion algorithm for normalized rewriting. It contains as an instance the usual AC completion algorithm, but also the well-known Buchberger algorithm for computing Gröbner bases of polynomial ideals. In the second part, we investigate the particular case of completion of ground equations. In this case we prove by a uniform method that completion moduloEterminates, for some interesting theoriesE. As a consequence, we obtain the decidability of the word problem for some classes of equational theories, including the AC-ground case (a result known since 1991), the ACUI-ground case (a new result to our knowledge), and the cases of ground equations modulo the theory of Abelian groups and commutative rings, which is already known when the signature contains only constants, but is new otherwise. Finally, we give implementation results which show the efficiency of normalized completion with respect to completion modulo AC
- …