Related papers: On quantized decomposition maps for graded algebra…
We study the central extensions of Lie algebras graded by an irreducible locally finite root system.
Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…
We obtain the double factorization of braided bialgebras or braided Hopf algebras, give relation among integrals and semisimplicity of braided Hopf algebra and its factors.
It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…
We determine when a generalized down-up algebra is a Noetherian unique factorisation domain or a Noetherian unique factorisation ring.
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
We discuss issues of problem formulation for algorithms in real algebraic geometry, focussing on quantifier elimination by cylindrical algebraic decomposition. We recall how the variable ordering used can have a profound effect on both…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…
Differential graded (DG) algebras are powerful tools from rational homotopy theory. We survey some recent applications of these in the realm of homological commutative algebra.
We study the plane automorphisms given by polynomials with certain degree decompositions.
We study the graded limits of minimal affinizations over a quantum loop algebra of type D in the regular case. We show that the graded limits are isomorphic to multiple generalizations of Demazure modules, and also give their defining…
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…
In this paper, we establish explicit relationship between decomposition numbers of quantized walled Brauer algebras and those for either Hecke algebras associated to certain symmetric groups or (rational) $q$-Schur algebras over a field…
The classification, both up to isomorphism or up to equivalence, of the gradings on a finite dimensional nonassociative algebra A over an algebraically closed field F, such that its group scheme of automorphisms is smooth, is shown to be…
We give an algebraic characterization of half-factorial orders in algebraic number fields. This generalizes prior results for seminormal orders and for orders in quadratic number fields.
We study certain filtered deformations of the external zonotopal algebra of a given graph parametrized by univariate polynomials. We establish some general properties of these algebras, compute their Hilbert series for a number of graphs…
In this article we shows some results about algebra with the group of units having special polynomial identity.
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…