Related papers: Algebraic systems of matrices and Grobner basis
We propose and implement an algorithm for solving an overdetermined system of partial differential equations in one unknown. Our approach relies on Bour-Mayer method to determine compatibility conditions via Jacobi-Mayer brackets. We solve…
This is an introduction to linear algebra and group theory. We first review the linear algebra basics, namely the determinant, the diagonalization procedure and more, and with the determinant being constructed as it should, as a signed…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
Differential equation models are crucial to scientific processes. The values of model parameters are important for analyzing the behaviour of solutions. A parameter is called globally identifiable if its value can be uniquely determined…
We propose a new polynomial-time algorithm for linear programming. We further extend the ideas used in this new linear programming algorithm for nonlinear programming problems. The new algorithm is based on the idea of treating the…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra and computational algebra), geometry and combinatorics to provide insight into knotty problems in mathematical statistics. In this survey…
Every state on the algebra $M_n$ of complex nxn matrices restricts to a state on any matrix system. Whereas the restriction to a matrix system is generally not open, we prove that the restriction to every *-subalgebra of $M_n$ is open. This…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
This is an exercise based approach to matrix groups. The idea is to collect a bunch of exercises at one place which anyone with basic knowledge of linear algebra can attempt to solve and learn matrix groups and algebraic groups.
We present a method to compute the Euler characteristic of an algebraic subset of $\bc^n$. This method relies on clasical tools such as Gr\"obner basis and primary decomposition. The existence of this method allows us to define a new…
The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…
We will pursue a way of building up an algebraic structure that involves, in a mathematical abstract way, the well known Grassmann variables. The problem arises when we tried to understand the grassmannian polynomial expansion on the scope…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
Gr\"obner Bases and Cylindrical Algebraic Decomposition are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…