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

When using a Groebner basis to solve the highly symmetric system of algebraic equations defining the cyclic p-roots, one has the feeling that much of the advantage of computerized symbolic algebra over hand calculation is lost through the…

Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…

In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix…

Let $G$ be a commutative algebraic group defined over a number field $K$ that is disjoint over $K$ to $\mathbb G_a$ and satisfies the condition of semistability. Consider a linear form $l$ on the Lie algebra of $G$ with algebraic…

We construct canonical adjoint $p$-adic $L$-functions generating the congruence ideal attached to Hida families using Ohta's pairing. We show that these $p$-adic $L$-functions, suitably modified by certain Euler factors, are interpolated by…

In 1992, V. Weispfenning proved the existence of Comprehensive Groebner Bases (CGB) and gave an algorithm to compute one. That algorithm was not very efficient and not canonical. Using his suggestions, A. Montes obtained in 2002 a more…

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…

In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…

Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…

The mathematical basis of p-adic Higgs mechanism discussed in papers [email protected] 9410058-62 is considered in this paper. The basic properties of p-adic numbers, of their algebraic extensions and the so called canonical…

Let $\mathfrak q$ be a Lie algebra over a field $\mathbb K$ and $p,\tilde p\in\mathbb K[t]$ two different normalised polynomials of degree at least 2. As vector spaces both quotient Lie algebras $\mathfrak q[t]/(p)$ and $\mathfrak…

Let $X$ be a curve of genus $g>1$ over $\mathbb{Q}$ whose Jacobian $J$ has Mordell--Weil rank $r$ and N\'eron--Severi rank $\rho$. When $r < g+ \rho - 1$, the geometric quadratic Chabauty method determines a finite set of $p$-adic points…

We investigate the application of syzygies for efficiently computing (finite) Pommaret bases. For this purpose, we first describe a non-trivial variant of Gerdt's algorithm to construct an involutive basis for the input ideal as well as an…

Let $P$ and $Q$ be finite partially ordered sets on $[d] = \{1, \ldots, d\}$, and $\mathcal{O}(P) \subset \mathbb{R}^{d}$ and $\mathcal{O}(Q) \subset \mathbb{R}^{d}$ their order polytopes. The twinned order polytope of $P$ and $Q$ is the…

For sigma-PWB extensions, we extend to modules the theory of Gr\"obner bases of left ideals presented in [5]. As an application, if A is a bijective quasi-commutative sigma-PWB extension, we compute the module of syzygies of a submodule of…

In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…

We discuss algorithmic approach to growth of the codimension sequences of varieties of multilinear algebras, or, equivalently, the sequences of the component dimensions of algebraic operads. The (exponentional) generating functions of such…

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

Two models were recently proposed to explore the robust hardness of Gr\"obner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for…

Hibi conjectured that if a toric ideal has a quadratic Gr\"obner basis, then the toric ideal has either a lexicographic or a reverse lexicographic quadratic Gr\"obner basis. In this paper, we present a cut ideal of a graph that serves as a…