Related papers: An Alternative Method for Primary Decomposition of…
In this article, we study the primary decomposition of some binomial ideals. In particular, we introduce the concept of polyocollection, a combinatorial object that generalizes the definitions of collection of cells and polyomino, that can…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
The decomposition or approximation of a linear operator on a matrix space as a sum of Kronecker products plays an important role in matrix equations and low-rank modeling. The approximation problem in Frobenius norm admits a well-known…
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…
When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…
We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gr\"obner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite…
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…
We show how tropical varieties of ideals I over a field K with non-trivial valuation can be traced back to tropical varieties of ideals in R[[t]][x] over some dense subring R in its ring of integers. Moreover, for homogeneous ideals, we…
Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…
Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…
The Bernstein-B\'ezier form of a polynomial is widely used in the fields of computer aided geometric design, spline approximation theory and, more recently, for high order finite element methods for the solution of partial differential…
Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…
This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series…
Generalized Frobenius powers of an ideal were introduced in work of Hern\'andez, Teixeira, and Witt as characteristic-dependent analogs of test ideals. However, little is known about the Frobenius powers and critical exponents of specific…
An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion…
We consider a finite element method for elliptic equation with heterogeneous and possibly high-contrast coefficients based on primal hybrid formulation. A space decomposition as in FETI and BDCC allows a sequential computations of the…