Related papers: On Affine Tropical F5 Algorithms

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

We define vector bundles for tropical schemes, and explore their properties. The paper largely consists of three parts; (1) we study free modules over zero-sum free semirings, which provide the necessary algebraic background for the theory…

We give a short tour through major parts of a recent long paper [IKR1] on supertropical valuation theory, leaving aside nearly all proofs (to be found in [IKR1]). In this way we hope to give easy access to ideas of a new branch of so called…

Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…

Phylogenetic trees provide a fundamental representation of evolutionary relationships, yet the combinatorial explosion of possible tree topologies renders inference computationally challenging. Classical approaches to characterizing tree…

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…

We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…

We consider the action of a permutation group $G$ of order $k$ on the tropical polynomial semiring in $n$ variables. We prove that the sub-semiring of invariant polynomials is finitely generated if and only if $G$ is generated by…

We present a generic and executable formalization of signature-based algorithms (such as Faug\`ere's $F_5$) for computing Gr\"obner bases, as well as their mathematical background, in the Isabelle/HOL proof assistant. Said algorithms are…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

We present basic properties of Gr\"obner bases of submodules of a free module of finite rank over a polynomial ring $R$ with coefficients in a graded truncated discrete valuations ring $A$. As an application, we give a criterion for a…

Tropicalizations form a bridge between algebraic and convex geometry. We generalize basic results from tropical geometry which are well-known for special ground fields to arbitrary non-archimedean valued fields. To achieve this, we develop…

In this paper we present a new efficient variant to compute strong Gr\"obner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduce one computation over the quotient $R/nR$ to two…

The symmetrized tropical semiring is an extension of the tropical semifield, initially introduced to solve tropical linear systems using Cramer's rule. It is equivalent to the real tropical hyperfield, which has been used in the study of…

We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…

Tropical linear algebra has been recently put forward by Grigoriev and Shpilrain as a promising platform for implementation of protocols of Diffie-Hellman and Stickel type. Based on the CSR expansion of tropical matrix powers, we suggest a…

We interpret a valuation $v$ on a ring $R$ as a map $v: R \to M$ into a so called bipotent semiring $M$ (the usual max-plus setting), and then define a \textbf{supervaluation} $\phi$ as a suitable map into a supertropical semiring $U$ with…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

We show that in the constant coefficient case the generic tropical variety of a graded ideal exists. This can be seen as the analogon to the existence of the generic initial ideal in Groebner basis theory. We determine the generic tropical…