Related papers: Finite lattices and Gr\"obner bases
An FN lattice $F$ is a simple, infinite, semidistributive lattice. Its existence was recently proved by R. Freese and J.\,B. Nation. Let $\mathsf{B}_n$ denote the Boolean lattice with $n$ atoms. For a lattice $K$, let $K^+$ denote $K$ with…
We give a combinatorial characterisation of connected graphs whose binomial edge ideals are of K\"{o}nig type, developed independently to the similar characterisation given by LaClair in arXiv:2304.13299, and exhibit some classes of graphs…
We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.
In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…
We describe the T-ideal of identities and the T-space of central polynomials for the unitary finite dimensional Grassmann algebra over a finite field.
In this paper, we elaborate Gr\"obner-Shirshov bases method for Leibniz (super)algebras. We show that there is a unique reduced Gr\"obner-Shirshov basis for every (graded) ideal of a free Leibniz (super)algebra. As applications, we…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
Finite fields form an important chapter in abstract algebra, and mathematics in general. We aim to provide a geometric and intuitive model for finite fields, involving algebraic numbers, in order to make them accessible and interesting to a…
In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…
Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…
For a commutative ring R we investigate the property that the sets of minimal primes of finitely generated ideals of R is always finite. We prove this property passes to polynomial ring extensions (in an arbitrary number of variables) over…
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…
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…
In this work, we extend the definition of the graded prime ideals from those in commutative graded rings to the ideals over graded Lie algebras. We prove some facts about graded prime Lie ideals in arbitrary Lie algebras that are similar to…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
Recently there has been a lot of research and progress in profinite groups. We survey some of the new results and discuss open problems. A central theme is decompositions of finite groups into bounded products of subsets of various kinds…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
The structures of the ideals of Clifford algebras which can be both infinite dimensional and degenerate over the real numbers are investigated.
We introduce balanced polyominoes and show that their ideal of inner minors is a prime ideal and has a quadratic Gr\"obner basis with respect to any monomial order, and we show that any row or column convex and any tree-like polyomino is…