Universal Gröbner Basis for Parametric Polynomial Ideals

Author(s):  
Amir Hashemi ◽  
Mahdi Dehghani Darmian ◽  
Marzieh Barkhordar
2018 ◽  
Vol 28 (04) ◽  
pp. 553-571 ◽  
Author(s):  
Rebecca Garcia ◽  
Luis David García Puente ◽  
Ryan Kruse ◽  
Jessica Liu ◽  
Dane Miyata ◽  
...  

The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal has a particular generating set, called the canonical form, that directly encodes a minimal description of the receptive field structure intrinsic to the neural code. On the other hand, for a given monomial order, any polynomial ideal is also generated by its unique (reduced) Gröbner basis with respect to that monomial order. How are these two types of generating sets — canonical forms and Gröbner bases — related? Our main result states that if the canonical form of a neural ideal is a Gröbner basis, then it is the universal Gröbner basis (that is, the union of all reduced Gröbner bases). Furthermore, we prove that this situation — when the canonical form is a Gröbner basis — occurs precisely when the universal Gröbner basis contains only pseudo-monomials (certain generalizations of monomials). Our results motivate two questions: (1) When is the canonical form a Gröbner basis? (2) When the universal Gröbner basis of a neural ideal is not a canonical form, what can the non-pseudo-monomial elements in the basis tell us about the receptive fields of the code? We give partial answers to both questions. Along the way, we develop a representation of pseudo-monomials as hypercubes in a Boolean lattice.


2006 ◽  
Vol 16 (01) ◽  
pp. 187-202 ◽  
Author(s):  
SUSAN HERMILLER ◽  
JON McCAMMOND

Let I denote the commutator ideal in the free associative algebra on m variables over an arbitrary field. In this article we prove there are exactly m! finite Gröbner bases for I, and uncountably many infinite Gröbner bases for I with respect to total division orderings. In addition, for m = 3 we give a complete description of its universal Gröbner basis.


2013 ◽  
Vol 65 (5) ◽  
pp. 961-988 ◽  
Author(s):  
Chris Aholt ◽  
Bernd Sturmfels ◽  
Rekha Thomas

AbstractMultiview geometry is the study of two-dimensional images of three-dimensional scenes, a foundational subject in computer vision. We determine a universal Gröbner basis for the multiview ideal of ngeneric cameras. As the cameras move, the multiview varieties vary in a family of dimension 11n − 15. This family is the distinguished component of a multigraded Hilbert scheme with a unique Borel-fixed point. We present a combinatorial study of ideals lying on that Hilbert scheme.


2019 ◽  
pp. 1362-1366
Author(s):  
Hussein S. Mohammed Hussein ◽  
Abdulrahman H. Majeed

In this paper, The Grobner basis of the Toric Ideal for - contingency tables related with the Markov basis B introduced by Hussein S. MH, Abdulrahman H. M in 2018 is found. Also, the Grobner basis is a reduced and universal Grobner basis are shown.


10.37236/5912 ◽  
2017 ◽  
Vol 24 (4) ◽  
Author(s):  
Mourtadha Badiane ◽  
Isaac Burke ◽  
Emil Sköldberg

We show that the universal Gröbner 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 binomial edge ideal and prove this conjecture for the case when the underlying graph is the complete graph.


2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers

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.


Sign in / Sign up

Export Citation Format

Share Document