相关论文: Dimension, depth and zero-divisors of the algebra …

Given an arbitrary graph G, we study its basic covers algebra, which is the symbolic fiber cone of the Alexander dual of the edge ideal of G. Extending results of Villarreal and Benedetti-Constantinescu-Varbaro, valid only in the case when…

The algebra of basic covers of a graph G, denoted by \A(G), was introduced by Juergen Herzog as a suitable quotient of the vertex cover algebra. In this paper we show that if the graph is bipartite then \A(G) is a homogeneous algebra with…

Let $G$ be an unmixed bipartite graph of dimension $d-1$. Assume that $K_{n,n}$, with $n\ge 2$, is a maximal complete bipartite subgraph of $G$ of minimum dimension. Then $G$ is Cohen-Macaulay in codimension $d-n+1$. This generalizes a…

Given a connected graph $G(V, E)$, the edge dimension, denoted $\mathrm{edim}(G)$, is the least size of a set $S \subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of…

We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…

A set of vertices $W$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $W$. A metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. A bipartite graph G(n,n) is…

In Arakelov theory a completion of an arithmetic surface is achieved by enlarging the group of divisors by formal linear combinations of the ``closed fibers at infinity''. Manin described the dual graph of any such closed fiber in terms of…

Let $A$ be a finitely generated $K$-algebra that is a domain of GK dimension less than 3, and let $Q(A)$ denote the quotient division algebra of $A$. We show that if $D$ is a division subalgebra of $Q(A)$ of GK dimension at least 2 then…

We study the Hilbert function and the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is a Cohen-Macaulay bipartite graph.

The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…

Given a projective algebraic set X, its dual graph G(X) is the graph whose vertices are the irreducible components of X and whose edges connect components that intersect in codimension one. Hartshorne's connectedness theorem says that if…

For a set W of vertices and a vertex v in a graph G, the k-vector r2(v|W) = (aG(v,w1),...,aG(v,wk)) is the adjacency representation of v with respect to W, where W = {w1,...,wk} and aG(x,y) is the minimum of 2 and the distance between the…

The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…

In a paper in 2008, Herzog, Hibi and Ohsugi introduced and studied the semigroup ring associated to the set of minimal vertex covers of an unmixed bipartite graph. In this paper we relate the dimension of this semigroup ring to the rank of…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d(u,w)$ denote the length of a $u-w$ geodesic in $G$. For any $v\in V(G)$ and $e=xy\in E(G)$, let $d(e,v)=\min\{d(x,v),d(y,v)\}$. For distinct $e_1, e_2\in E(G)$, let…

The separation dimension of a graph $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are "separated" in some ordering, meaning that both endpoints of one edge appear before…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

We define a transcendence degree for division algebras, by modifying the lower transcendence degree construction of Zhang. We show that this invariant has many of the desirable properties one would expect a noncommutative analogue of the…

Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…