Related papers: A Constructive Characterization of Solvable Polyno…
Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…
We compare some algebras appeared in the recent attempts to prove resolution of singularities in positive characteristic. We also construct an algebra which encodes the same information and it is equivalent, up to integral closure, to the…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We discuss the explicit construction of the Schroedinger equations admitting a representation through some family of general polynomials. Almost all solvable quantum potentials are shown to be generated by this approach. Some generalization…
We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent…
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
Criteria are given for determining whether an irreducible sextic equation with rational coefficients is algebraically solvable over the complex numbers.
This is a simple way rigorously to construct Grassmann, Clifford and Geometric Algebras, allowing degenerate bilinear forms, infinite dimension, using fields or certain modules (characteristic 2 with limitation) - and characterize the…
This paper presents a classification of 7-dimensional real and complex indecomposable solvable Lie algebras having some 5-dimensional nilradicals. Afterwards, we combine our results with those of Rubin and Winternitz (1993), Ndogmo and…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
It is shown that universal algebras that are injective in their equational classes are characterized by internal property that can be called completeness. We define universal algebra $A$ as complete (closed to simple extensions) if for each…
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…
We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…
For a sequence of the naturally graded quasi-filiform Leibniz algebra of second type $\mathcal{L}^4$ introduced by Camacho, G\'{o}mez, Gonz\'{a}lez and Omirov, all the possible right solvable indecomposable extensions over the field $\Bbb…
Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras…
A necessary and sufficient condition for a central simple algebra with involution over a field of characteristic two to be decomposable as a tensor product of quaternion algebras with involution, in terms of its Frobenius subalgebras, is…
Let $\mathbb{K}$ be a field, $\mathcal{X}$ be an infinite set (of indeterminates), and $\mathcal{G}$ be a group acting on $\mathcal{X}$. An ideal in the polynomial ring $\mathbb{K}[\mathcal{X}]$ is called equivariant if it is invariant…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…