Related papers: Generators and Bases for Monadic Closures
We generalise classical reconstruction results in algebra, using the language of monads, monoidal categories, module categories, as well as various notions of duality, such as closedness, Grothendieck--Verdier duality (also known as…
Varieties with log terminal and log canonical singularities are considered in the Minimal Model Program, see \cite{...} for introduction. In \cite{shokurov:hyp} it was conjectured that many of the interesting sets, associated with these…
We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of the syntactic monoid. Equivalently, it is the least number of…
We give an explicit way of writing down a minimal set of generators for the canonical ideal of a non-degenerate curve, or of a more general smooth projective curve in a toric surface, in terms of its defining Laurent polynomial.
The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular languages on a two-letter alphabet having arbitrary high…
We prove that monomial ideals with at most five generators and their Artinian reductions have minimal generalized Barile-Macchia resolutions. As a corollary, these ideals have minimal cellular resolutions, extending a result by Faridi, D.G,…
Contemporary large models often exhibit behaviors suggesting the presence of low-level primitives that compose into modules with richer functionality, but these fundamental building blocks remain poorly understood. We investigate this…
Clifford geometric algebras of multivectors are treated in detail. These algebras are build over a graded space and exhibit a grading or multivector structure. The careful study of the endomorphisms of this space makes it clear, that…
In this article, we first give a short introduction to conformal algebras. Then we present three families of simple conformal algebras finite growth generated by simple Jordan algebras of types A, B, C.
Motivated by a problem in graph theory, this article introduces an algebra called the balanced algebra. This algebra is defined by generators and relations, and the main goal is to find a minimal set of relations for it.
Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…
Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…
Based on Bergman's Lemma on centralizers, we obtain a sharp lower degree bound for nonconstant elements in a subalgebra generated by two elements of a free associative algebra over an arbitrary field.
We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…
For finitary regular monads T on locally finitely presentable categories we characterize the finitely presentable objects in the category of T-algebras in the style known from general algebra: they are precisely the algebras presentable by…
In this paper, we study the minimal generating system of the canonical module of a Hibi ring. Using the results, we state a characterization of a Hibi ring to be level. We also give a characterization of a Hibi ring to be of type 2.…
We compute a complete set of non-isomorphic minimal Auslander generators for the exterior algebra in two variables.
This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed by a specification monad. We prove that any monad morphism…
Large-scale natural language generation requires the integration of vast amounts of knowledge: lexical, grammatical, and conceptual. A robust generator must be able to operate well even when pieces of knowledge are missing. It must also be…