Related papers: Complexity of Triangular Representations of Algebr…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…
We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support a tridiagonal matrix representation of the wave operator. Doing so results in exactly solvable problems with a…
The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…
Let $A$ be a finite dimensional associative algebra over a perfect field and let $R$ be the radical of $A$. We show that for every one-sided ideal $I$ of $A$ there exists a semisimple subalgebra $S$ of $A$ such that $I=I_{S}\oplus I_{R}$…
Let $R$ be a polynomial ring over a field. We describe the extremal rays and the facets of the cone of local cohomology tables of finitely generated graded $R$-modules of dimension at most two. Moreover, we show that any point inside the…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
In this paper, a numerical method is proposed for canonical polyadic (CP) decomposition of small size tensors. The focus is primarily on decomposition of tensors that correspond to small matrix multiplications. Here, rank of the tensors is…
We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…
Without any restrictions on the base field, we compute the hull and prove a conjecture of Eisenbud and Sturmfels giving an unmixed decomposition of a cellular binomial ideal. Over an algebraically closed field, we further obtain an explicit…
We introduce deformations of Kazhdan-Lusztig elements and specialised nonsymmetric Macdonald polynomials, both of which form a distinguished basis of the polynomial representation of a maximal parabolic subalgebra of the Hecke algebra. We…
We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
The aim of this paper is to represent any polynomial in terms of the degenerate Frobenius-Euler polynomials and more generally of the higher-order degenerate Frobenius-Euler polynomials. We derive explicit formulas with the help of umbral…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…
In this survey, we first review some known results on the representation theory of algebras with triangular decomposition, including the classification of the simple modules. We then discuss a recipe to construct Hopf algebras with…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…
We describe a general approach for computing generators for elimination ideals associated with matrix and hypermatrix spectral decomposition constraints. We derive from these generators iterative procedures for approximating the spectral…