相关论文: Quasideterminants
A quadratic Lie algebra is a Lie algebra endowed with a symmetric, invariant and non degenerate bilinear form; such a bilinear form is called an invariant metric. The aim of this work is to describe the general structure of those central…
We use computational linear algebra and commutative algebra to study spaces of relations satisfied by quadrilinear operations. The relations are analogues of associativity in the sense that they are quadratic (every term involves two…
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…
The paper expands the theory of quadratic forms on modules over a semiring R, introduced in [12]-[14], especially in the setup of tropical and supertropical algebra. Isometric linear maps induce subordination on quadratic forms, and provide…
The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…
Our aim in this thesis is to use the language of deformation-quantization to understand certain quantized algebras by looking at properties of the corresponding commutative ones, and conversely to obtain results about the commutative…
An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time complexity of its algorithm. Among all definitions of determinant of rectangular matrices, used definition has special features which make…
The paper deals with a construction of a separating system of rational invariants for finite dimensional generic algebras. In the process of dealing an approach to a rough classification of finite dimensional algebras is offered by…
Using the concept of mixable shuffles, we formulate explicitly the quantum quasi-shuffle product. We also provide a desirable description of the subalgebra generated by the set of primitive elements of the quantum quasi-shuffle bialgebra. A…
Quasi-separable matrices are a class of rank-structured matriceswidely used in numerical linear algebra and of growing interestin computer algebra, with applications in e.g. the linearization ofpolynomial matrices. Various representation…
We call an affine algebraic supergroup quasireductive if its underlying algebraic group is reductive. We obtain some results about the structure and representations of reductive supergroups.
The notion of mixed representations of quivers can be derived from ordinary quiver representations by considering the dual action of groups on "vertex" vector spaces together with the usual action. A generating system for the algebra of…
In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…
In this work we introduce declarative statistics, a suite of declarative modelling tools for statistical analysis. Statistical constraints represent the key building block of declarative statistics. First, we introduce a range of relevant…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly…
The generators of the algebra $gl_{n+1}$ in a form of differential operators of the first order acting on ${\bf R}^n$ with matrix coefficients are explicitly written. The algebraic Hamiltonians for a matrix generalization of $3-$body…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
The full lattices in a finite dimensional commutative ${\mathbb Q}$-algebra form a commutative semigroup. In the case of an algebraic number field the top part of a certain quotient semigroup is the class group. For a separable algebra some…