Related papers: Elimination by Substitution
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
Let $K=k(C)$ be the function field of a complete nonsingular curve $C$ over an arbitrary field $k$. The main result of this paper states that a morphism $\phi:{\mathbb P}^N_K\to{\mathbb P}^N_K$ is isotrivial if and only if it has potential…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
This work aims to introduce the framework of polynomial optimization theory to solve fractional polynomial problems (FPPs). Unlike other widely used optimization frameworks, the proposed one applies to a larger class of FPPs, not…
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…
We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and reduces the total number of homotopy paths that must be…
We propose a new method for constructing elimination templates for efficient polynomial system solving of minimal problems in structure from motion, image matching, and camera tracking. We first construct a particular affine…
Can an ideal I in a polynomial ring k[x] over a field be moved by a change of coordinates into a position where it is generated by binomials $x^a - cx^b$ with c in k, or by unital binomials (i.e., with c = 0 or 1)? Can a variety be moved…
We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…
We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication). The…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its…
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…
Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance…
Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
Motivated by connections between algebraic complexity lower bounds and tensor decompositions, we investigate Koszul-Young flattenings, which are the main ingredient in recent lower bounds for matrix multiplication. Based on this tool we…
We consider isogeometric discretizations of the Poisson model problem, focusing on high polynomial degrees and strong hierarchical refinements. We derive a posteriori error estimates by equilibrated fluxes, i.e., vector-valued mapped…
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…