Related papers: Nominal Coalgebraic Data Types with Applications t…
We provide some background on the category of classifiable $\mathrm{C}^*$-algebras, whose objects are infinite-dimensional, simple, separable, unital $\mathrm{C}^*$-algebras that have finite nuclear dimension and satisfy the universal…
The purpose of this paper is to investigate finite-dimensional superbialgebras and Hopf superalgebras. We study connected superbialgebras and provide a classification of non-trivial superbialgebras and Hopf superalgebras in dimension $n$…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
We show that for any finite-dimensional algebra $\Lambda$ of infinite representation type, over a perfect field, there is a bounded principal ideal domain $\Gamma$ and a representation embedding from $\Gamma -$mod into $\Lambda -$mod. As an…
The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…
In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…
The Nichols algebras of diagonal type with finite root system are either of standard, super or (yet) unidentified type. A concrete description of the defining relations of all those Nichols algebras was given in \cite{A-exp presentation}.…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
These notes aim to provide a classical approach to solving some conformable differential equations based on prior knowledge of how to solve ordinary differential equations. That is, using the methods of separation of variables, homogeneous…
Let $\Lambda$ be a finite dimensional algebra such that $\mathcal{L}_{\Lambda}$ or $\mathcal{R}_{\Lambda}\neq\emptyset$. Then $\Lambda$ is $\tau$-tilting finite if and only if $\Lambda$ is representation-finite.
We classify mutation-finite cluster algebras with arbitrary coefficients of geometric type.
We describe a deterministic process to associate a practical, permanent label to isomorphism classes of abelian varieties defined over finite fields with commutative endomorphism algebra as long as they are ordinary or defined over a prime…
We study the concept of extended derivations of algebras which expands diverse definitions of generalized derivations given in the literature. We concentrate on the family of the anti-commutative algebras and classify such spaces of…
The algebraic $\lambda$-calculus is an extension of the ordinary $\lambda$-calculus with linear combinations of terms. We establish that two ordinary $\lambda$-terms are equivalent in the algebraic $\lambda$-calculus iff they are…
There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
Nominal unification calculates substitutions that make terms involving binders equal modulo alpha-equivalence. Although nominal unification can be seen as equivalent to Miller's higher-order pattern unification, it has properties, such as…
The logical technique of focusing can be applied to the $\lambda$-calculus; in a simple type system with atomic types and negative type formers (functions, products, the unit type), its normal forms coincide with $\beta\eta$-normal forms.…