English
Related papers

Related papers: W-types in setoids

200 papers

We prove that the algebra of endomorphisms of a Weyl module of critical level is isomorphic to the algebra of functions on the space of monodromy-free opers on the disc with regular singularity and residue determined by the highest weight…

Quantum Algebra · Mathematics 2007-11-07 Edward Frenkel , Dennis Gaitsgory

A class of algebras is constructed using free fermions and the invariant antisymmetric tensors associated with irreducible holonomy groups. (This version contains minor typographical corrections and some additional references. )

High Energy Physics - Theory · Physics 2014-01-21 P. S. Howe , G. Papadopoulos , P. C. West

We develop a theory of type semigroups for arbitrary twisted, not necessarily Hausdorff \'etale groupoids. The type semigroup is a dynamical version of the Cuntz semigroup. We relate it to traces, ideals, pure infiniteness, and stable…

Operator Algebras · Mathematics 2025-03-28 Bartosz K. Kwaśniewski , Ralf Meyer , Akshara Prasad

This is the second paper in a series that aims to provide mathematical descriptions of objects and constructions related to the first few steps of the semantical theory of dependent type systems. We construct for any pair $(R,LM)$, where…

Logic · Mathematics 2014-09-30 Vladimir Voevodsky

In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find…

Group Theory · Mathematics 2026-01-21 Luna Elliott

When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants such as Coq or Agda, one is often using setoids (types with explicit equivalence relations). In this note we…

Logic · Mathematics 2013-04-23 Erik Palmgren

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

We study a certain cycle map defined on finite dimensional modules for the W-algebra with regular integral central character. Via comparison with the theory in postive characteristic, we show that this map injects into the top Borel-Moore…

Representation Theory · Mathematics 2011-12-08 Christopher Dodd

Let U be the quantised enveloping algebra associated to a Cartan matrix of finite type. Let W be the tensor product of a finite list of highest weight representations of U. Then the centraliser algebra of W has a basis called the dual…

Representation Theory · Mathematics 2011-04-11 Bruce W. Westbury

We employ the dependently-typed programming language Agda2 to explore formalisation of untyped and typed term graphs directly as set-based graph structures, via the gs-monoidal categories of Corradini and Gadducci, and as nested…

Logic in Computer Science · Computer Science 2011-02-15 Wolfram Kahl

We construct finitely generated simple algebras with prescribed growth types, which can be arbitrarily taken from a large variety of (super-polynomial) growth types. This (partially) answers a question raised by the author in a recent…

Rings and Algebras · Mathematics 2017-08-29 Be'eri Greenfeld

This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…

Category Theory · Mathematics 2024-08-20 Nelson Niu , David I. Spivak

Let K,S,D be a division ring, an endomorphism and a S-derivation of K, respectively. In this setting we introduce generalized noncommutative symmetric functions and obtain Vieta formula and decompositions of differential operators.…

Rings and Algebras · Mathematics 2007-05-23 J. Delenclos , A. Leroy

In Martin-L\"of's Intensional Type Theory, identity type is a heavily used and studied concept. The reason for that is the fact that it's responsible for the recently discovered connection between Type Theory and Homotopy Theory. The main…

Logic in Computer Science · Computer Science 2015-02-17 Arthur Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

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

We exhibit a connection between two constructions of twisted modules for a general vertex operator algebra with respect to inner automorphisms. We also study pseudo-derivations, pseudo-endomorphisms, and twist deformations of ordinary…

Quantum Algebra · Mathematics 2010-04-07 Haisheng Li

We study the structure of the Mordell--Weil groups of semiabelian varieties over large algebraic extensions of a finitely generated field of characteristic zero. We consider two types of algebraic extensions in this paper; one is of…

Number Theory · Mathematics 2025-11-27 Takuya Asayama , Yuichiro Taguchi

Conditional independence has been widely used in AI, causal inference, machine learning, and statistics. We introduce categoroids, an algebraic structure for characterizing universal properties of conditional independence. Categoroids are…

Artificial Intelligence · Computer Science 2022-08-25 Sridhar Mahadevan

In algebraic geometry over a variety of universal algebras $\Theta $, the group $Aut(\Theta ^{0})$ of automorphisms of the category $\Theta ^{0}$ of finitely generated free algebras of $\Theta $ is of great importance. In this paper,…

Rings and Algebras · Mathematics 2007-05-23 Yefim Katsov , Ruvim Lipyanski , Boris Plotkin

We give a new elementary proof of the theorem that a natural map from Milnor's construction $F[S^1]$ to the simplicial group $\mathrm{AP}$ of pure braids is injective. Our approach is group-theoretic and does not rely on Lie algebras.

Group Theory · Mathematics 2025-07-15 Vasily Ionin
‹ Prev 1 8 9 10 Next ›