Related papers: Minimal Generating Sets of Lattice Ideals
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
We take a graph theoretic approach to the problem of finding generators for those prime ideals of $\mathcal{O}_q(\mathcal{M}_{m,n}(\mathbb{K}))$ which are invariant under the torus action ($\mathbb{K}^*)^{m+n}$. Launois \cite{launois3} has…
We consider the ring I_n of polynomial invariants over weighted graphs on n vertices. Our primary interest is the use of this ring to define and explore algebraic versions of isomorphism problems of graphs, such as Ulam's reconstruction…
In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…
In this paper we consider reduced homogeneous ideals $\Jcal\subset S$ of a polynomial ring $S$, having a 2-linear resolution. 1. We study systems of generators of $\Jcal\subset S$. 2. We compute the arithmetical rank for a large class of…
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
In this paper, we study the question of classifying self-similar sets under bi-Lipschitz mappings and obtain an important bi-Lipschitz invariant, which is an ideal of a ring related to IFS. Roughly speaking, different Lipschitz equivalence…
Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…
Consider a complete intersection I of type (d_1,..., d_r) in a polynomial ring over a field of characteristic 0. We study the graded system of ideals {gin(I^n)}_n obtained by taking the reverse lexicographic generic initial ideals of the…
Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…
In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\H$ be a hypergraph, $I(\H)$ its corresponding edge ideal in a polynomial ring in $n$…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
A \emph{congruence} on $\mathbb{N}^n$ is an equivalence relation on $\mathbb{N}^n$ that is compatible with the additive structure. If $\Bbbk$ is a field, and $I$ is a \emph{binomial ideal} in $\Bbbk[X_1,\dots,X_n]$ (that is, an ideal…
Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…
We classify the minimal number of generators of artinian equigenerated monomial ideals $I$ such that $\Bbbk[x_1,\ldots,x_n]/I$ is forced to have the weak Lefschetz property.
We consider minimal-perimeter lattice animals, providing a set of conditions which are sufficient for a lattice to have the property that inflating all minimal-perimeter animals of a certain size yields (without repetitions) all…