Related papers: A Constructive Characterization of Solvable Polyno…
Factoring out the spin $1$ subalgebra of a $ W $ algebra leads to a new $ W $ structure which can be seen either as a rational finitely generated $ W $ algebra or as a polynomial non-linear $ W_\infty$ realization.
Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…
We introduce a notion of unstable algebra over an operad in general characteristic. We show that the unstable algebra freely generated by an unstable module is itself a free algebra under suitable conditions. We introduce a family of…
Polyhedral affinoid algebras have been introduced by Einsiedler, Kapranov and Lind to connect rigid analytic geometry (analytic geometry over non-archimedean fields) and tropical geometry. In this article, we present a theory of Gr{\"o}bner…
In constructive algebra one cannot in general decide the irreducibility of a polynomial over a field K. This poses some problems to showing the existence of the algebraic closure of K. We give a possible constructive interpretation of the…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…
In this paper, we mainly study structure of multiplicative simple Hom-Jordan algebras. We talk about equivalent conditions for multiplicative Hom-Jordan algebras being solvable, simple and semi-simple. As an application, we give a theorem…
In general, the study of gradations has always represented a cornerstone in algebra theory. In particular, \textit{naturally graded} seems to be the first and the most relevant gradation when it comes to nilpotent algebras, a large class of…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper, we begin the study of how to exploit chordal structure in…
In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We study rational Cherednik algebras over an algebraically closed field of positive characteristic. We first prove several general results about category O, and then focus on rational Cherednik algebras associated to the general and special…
In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…
This is an old paper put here for archeological purposes. It is proved that a finite-dimensional Lie algebra over a field of characteristic p>5, that can be written as a vector space (not necessarily direct) sum of two nilpotent…
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…