Related papers: Universal Analytic Gr{\"o}bner Bases and Tropical …
For any differential graded (DG for short) Poisson algebra $A$ given by generators and relations, we give a "formula" for computing the universal enveloping algebra $A^e$ of $A$. Moreover, we prove that $A^e$ has a Poincar\'e-Birkhoff-Witt…
A toric ideal is called robust if its universal Gr\"obner basis is a minimal set of generators, and is called generalized robust if its universal Gr\"obner basis equals its universal Markov basis (the union of all its minimal sets of…
The universal R-matrices and, dually, the coquasitriangular structures of the group Hopf algebra of a finite Abelian group (resp. of an arbitrary Abelian group) are determined. This is used to formulate graded multilinear algebra in terms…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
We consider the problem of mutually unbiased bases as a polynomial optimization problem over the reals. We heavily reduce it using known symmetries before exploring it using two methods, combining a number of optimization techniques. The…
We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module.
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…
In this paper, we discuss the convergence of an Algebraic MultiGrid (AMG) method for general symmetric positive-definite matrices. The method relies on an aggregation algorithm, named \emph{coarsening based on compatible weighted matching},…
A Gr\"obner basis computation for the Weyl algebra with respect to a tropical term order and by using a homogenization-dehomogenization technique is sufficiently sluggish. A significant number of reductions to zero occur. To improve the…
This is a survey article written for the Jahresberichte der DMV. Tropical geometry can be viewed as an efficient combinatorial tool to study degenerations in algebraic geometry. Abstract tropical curves are essentially metric graphs, and…
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…
The computation of Gr\"obner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robust. In this paper, we frame and present results on the…
The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
We introduce the notion of dual perfect bases and dual perfect graphs. We show that every integrable highest weight module $V_q(\lambda)$ over a quantum generalized Kac-Moody algebra $U_{q}(\mathcal{g})$ has a dual perfect basis and its…
In this article we obtain lower and upper bounds for global dimensions of a class of artinian algebras in terms of global dimensions of a finite subset of their artinian subalgebras. Finding these bounds for the global dimension of an…
In this article, we introduce and investigate a class of C$^{\ast}$-algebras generated by reduced graph products of C$^{\ast}$-algebras, augmented with families of projections naturally associated with words in right-angled Coxeter groups.…
Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and…
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…