English
Related papers

Related papers: Generators and Bases for Monadic Closures

200 papers

We establish a duality between monads and monadic morphisms in any $(\infty,2)$-category and characterize monadic morphisms in a wide class of examples. This duality unifies several dualities between algebraic structures and their…

Category Theory · Mathematics 2026-03-19 Hadrian Heine

We determine generators of the rational cohomology algebras of moduli spaces of parabolic vector bundles on a curve, under some `primality' conditions on the parabolic datum. These generators are canonical in a precise sense. Our results…

alg-geom · Mathematics 2008-02-03 I. Biswas , N. Raghavendra

We show that endomorphism rings of cogenerators in the module category of a finite-dimensional algebra A admit a canonical tilting module, whose tilted algebra B is related to A by a recollement. Let M be a gen-finite A-module, meaning…

Rings and Algebras · Mathematics 2025-02-28 Matthew Pressland , Julia Sauter

Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…

Rings and Algebras · Mathematics 2016-11-25 Rostyslav V. Kravchenko , Marcin Mazur , Bogdan V. Petrenko

A systematic method is presented for the construction and classification of algebras of gauge transformations for arbitrary high rank tensor gauge fields. For every tensor gauge field of a given rank, the gauge transformation will be…

High Energy Physics - Theory · Physics 2020-12-29 Spyros Konitopoulos

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C. Laskowski

The goal of this paper is to study the possible monoids appearing as the associated monoids of the initial algebra of a finitely generated homogeneous $\Bbbk$-subalgebra of a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. Clearly, any affine…

Commutative Algebra · Mathematics 2024-04-03 Akihiro Higashitani , Koichiro Tani

Constructing artificial lexicons that are pronounceable, typologically plausible, and semantically structured remains an open challenge in computational linguistics. Existing conlang generators either lack formal phonotactic guarantees or…

Computation and Language · Computer Science 2026-05-29 Sankalp Tattwadarshi Swain , Dhruv Kumar

We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to…

Rings and Algebras · Mathematics 2023-01-31 Zarathustra Brady

We discuss the relative log minimal model theory for log surfaces in the analytic setting. More precisely, we show that the minimal model program, the abundance theorem, and the finite generation of log canonical rings hold for log pairs of…

Algebraic Geometry · Mathematics 2026-04-15 Nao Moriyama

The main goal of this paper is to study the class of algebras for which the global dimension of the endomorphism ring of the generator-cogenerator, given by the sum of the projective and injective modules, is equal to three. We will refer…

Representation Theory · Mathematics 2025-04-29 Edson Ribeiro Alvares , Clezio Aparecido Braga , Sonia Trepode , Heily Wagner

We present techniques for reasoning about constructor classes that (like the monad class) fix polymorphic operations and assert polymorphic axioms. We do not require a logic with first-class type constructors, first-class polymorphism, or…

Logic in Computer Science · Computer Science 2012-07-16 Brian Huffman

We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded…

Logic in Computer Science · Computer Science 2023-06-22 Sergey Goncharov , Lutz Schröder , Christoph Rauch , Julian Jakob

Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl , Dan Marsden , Nihil Shah

Deterministic finite automata (DFAs) are constructed for various purposes in computational biology. Little attention, however, has been given to the efficient construction of minimal DFAs. In this article, we define simple non-deterministic…

Formal Languages and Automata Theory · Computer Science 2010-12-10 Tobias Marschall

The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for…

Group Theory · Mathematics 2016-07-19 Ruslan Skuratovskii

It is shown how to construct *-homomorphic quantum stochastic Feller cocycles for certain unbounded generators, and so obtain dilations of strongly continuous quantum dynamical semigroups on C* algebras; this generalises the construction of…

Functional Analysis · Mathematics 2013-05-06 Alexander C. R. Belton , Stephen J. Wills

This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…

Rings and Algebras · Mathematics 2018-12-05 Kieran Hughes , Leo Creedon

Let $\Lambda$ be an artin algebra with representation dimension equal to three and $M$ an Auslander generator of $\Lambda$. We show how, under certain assumptions, we can mutate $M$ to get a new Auslander generator whose endomorphism ring…

Representation Theory · Mathematics 2009-06-30 Magdalini Lada

Codensity monads provide a universal method to generate complex monads from simple functors. Recently, a wide range of important monads in logic, denotational semantics, and probabilistic computation, such as several incarnations of the…

Logic in Computer Science · Computer Science 2026-03-10 Fabian Lenke , Nico Wittrock , Stefan Milius , Henning Urbat
‹ Prev 1 8 9 10 Next ›