Related papers: Decomposition of polynomial sets into characterist…
A matching set $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. In this paper we consider some parameters related to the matching of regular graphs. We find the sixth coefficient of the…
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
The matching polytope of a graph $G$ is the convex hull of the indicator vectors of the matchings on $G$. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
The concept of descent algebras over a field of characteristic zero is extended to define descent algebras over a field of prime characteristic. Some basic algebraic structure of the latter, including its radical and irreducible modules, is…
Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…
Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The…
We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
We introduced previously the generalized characteristic polynomial defined by $P_C(\lambda)={\rm det}\,C(\lambda),$ where $C(\lambda)=C+{\rm diag}\big(\lambda_1,\dots,\lambda_n\big)$ for $C\in {\rm Mat}(n,\mathbb C)$ and…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real…
We analyze the decomposition problem of multivariate polynomial-exponential functions from truncated series and present new algorithms to compute their decomposition. Using the duality between polynomials and formal power series, we first…
In a recent article, we gave a full characterization of matrices that can be decomposed as a linear combination of two idempotents with prescribed coefficients. In this one, we use those results to improve on a recent theorem of V.…
Let F be characteristic zero field, G a residually finite group and W a G-prime and PI F-algebra. By constructing G-graded central polynomials for W, we prove the G-graded version of Posner's theorem. More precisely, if S denotes all…
Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
The purpose of the present work is to describe a dequantization procedure for topological modules over a deformed algebra. We define the characteristic variety of a topological module as the common zeroes of the annihilator of the…