Related papers: $p$-adic algorithm for bivariate Gr\"obner bases
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
We describe a generating set for the initial ideal of simplicial toric ideals with respect to the graded reverse lexicographic order, using representations of elements of affine monoids as sums of irreducible elements. Although the…
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…
The aim of our paper is to construct pseudo $H$-type algebras from the covering free nilpotent two-step Lie algebra as the quotient algebra by an ideal. We propose an explicit algorithm of construction of such an ideal by making use of a…
The universal Gr\"{o}bner basis of $I$, is a Gr\"{o}bner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…
We prove a general formula for the $p$-adic heights of Heegner points on modular abelian varieties with potentially ordinary (good or semistable) reduction at the primes above $p$. The formula is in terms of the cyclotomic derivative of a…
Using symmetric algebras we simplify (and slightly strengthen) the Bruns-Eisenbud-Evans "generalized principal ideal theorem" on the height of order ideals of non-minimal generators in a module. We also obtain a simple proof and an…
We prove that if two semi-algebraic subsets of $\mathbb{Q}_p^n$ have the same $p$-adic measure, then this equality can already be deduced using only some basic integral transformation rules. On the one hand, this can be considered as a…
Due to the elimination property held by the lexicographic monomial order, the corresponding Groebner bases display strong structural properties from which meaningful informations can easily be extracted. We study these properties for…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…
We propose a novel encoding scheme for algebraic codes such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed-Solomon codes and present numerical examples. We employ the recurrence from the Gr\"obner…
Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…
Let $f$ be a primitive Hilbert modular form of parallel weight $2$ and level $N$ for the totally real field $F$, and let $p$ be a rational prime coprime to $2N$. If $f$ is ordinary at $p$ and $E$ is a CM extension of $F$ of relative…
Let ${\mathrm G}$ be the group $({\rm GL}_{2}\times {\rm GU}(1))/{\rm GL}_{1}$ over a totally real field $F$, and let $\mathscr{X}$ be a Hida family for ${\rm G}$. Revisiting a construction of Howard and Fouquet, we construct an explicit…
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…
We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…
We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded…