English
Related papers

Related papers: The Agda Universal Algebra Library, Part 2: Struct…

200 papers

Global Weyl modules for generalized loop algebras $\lie g\tensor A$, where $\lie g$ is a simple finite dimensional Lie algebra and A is a commutative associative algebra were defined, for any dominant integral weight $\lambda$, by…

Representation Theory · Mathematics 2012-08-16 Matthew Bennett , Vyjayanthi Chari , Jacob Greenstein , Nathan Manning

We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…

Quantum Algebra · Mathematics 2007-05-23 R. M. Green

This paper explores formalizing Geometric (or Clifford) algebras into the Lean 3 theorem prover, building upon the substantial body of work that is the Lean mathematics library, mathlib. As we use Lean source code to demonstrate many of our…

Logic in Computer Science · Computer Science 2022-04-20 Eric Wieser , Utensil Song

The purpose of this paper is to discuss the universal algebra theory of hom-algebras. This kind of algebra involves a linear map which twists the usual identities. We focus on hom-associative algebras and hom-Lie algebras for which we…

Rings and Algebras · Mathematics 2014-04-10 Lars Hellström , Abdenacer Makhlouf , Sergei D. Silvestrov

We study different algebraic structures associated to an operad and their relations: to any operad $\mathbf{P}$ is attached a bialgebra,the monoid of characters of this bialgebra, the underlying pre-Lie algebra and its enveloping algebra;…

Rings and Algebras · Mathematics 2017-02-20 Loïc Foissy

The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two…

Logic in Computer Science · Computer Science 2015-07-01 Barnaby Martin , Manuel Bodirsky , Martin Hils

The term UniMath refers both to a formal system for mathematics, as well as a computer-checked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Ralph Matthes , Anders Mörtberg

This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…

Representation Theory · Mathematics 2007-05-23 Alice Fialowski , Michael Penkava

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

This paper describes mathlib, a community-driven effort to build a unified library of mathematics formalized in the Lean proof assistant. Among proof assistant libraries, it is distinguished by its dependently typed foundations, focus on…

Logic in Computer Science · Computer Science 2020-01-28 The mathlib Community

In this paper, first we show that $(\g,[\cdot,\cdot],\alpha)$ is a hom-Lie algebra if and only if $(\Lambda \g^*,\alpha^*,d)$ is an $(\alpha^*,\alpha^*)$-differential graded commutative algebra. Then, we revisit representations of hom-Lie…

Mathematical Physics · Physics 2016-02-04 Yunhe Sheng , Zhen Xiong

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

Logic in Computer Science · Computer Science 2022-03-15 Marcelo Fiore , Andrew M. Pitts , S. C. Steenkamp

Dependently-typed host languages empower users to verify a wide range of properties of embedded languages and programs written in them. Designers of such embedded languages are faced with a difficult choice between using a shallow or a deep…

Programming Languages · Computer Science 2021-05-25 Artjoms Šinkarovs , Jesper Cockx

We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…

Programming Languages · Computer Science 2022-07-05 Fritz Henglein , Robin Kaarsgaard , Mikkel Kragh Mathiesen

For n even, we prove Pozhidaev's conjecture on the existence of associative enveloping algebras for simple n-Lie algebras. More generally, for n even and any (n+1)-dimensional n-Lie algebra L, we construct a universal associative enveloping…

Rings and Algebras · Mathematics 2010-08-13 Murray R. Bremner , Hader A. Elgendy

In this paper, we explore a connection between type universes and memory allocation. Type universe hierarchies are used in dependent type theories to ensure consistency, by forbidding a type from quantifying over all types. Instead, the…

Programming Languages · Computer Science 2024-07-10 Paulette Koronkevich , William J. Bowman

We give a conceptual explanation of universal deformation formulas for unital associative algebras and prove some results on the structure of their moduli spaces. We then generalize universal deformation formulas to other types of algebras…

Algebraic Topology · Mathematics 2013-08-19 Elisabeth Remm , Martin Markl

The main aim of this paper is to classify the distinct multiplicative Lie algebra structures (up to isomorphism) on a given group. We also see that for a given group $G$, every homomorphism from the non-abelian exterior square $G \wedge G$…

Group Theory · Mathematics 2019-12-13 Mani Shankar Pandey , Sumit Kumar Upadhyay

We develop formal theories of conversion for Church-style lambda-terms with Pi-types in first-order syntax using one-sorted variables names and Stoughton's multiple substitutions. We then formalize the Pure Type Systems along some…

Logic in Computer Science · Computer Science 2025-10-15 Sebastián Urciuoli
‹ Prev 1 3 4 5 6 7 10 Next ›