Related papers: $p$-adic algorithm for bivariate Gr\"obner bases

Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…

We determine a Groebner basis for the secant ideal of the toric ideal associated to the second hypersimplex, with respect to any circular term order. The Groebner basis of the secant ideal requires polynomials of odd degree up to n. This…

We give explicit generators for ideals of two classes of subspace arrangements embedded in certain reflection arrangements, generalizing results of Li-Li and Kleitman-Lovasz. We also give minimal generators for the ideals of arrangements…

Using the theory of $(\phi,\Gamma)$-modules and the formalism of Selmer complexes we construct the p-adic height for p-adic representations with coefficients in an affinoid algebra over $Q_p$.

In the last decade, the approximate vanishing ideal and its basis construction algorithms have been extensively studied in computer algebra and machine learning as a general model to reconstruct the algebraic variety on which noisy data…

We give a new construction of $p$-adic heights on varieties over number fields using $p$-adic Arakelov theory. In analogy with Zhang's construction of real-valued heights in terms of adelic metrics, these heights are given in terms of…

In this paper we introduce an algebra embedding $\iota:K< X >\to S$ from the free associative algebra $K< X >$ generated by a finite or countable set $X$ into the skew monoid ring $S = P * \Sigma$ defined by the commutative polynomial ring…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

The proximal generalized alternating direction method of multipliers (p-GADMM) is substantially efficient for solving convex composite programming problems of high-dimensional to moderate accuracy. The global convergence of this method was…

We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…

We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…

Fix a pair of positive integers d and n. We create a ring R and a complex G of R-modules with the following universal property. Let P be a polynomial ring in d variables over a field and let I be a grade d Gorenstein ideal in P which is…

In this paper we introduce a new and large family of configurations whose toric ideals possess quadratic Groebner bases. As an application, a generalization of algebras of Segre-Veronese type will be studied.

For $G$ a symplectic or orthogonal $p$-adic group (not necessarily split), or an inner form of a general linear $p$-adic group, we compute the endomorphism algebras of some induced projective generators \`a la Bernstein of the category of…

We present new algorithms for computing adjoint ideals of curves and thus, in the planar case, adjoint curves. With regard to terminology, we follow Gorenstein who states the adjoint condition in terms of conductors. Our main algorithm…

Let F:K be a Galois extension of number fields and Q a prime ideal of O_F lying over the prime P of O_K. By analyzing the Q-adic closure of O_K in O_F we characterize those rings of integers O_K for which every residue class ring of…

This paper provides a new proof of the $p$-adic Gross--Zagier formula for the $p$-adic $L$-function associated with the base change of a normalised cuspidal eigen-newform $f$ of weight $k \geq 2$ (and families of such) to an imaginary…

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…

The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary differential equations (ODEs) with coefficients that are…

We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…