Finitary monads on the category of posets

Finitary monads on Pos are characterized as precisely the free-algebra monads of varieties of algebras. These are classes of ordered algebras specified by inequations in context. Analogously, finitary enriched monads on Pos are characterized: here we work with varieties of coherent algebras which means that their operations are monotone.

Varieties of Null-Filiform Leibniz Algebras Under the Action of Hopf Algebras

Let L be an n-dimensional null-filiform Leibniz algebra over a field K. We consider a finite dimensional cocommutative Hopf algebra or a Taft algebra H and we describe the H-actions on L. Moreover we provide the set of H-identities and the description of the Sn-module structure of the relatively free algebra of L.

Symmetric polynomials in the variety generated by Grassmann algebras

Let [Formula: see text] denote the variety generated by infinite-dimensional Grassmann algebras, i.e. the collection of all unitary associative algebras satisfying the identity [Formula: see text], where [Formula: see text]. Consider the free algebra [Formula: see text] in [Formula: see text] generated by [Formula: see text]. We call a polynomial [Formula: see text] symmetric if it is preserved under the action of the symmetric group [Formula: see text] on generators, i.e. [Formula: see text] for each permutation [Formula: see text]. The set of symmetric polynomials forms the subalgebra [Formula: see text] of invariants of the group [Formula: see text] in [Formula: see text]. The commutator ideal [Formula: see text] of the algebra [Formula: see text] has a natural left [Formula: see text]-module structure, and [Formula: see text] is a left [Formula: see text]-module. We give a finite free generating set for the [Formula: see text]-module [Formula: see text].

On Multimatrix Models Motivated by Random Noncommutative Geometry I: The Functional Renormalization Group as a Flow in the Free Algebra

Random noncommutative geometry can be seen as a Euclidean path-integral quantization approach to the theory defined by the Spectral Action in noncommutative geometry (NCG). With the aim of investigating phase transitions in random NCG of arbitrary dimension, we study the nonperturbative Functional Renormalization Group for multimatrix models whose action consists of noncommutative polynomials in Hermitian and anti-Hermitian matrices. Such structure is dictated by the Spectral Action for the Dirac operator in Barrett’s spectral triple formulation of fuzzy spaces. The present mathematically rigorous treatment puts forward “coordinate-free” language that might be useful also elsewhere, all the more so because our approach holds for general multimatrix models. The toolkit is a noncommutative calculus on the free algebra that allows to describe the generator of the renormalization group flow—a noncommutative Laplacian introduced here—in terms of Voiculescu’s cyclic gradient and Rota–Sagan–Stein noncommutative derivative. We explore the algebraic structure of the Functional Renormalization Group equation and, as an application of this formalism, we find the $$\beta $$ β -functions, identify the fixed points in the large-N limit and obtain the critical exponents of two-dimensional geometries in two different signatures.

Factorization of Noncommutative Polynomials and Nullstellensätze for the Free Algebra

This article gives a class of Nullstellensätze for noncommutative polynomials. The singularity set of a noncommutative polynomial $f=f(x_1,\dots ,x_g)$ is $\mathscr{Z}(\,f)=(\mathscr{Z}_n(\,f))_n$, where $\mathscr{Z}_n(\,f)=\{X \in{\operatorname{M}}_{n}({\mathbb{C}})^g \colon \det f(X) = 0\}.$ The 1st main theorem of this article shows that the irreducible factors of $f$ are in a natural bijective correspondence with irreducible components of $\mathscr{Z}_n(\,f)$ for every sufficiently large $n$. With each polynomial $h$ in $x$ and $x^*$ one also associates its real singularity set $\mathscr{Z}^{{\operatorname{re}}}(h)=\{X\colon \det h(X,X^*)=0\}$. A polynomial $f$ that depends on $x$ alone (no $x^*$ variables) will be called analytic. The main Nullstellensatz proved here is as follows: for analytic $f$ but for $h$ dependent on possibly both $x$ and $x^*$, the containment $\mathscr{Z}(\,f) \subseteq \mathscr{Z}^{{\operatorname{re}}} (h)$ is equivalent to each factor of $f$ being “stably associated” to a factor of $h$ or of $h^*$. For perspective, classical Hilbert-type Nullstellensätze typically apply only to analytic polynomials $f,h $, while real Nullstellensätze typically require adjusting the functions by sums of squares of polynomials (sos). Since the above “algebraic certificate” does not involve a sos, it seems justified to think of this as the natural determinantal Hilbert Nullstellensatz. An earlier paper of the authors (Adv. Math. 331 (2018): 589–626) obtained such a theorem for special classes of analytic polynomials $f$ and $h$. This paper requires few hypotheses and hopefully brings this type of Nullstellensatz to near final form. Finally, the paper gives a Nullstellensatz for zeros ${\mathcal{V}}(\,f)=\{X\colon f(X,X^*)=0\}$ of a hermitian polynomial $f$, leading to a strong Positivstellensatz for quadratic free semialgebraic sets by the use of a slack variable.

Primitive recursion in the abstract

Recurrence can be used as a function definition schema for any nontrivial free algebra, yielding the same computational complexity in all cases. We show that primitive-recursive computing is in fact independent of free algebras altogether, and can be characterized by a generic programming principle, namely the control of iteration by the depletion of finite components of the underlying structure.

Additive primitive length in relatively free algebras

The additive primitive length of an element [Formula: see text] of a relatively free algebra [Formula: see text] in a variety of algebras [Formula: see text] is equal to the minimal number [Formula: see text] such that [Formula: see text] can be presented as a sum of [Formula: see text] primitive elements. We give an upper bound for the additive primitive length of the elements in the [Formula: see text]-generated polynomial algebra over a field of characteristic 0, [Formula: see text]. The bound depends on [Formula: see text] and on the degree of the element. We show that if the field has more than two elements, then the additive primitive length in free [Formula: see text]-generated nilpotent-by-abelian Lie algebras is bounded by 5 for [Formula: see text] and by 6 for [Formula: see text]. If the field has two elements only, then our bounds are 6 for [Formula: see text] and 7 for [Formula: see text]. This generalizes a recent result of Ela Aydın for two-generated free metabelian Lie algebras. In all cases considered in the paper, the presentation of the elements as sums of primitive elements can be found effectively in polynomial time.