相关论文: Good bases for tame polynomials

This article describes a normal form algorithm for the Brieskorn lattice of an isolated hypersurface singularity. It is the basis of efficient algorithms to compute the Bernstein-Sato polynomial, the complex monodromy, and Hodge-theoretic…

We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…

We suggest an algorithm for derivation of the Picard--Fuchs system of Pfaffian equations for Abelian integrals corresponding to semiquasihomogeneous Hamiltonians. It is based on an effective decomposition of polynomial forms in the…

We give a simple proof of the uniqueness of extensions of good sections for formal Brieskorn lattices, which can be used in a paper of C. Li, S. Li, and K. Saito for the proof of convergence in the non-quasihomogeneous polynomial case. Our…

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

This paper tackles the problem of constructing Bezout matrices for Newton polynomials in a basis-preserving approach that operates directly with the given Newton basis, thus avoiding the need for transformation from Newton basis to monomial…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

We analyse the Gauss-Manin system of differential equations---and its Fourier transform---attached to regular functions satisfying a tameness assupmption on a smooth affine variety over C (e.g. tame polynomials on C^{n+1}). We give a…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

We recall Labatie's effective method of solving polynomial equations with two unknowns by using the Euclidean algorithm.

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…

Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…

We introduce a new method of constructing complete sequences of key polynomials for simple extensions of tame fields. In our approach the key polynomials are taken to be the minimal polynomials over the base field of suitably constructed…

We associate to any convenient nondegenerate Laurent polynomial on the complex torus (C^*)^n a canonical Frobenius-Saito structure on the base space of its universal unfolding. According to the method of K. Saito (primitive forms) and of M.…

We give cohomological criteria for logarithmic good reduction of elliptic surfaces up to modification. Along the way, we prove several more general results about such surfaces in positive characteristic, as well as about log smooth…

After reviewing the main properties of the Brieskorn lattice in the framework of tame regular functions on smooth affine complex varieties, we prove a conjecture of Katzarkov-Kontsevich-Pantev in the toric case.

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…