Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn Affine Tropical F5 Algorithms
240
0
0.0
(
0
)
Added by
Tristan Vaccon
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Let $K$ be a field equipped with a valuation. Tropical varieties over $K$ can be defined with a theory of Gr{o}bner bases taking into account the valuation of $K$.Because of the use of the valuation, the theory of tropical Gr{o}bner bases has proved to provide settings for computations over polynomial rings over a $p$-adic field that are more stable than that of classical Gr{o}bner bases.Beforehand, these strategies were only available for homogeneous polynomials. In this article, we extend the F5 strategy to a new definition of tropical Gr{o}bner bases in an affine setting.We provide numerical examples to illustrate time-complexity and $p$-adic stability of this tropical F5 algorithm.We also illustrate its merits as a first step before an FGLM algorithm to compute (classical) lex bases over $p$-adics.
rate research
Read More
Let $f_1,...,f_s in mathbb{K}[x_1,...,x_m]$ be a system of polynomials generating a zero-dimensional ideal $I$, where $mathbb{K}$ is an arbitrary algebraically closed field. We study the computation of matrices of traces for the factor algebra $A := CC[x_1, ..., x_m]/ I$, i.e. matrices with entries which are trace functions of the roots of $I$. Such matrices of traces in turn allow us to compute a system of multiplication matrices ${M_{x_i}|i=1,...,m}$ of the radical $sqrt{I}$. We first propose a method using Macaulay type resultant matrices of $f_1,...,f_s$ and a polynomial $J$ to compute moment matrices, and in particular matrices of traces for $A$. Here $J$ is a polynomial generalizing the Jacobian. We prove bounds on the degrees needed for the Macaulay matrix in the case when $I$ has finitely many projective roots in $mathbb{P}^m_CC$. We also extend previous results which work only for the case where $A$ is Gorenstein to the non-Gorenstein case. The second proposed method uses Bezoutian matrices to compute matrices of traces of $A$. Here we need the assumption that $s=m$ and $f_1,...,f_m$ define an affine complete intersection. This second method also works if we have higher dimensional components at infinity. A new explicit description of the generators of $sqrt{I}$ are given in terms of Bezoutians.
The software TrIm offers implementations of tropical implicitization and tropical elimination, as developed by Tevelev and the authors. Given a polynomial map with generic coefficients, TrIm computes the tropical variety of the image. When the image is a hypersurface, the output is the Newton polytope of the defining polynomial. TrIm can thus be used to compute mixed fiber polytopes, including secondary polytopes.
In this note we look at the freeness for complex affine hypersurfaces. If $X subset mathbb{C}^n$ is such a hypersurface, and $D$ denotes the associated projective hypersurface, obtained by taking the closure of $X$ in $mathbb{P}^n$, then we relate first the Jacobian syzygies of $D$ and those of $X$. Then we introduce two types of freeness for an affine hypersurface $X$, and prove various relations between them and the freeness of the projective hypersurface $D$. We write down a proof of the folklore result saying that an affine hypersurface is free if and only if all of its singularities are free, in the sense of K. Saitos definition in the local setting. In particular, smooth affine hypersurfaces and affine plane curves are always free. Some other results, involving global Tjurina numbers and minimal degrees of non trivial syzygies are also explored.
We survey the status of decidabilty of the consequence relation in various axiomatizations of Euclidean geometry. We draw attention to a widely overlooked result by Martin Ziegler from 1980, which proves Tarskis conjecture on the undecidability of finitely axiomatizable theories of fields. We elaborate on how to use Zieglers theorem to show that the consequence relations for the first order theory of the Hilbert plane and the Euclidean plane are undecidable. As new results we add: (A) The first order consequence relations for Wus orthogonal and metric geometries (Wen-Tsun Wu, 1984), and for the axiomatization of Origami geometry (J. Justin 1986, H. Huzita 1991)are undecidable. It was already known that the universal theory of Hilbert planes and Wus orthogonal geometry is decidable. We show here using elementary model theoretic tools that (B) the universal first order consequences of any geometric theory $T$ of Pappian planes which is consistent with the analytic geometry of the reals is decidable.
Ritt-Wus algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing generalized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangularize polynomial sets using selected admissible reductions and several effective elimination strategies and to replace the algorithm of basic sets (used in Ritt-Wus algorithm). The proposed algorithm has been implemented and experimental results show that it performs better than Ritt-Wus algorithm in terms of computing time and simplicity of output for a number of non-trivial test examples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
