A Grobner basis for the ideal determining mod 2 cohomology of Grassmannian G_{3,n} is obtained. This is used, along with the method of obstruction theory, to establish some new immersion results for these manifolds.
Grassmann manifolds $G_{k,n}$ are among the central objects in geometry and topology. The Borel picture of the mod 2 cohomology of $G_{k,n}$ is given as a polynomial algebra modulo a certain ideal $I_{k,n}$. The purpose of this paper is to understand
this cohomology via Grobner bases. Reduced Grobner bases for the ideals $I_{k,n}$ are determined. An application of these bases is given by proving an immersion theorem for Grassmann manifolds $G_{5,n}$, which establishes new immersions for an infinite family of these manifolds.
We give a different and possibly more accessible proof of a general Borsuk--Ulam theorem for a product of spheres, originally due to Ramos. That is, we show the non-existence of certain $(mathbb{Z}/2)^k$-equivariant maps from a product of $k$ spheres
to the unit sphere in a real $(mathbb{Z}/2)^k$-representation of the same dimension. Our proof method allows us to derive Borsuk--Ulam theorems for certain equivariant maps from Stiefel manifolds, from the corresponding results about products of spheres, leading to alternative proofs and extensions of some results of Fadell and Husseini.
In this work we provide a definition of a coloured operad as a monoid in some monoidal category, and develop the machinery of Grobner bases for coloured operads. Among the examples for which we show the existance of a quadratic Grobner basis we con
sider the seminal Lie-Rinehart operad whose algebras include pairs (functions, vector fields).
In the present paper, we prove that the toric ideals of certain $s$-block diagonal matching fields have quadratic Grobner bases. Thus, in particular, those are quadratically generated. By using this result, we provide a new family of toric degenerations of Grassmannians.
In this paper, we make a contribution to the computation of Grobner 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 investigate w
hat happens if we make that choice arbitrarily. It turns out not only this is possible (the fact that this produces a normal form being already known in the literature), but, for a fixed choice of reductors, the obtained normal form is the same no matter the order in which we reduce the monomials. To prove this, we introduce reduction machines, which work by reducing each monomial independently and then collecting the result. We show that such a machine can simulate any such reduction. We then discuss different implementations of these machines. Some of these implementations address inherent inefficiencies in reduction machines (repeating the same computations). We describe a first implementation and look at some experimental results.