English
Related papers

Related papers: Universal Algebra in UniMath

200 papers

We give sufficient conditions for homotopical localization functors to preserve algebras over coloured operads in monoidal model categories. Our approach encompasses a number of previous results about preservation of structures under…

Algebraic Topology · Mathematics 2014-02-26 Carles Casacuberta , Javier J. Gutierrez , Ieke Moerdijk , Rainer M. Vogt

Let $\Gamma$ be a $T$-ideal of identities of an affine PI-algebra over an algebraically closed field $F$ of characteristic zero. Consider the family $\mathcal{M}_{\Gamma}$ of finite dimensional algebras $\Sigma$ with $Id(\Sigma) = \Gamma$.…

Rings and Algebras · Mathematics 2023-11-22 Eli Aljadeff , Yakov Karasik

Metric algebras are metric variants of $\Sigma$-algebras. They are first introduced in the field of universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. Recently a similar notion of…

Logic in Computer Science · Computer Science 2016-12-27 Wataru Hino

This article investigates the two-parameter quantum matrix algebra at roots of unity. In the roots of unity setting, this algebra becomes a Polynomial Identity (PI) algebra and it is known that simple modules over such algebra are…

Representation Theory · Mathematics 2025-03-14 Sanu Bera , Snehashis Mukherjee

With a nilpotent element in a semisimple Lie algebra g one associates a finitely generated associative algebra W called a W-algebra of finite type. This algebra is obtained from the universal enveloping algebra U(g) by a certain Hamiltonian…

Representation Theory · Mathematics 2010-06-03 Ivan Losev

In our paper Semi-symmetric Algebras: General Constructions, J. Algebra, 148 (1992), pp. 479-496, we present the construction of the semi-symmetric algebra of a module over a commutative ring with unit, which generalizes the tensor algebra,…

Rings and Algebras · Mathematics 2009-06-01 Valentin Vankov Iliev

We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…

Algebraic Geometry · Mathematics 2024-08-05 Mickaël Montessinos

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

History and Overview · Mathematics 2015-04-23 Piotr Błaszczyk

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…

Logic in Computer Science · Computer Science 2022-01-19 Ian J. Hayes , Robert Colvin , Larissa Meinicke , Kirsten Winter , Andrius Velykis

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

Rings and Algebras · Mathematics 2017-08-01 Brett McLean

In this paper we introduce a class of noncommutative (finitely generated) monomial algebras whose Hilbert series are algebraic functions. We use the concept of graded homology and the theory of unambiguous context-free grammars for this…

Rings and Algebras · Mathematics 2019-06-04 Roberto La Scala , Dmitri Piontkovski , Sharwan K. Tiwari

It is shown that if A is a separable, exact C*-algebra which satisfies the Universal Coefficient Theorem (UCT) and has a faithful, amenable trace, then A admits a trace-preserving embedding into a simple, unital AF-algebra with unique…

Operator Algebras · Mathematics 2019-09-18 Christopher Schafhauser

Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language…

Programming Languages · Computer Science 2018-02-20 Liyi Li , Elsa Gunter

We develop a denotational semantics for general reference types in an impredicative version of guarded homotopy type theory, an adaptation of synthetic guarded domain theory to Voevodsky's univalent foundations. We observe for the first…

Logic in Computer Science · Computer Science 2023-11-22 Jonathan Sterling , Daniel Gratzer , Lars Birkedal

The aim of this article is to describe a class of *-algebras that allows to treat well-behaved algebras of unbounded operators independently of a representation. To this end, Archimedean ordered *-algebras (*-algebras whose real linear…

Operator Algebras · Mathematics 2021-08-20 Matthias Schötz

We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…

Logic in Computer Science · Computer Science 2018-05-29 Clément Aubert , Marc Bagnol

In earlier work we developed the theory of signatures of hermitian forms over algebras with involution with respect to orderings on the base field of the algebra and obtained in particular that the total signature of a hermitian form is a…

Rings and Algebras · Mathematics 2016-06-21 Vincent Astier , Thomas Unger

For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…

K-Theory and Homology · Mathematics 2011-05-12 Vladimir Dotsenko , Anton Khoroshkin

If A is a finite dimensional nilpotent associative algebra over a finite field k, the set G=1+A of all formal expressions of the form 1+a, where a is an element of A, has a natural group structure, given by (1+a)(1+b)=1+(a+b+ab). A finite…

Representation Theory · Mathematics 2007-05-23 Mitya Boyarchenko

We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…

Logic in Computer Science · Computer Science 2023-06-22 Clément Aubert , Marc Bagnol