Rafael H. Villarreal

Orcid: 0000-0001-9473-765X

According to our database1, Rafael H. Villarreal authored at least 39 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A duality theorem for the ic-resurgence of edge ideals.
Eur. J. Comb., 2023

Indicator functions, v-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes.
CoRR, 2023

2022
Codes parameterized by the edges of a bipartite graph with a perfect matching.
CoRR, 2022

2021
The v-number of edge ideals.
J. Comb. Theory, Ser. A, 2021

The dual of an evaluation code.
Des. Codes Cryptogr., 2021

Evaluation codes and their basic parameters.
Des. Codes Cryptogr., 2021

2020
Generalized Hamming weights of projective Reed-Muller-type codes over graphs.
Discret. Math., 2020

Linear codes over signed graphs.
Des. Codes Cryptogr., 2020

Generalized minimum distance functions and algebraic invariants of Geramita ideals.
Adv. Appl. Math., 2020

2019
Edge ideals of oriented graphs.
Int. J. Algebra Comput., 2019

The dual of a constacyclic code, self dual, reversible constacyclic codes and constacyclic codes with complementary duals over finite local Frobenius non-chain rings with nilpotency index 3.
Discret. Math., 2019

A note on projective toric codes.
CoRR, 2019

On the generalized Hamming weights of certain Reed-Muller-type codes.
CoRR, 2019

2018
The second generalized Hamming weight of some evaluation codes arising from a projective torus.
Finite Fields Their Appl., 2018

GMD functions for scheme-based linear codes and algebraic invariants of Geramita ideals.
CoRR, 2018

2017
Footprint and minimum distance functions.
CoRR, 2017

Generalized minimum distance functions.
CoRR, 2017

2016
Direct products in projective Segre codes.
Finite Fields Their Appl., 2016

Footprint functions of complete intersections.
CoRR, 2016

2015
Complete intersection vanishing ideals on sets of clutter type over finite fields.
CoRR, 2015

Vanishing ideals over rational parameterizations.
CoRR, 2015

Projective Segre codes.
CoRR, 2015

Minimum distance functions of graded ideals and Reed-Muller-type codes.
CoRR, 2015

2014
Degree and Algebraic Properties of Lattice and Matrix Ideals.
SIAM J. Discret. Math., 2014

Computing the degree of a lattice ideal of dimension one.
J. Symb. Comput., 2014

Affine cartesian codes.
Des. Codes Cryptogr., 2014

2013
Complete Intersections in binomial and Lattice ideals.
Int. J. Algebra Comput., 2013

2012
Combinatorics of Cremona monomial maps.
Math. Comput., 2012

2011
Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems.
J. Comb. Optim., 2011

Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields.
Finite Fields Their Appl., 2011

Vanishing ideals over graphs and even cycles
CoRR, 2011

The minimum distance of parameterized codes on projective tori.
Appl. Algebra Eng. Commun. Comput., 2011

2010
Ring graphs and complete intersection toric ideals.
Discret. Math., 2010

The minimum distance of parameterized codes of complete intersection vanishing ideals over finite fields
CoRR, 2010

Ehrhart Clutters: Regularity and Max-Flow Min-Cut.
Electron. J. Comb., 2010

2008
Shellable graphs and sequentially Cohen-Macaulay bipartite graphs.
J. Comb. Theory, Ser. A, 2008

2007
Ring graphs and toric ideals.
Electron. Notes Discret. Math., 2007

2005
Normality of semigroups with some links to graph theory.
Discret. Math., 2005

2003
Canonical modules of certain edge subrings.
Eur. J. Comb., 2003


  Loading...