Let K= Fq be a finite field with q elements and let X be a subset of a projective space Ps− 1,
over the field K, parameterized by Laurent monomials. Let I (X) be the vanishing ideal of X …

Let X be a subset of a projective space, over a finite field K, which is parameterized by the
monomials arising from the edges of a clutter. Let I (X) be the vanishing ideal of X. It is …

The aim of this book is to provide a theoretical framework to study monomial rings and ideals
associated to graphs, using techniques from graph theory, polyhedral geometry …

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing
ideal, I (X), of X and show some useful degree bounds for a minimal set of generators of I …

In this paper we give a formula for the second generalized Hamming weight of certain
evaluation codes arising from a projective torus. This allows us to compute the …

Let K be a finite field and let X* be an affine algebraic toric set parameterized by monomials.
We give an algebraic method, using Gröbner bases, to compute the length and the …

Sažetak Let $ K $ be a finite field, let $ X\subset\mathbb {P}^{m-1} $ and $ X'\subset\mathbb
{P}^{r-1} $, with $ r We also find the regularity index in the case of toric sets parameterized …

Let X* be a subset of an affine space 𝔸 s, over a finite field K, which is parameterized by the
edges of a clutter. Let X and Y be the images of X* under the maps x→[x] and x→[(x, 1)] …

In this article we review known results on parameterized linear codes over graphs,
introduced by Rentería et al.(Finite Fields Appl 17 (1): 81–104, 2011). Very little is known …

We study the vanishing ideal of the parametrized algebraic toric set associated to the
complete multipartite graph G= K α 1,…, α r over a finite field of order q. We give an explicit …