English
Related papers

Related papers: Well-Pointed Coalgebras

200 papers

We classify pointed Hopf algebras of discrete corepresentation type over an algebraically closed field K with characteristic zero. For such algebras $H$, we explicitly determine the algebra structure up to isomorphism for the link…

Representation Theory · Mathematics 2022-11-02 Miodrag Iovanov , Emre Sen , Alexander Sistko , Shijie Zhu

We study a non-pointed version of the notion of torsion theory in the framework of categories equipped with a posetal monocoreflective subcategory such that the coreflector inverts monomorphisms. We explore the connections of such torsion…

Category Theory · Mathematics 2026-04-09 Andrea Cappelletti , Andrea Montoli

This paper provides the next step towards classification of algebras of generalized quaternion type. Previously algebras with 2-regular Gabriel quiver were classified (a quiver is 2-regular if at each vertex, two arrows start and two arrows…

Representation Theory · Mathematics 2026-03-17 Karin Erdmann , Adam Hajduk , Adam Skowyrski

We extend homological perturbation theory to encompass algebraic structures governed by operads and cooperads. The main difficulty is to find a suitable notion of algebra homotopy that generalizes to algebras over operads O. To solve this…

Algebraic Topology · Mathematics 2016-01-20 Alexander Berglund

For every finitary monad $T$ on sets and every endofunctor $F$ on the category of $T$-algebras we introduce the concept of an ffg-Elgot algebra for $F$, that is, an algebra admitting coherent solutions for finite systems of recursive…

Logic in Computer Science · Computer Science 2021-09-10 Stefan Milius , Jiří Adámek , Henning Urbat

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

We introduce a class of noncommutatative algebras called representation complete intersections (RCI). A graded associative algebra A is said to be RCI provided there exist arbitrarily large positive integers n such that the scheme Rep_n(A),…

Algebraic Geometry · Mathematics 2007-05-23 Pavel Etingof , Victor Ginzburg

An endo-commutative algebra is a nonassociative algebra in which the square mapping preserves multiplication. In this paper, we give a complete classification of 2-dimensional endo-commutative straight algebras of rank one over an arbitrary…

Rings and Algebras · Mathematics 2023-05-30 Sin-Ei Takahasi , Kiyoshi Shirayanagi , Makoto Tsukada

Given a ternary homogeneous polynomial, the fixed points of the map from $\mathbb{P}^2$ to itself defined by its gradient are called its eigenpoints. We focus on cubic polynomials, and analyze configurations of eigenpoints that admit one or…

Algebraic Geometry · Mathematics 2024-07-24 Valentina Beorchia , Matteo Gallet , Alessandro Logar

We investigate the notion of associated graded coalgebra (algebra) of a bialgebra with respect to a subbialgebra (quotient bialgebra) and characterize those which are bialgebras of type one in the framework of abelian braided monoidal…

Category Theory · Mathematics 2010-07-21 A. Ardizzoni , C. Menini

The aim of this paper is to build a theory of commutative and noncommutative {\it injective} valuations of various algebras (including algebras with zero divisors). The targets of our valuations are (well-)ordered commutative and…

Rings and Algebras · Mathematics 2025-08-20 Arkady Berenstein , Dima Grigoriev

Algebras axiomatized entirely by rank 1 axioms are algebras for a functor and thus the free algebras can be obtained by a direct limit process. Dually, the final coalgebras can be obtained by an inverse limit process. In order to explore…

Logic in Computer Science · Computer Science 2015-07-01 Nick Bezhanishvili , Mai Gehrke

We define a family of structures called "opetopic algebras", which are algebraic structures with an underlying opetopic set. Examples of such are categories, planar operads, and Loday's combinads over planar trees. Opetopic algebras can be…

Category Theory · Mathematics 2020-01-23 Cédric Ho Thanh , Chaitanya Leena Subramaniam

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist

In this article, we give two examples of finitely presented quadratic algebras (algebras presented by quadratic relations) of intermediate growth.

Rings and Algebras · Mathematics 2015-06-04 Dilber Kocak

We develop an obstruction theory for the existence of gauge equivalences in complete differential graded Lie algebras. Specifically, this theory provides a characterization of homotopy equivalences between differential graded algebras…

Algebraic Topology · Mathematics 2025-09-23 Coline Emprin

Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra $\mathbb{B}$ of finite rank…

Rings and Algebras · Mathematics 2019-08-28 Wolfram Bentz , Victoria Gould

We study a class of infinite dimensional Lie algebras called generalized Witt algebras (in one variable). These include the classical Witt algebra and the centerless Virasoro algebra as important examples. We show that any such generalized…

Rings and Algebras · Mathematics 2013-05-06 Jonathan Pakianathan , Ki Bong Nam

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

Mathematical Physics · Physics 2023-07-20 Danilo Latini , Ian Marquette , Yao-Zhong Zhang

Categorical studies of recursive data structures and their associated reasoning principles have mostly focused on two extremes: initial algebras and induction, and final coalgebras and coinduction. In this paper we study their in-betweens.…

Logic in Computer Science · Computer Science 2018-03-20 Natsuki Urabe , Ichiro Hasuo