Lattice Bases of Planar Lattices

2018 ◽  
Vol 25 (01) ◽  
pp. 139-148
Author(s):  
Hero Saremi
Keyword(s):  
Distributive Lattice ◽  
Gröbner Basis ◽  
Finite Distributive Lattice ◽  
Grobner Basis ◽  
Planar Lattices

In this paper we give a characterization of planar lattices, and show that the sublattice [Formula: see text] corresponding to the Hibi ideal of a finite distributive lattice [Formula: see text] has a nice lattice basis if and only if [Formula: see text] is planar. We also consider the Gröbner basis of the lattice basis ideal attached to the planar lattices.

The General PBW Property

2007 ◽  
Vol 14 (04) ◽  
pp. 541-554
Author(s):  
Huishi Li
Keyword(s):  
Free Algebra ◽  
Gröbner Basis ◽  
Gröbner Bases ◽  
Path Algebra ◽  
Grobner Bases ◽  
Grobner Basis ◽  
Graded Ring ◽  
Homological Characterization

For ungraded quotients of an arbitrary ℤ-graded ring, we define the general PBW property, that covers the classical PBW property and the N-type PBW property studied via the N-Koszulity by several authors (see [2–4]). In view of the noncommutative Gröbner basis theory, we conclude that every ungraded quotient of a path algebra (or a free algebra) has the general PBW property. We remark that an earlier result of Golod [5] concerning Gröbner bases can be used to give a homological characterization of the general PBW property in terms of Shafarevich complex. Examples of application are given.

scholarly journals On the first fall degree of summation polynomials

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers
Keyword(s):  
Elliptic Curve ◽  
Gröbner Basis ◽  
Discrete Logarithm ◽  
Polynomial Systems ◽  
Discrete Logarithm Problem ◽  
Grobner Basis ◽  
Weil Descent ◽  
Degree Bound

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

scholarly journals On the relation between the MXL family of algorithms and Gröbner basis algorithms

2012 ◽  
Vol 47 (8) ◽  
pp. 926-941 ◽  
Author(s):  
Martin R. Albrecht ◽  
Carlos Cid ◽  
Jean-Charles Faugère ◽  
Ludovic Perret
Keyword(s):  
Gröbner Basis ◽  
Grobner Basis

scholarly journals Constructing Gröbner bases for Noetherian rings

2013 ◽  
Vol 24 (2) ◽  
Author(s):  
HERVÉ PERDRY ◽  
PETER SCHUSTER
Keyword(s):  
Gröbner Basis ◽  
Finite Depth ◽  
Commutative Rings ◽  
Polynomial Ideal ◽  
Constructive Proof ◽  
Noetherian Rings ◽  
Grobner Basis ◽  
Finitely Generated ◽  
Prime Decomposition ◽  
Separate Paper

We give a constructive proof showing that every finitely generated polynomial ideal has a Gröbner basis, provided the ring of coefficients is Noetherian in the sense of Richman and Seidenberg. That is, we give a constructive termination proof for a variant of the well-known algorithm for computing the Gröbner basis. In combination with a purely order-theoretic result we have proved in a separate paper, this yields a unified constructive proof of the Hilbert basis theorem for all Noether classes: if a ring belongs to a Noether class, then so does the polynomial ring. Our proof can be seen as a constructive reworking of one of the classical proofs, in the spirit of the partial realisation of Hilbert's programme in algebra put forward by Coquand and Lombardi. The rings under consideration need not be commutative, but are assumed to be coherent and strongly discrete: that is, they admit a membership test for every finitely generated ideal. As a complement to the proof, we provide a prime decomposition for commutative rings possessing the finite-depth property.

Sign in / Sign up

Export Citation Format

Share Document