Related papers: Modular absolute decomposition of equidimensional …
In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…
We show how all the quantal systems related to the exceptional Laguerre and Jacobi polynomials can be constructed in a direct and systematic way, without the need of shape invariance and Darboux-Crum transformation. Furthermore, the…
We prove two criteria for direct sum decomposability of homogeneous polynomials. For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of…
The implementation of discontinuous functions occurs in many of today's state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when…
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
Let $R = K[x_1, x_2, x_3, x_4]$ be the polynomial ring over a field of characteristic zero. For the ideal $(x_1^a, x_2^b, x_3^c, x_4^d) \subset R$, where at least one of $a$, $b$, $c$ and $d$ is equal to two, we prove that its generic…
A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
After sketching the basic theory of injective ideals of homogeneous polynomials, we characterize injective polynomial ideals by means of a domination property and applications of this characterization to some classical operator ideals and…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We will use commutators to provide decompositions of $3\times 3$ matrices as sums whose terms satisfy some polynomial identities, and we apply them to bounded linear operators and endomorphisms of free modules of infinite rank. In…
For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…
Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…
In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
Many Hilbert modules over the polynomial ring in m variables are essentially reductive, that is, have commutators which are compact. Arveson has raised the question of whether the closure of homogeneous ideals inherit this property and…
Let $f(X,Y) \in \ZZ[X,Y]$ be an irreducible polynomial over $\QQ$. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of $f$, or more precisely, of $f$ modulo some prime integer $p$. The same idea of…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
Almost block diagonal linear systems of equations can be exemplified by two modules. This makes it possible to construct all sequential forms of band and/or block elimination methods, six old and fourteen new. It allows easy assessment of…
Let $\mathcal{A}$ be an affine hyperplane arrangement, $L(\mathcal{A})$ its intersection poset, and $\chi_{\mathcal{A}}(t)$ its characteristic polynomial. This paper aims to propose combinatorial structures for the factorization of…