In this paper, it is proved that any algehraicgeometr ic code can be expressed as a cross section of an extended multidimensional cyclic code. Both algebraic-geometric codes and multidimensional cyclic codes are descr ibed by a unified theory of l inear block codes def ined over point sets: algebraic-geometric codes are def ined over the points of an algebraic curve, and an m-dimensional cyclic...

We present an implementation of the algorithms for computing comprehensive Gröbner bases in a Java computer algebra system (JAS). Contrary to approaches to implement comprehensive Gröbner bases with minimal requirements to the computer algebra system, we aim to provide and utilize all necessary algebraic structures occurring in the algorithm. In the implementation of a condition we aim at the m...

The Gröbner fan of an ideal I ⊂ k[x1, . . . , xn], defined by Mora and Robbiano, is a complex of polyhedral cones in Rn. The maximal cones of the fan are in bijection with the distinct monomial initial ideals of I as the term order varies. If I is homogeneous the Gröbner fan is complete and is the normal fan of the state polytope of I. In general the Gröbner fan is not complete and therefore no...

A comprehensive identification of sphingoid bases and ceramides in wild Cordyceps was performed by integrating a sequential chromatographic enrichment procedure and an UHPLC-ultrahigh definition-Q-TOF-MS based sphingolipidomic approach. A total of 43 sphingoid bases and 303 ceramides were identified from wild Cordyceps, including 12 new sphingoid base analogues and 159 new ceramide analogues ba...

Quadratization is a transform of system ODEs with polynomial right-hand side into at most quadratic via the introduction new variables. It has been recently used as pre-processing step for model order reduction methods, so it important to keep number variables small. Several algorithms have designed search quadratization being monomials in original To understand limitations and potential ways i...

a r t i c l e i n f o a b s t r a c t A new approach is proposed for computing a comprehensive Gröb-ner basis of a parameterized polynomial system. The key new idea is not to simplify a polynomial under various specialization of its parameters, but rather keep track in the polynomial, of the power products whose coefficients vanish; this is achieved by partitioning the polynomial into two parts...

This article investigates the forward kinematics problem formulation and resolution specifically applied to spatial parallel manipulators which allow only for translationnal displacements of the end-effector. The translation manipulator is usually constituted of three to six kinematics chains with three actuators usually located on the base. These mechanisms are designed to prevent any rotation...