arXiv subjects
Publications and source records attributed to Tran Nam Trung.
Let $Δ$ be a simplicial complex of a matroid $M$. In this paper, we explicitly compute the regularity of all the symbolic powers of a Stanley-Reisner ideal $I_Δ$ in terms of combinatorial data of the matroid $M$. In order to do that, we provide a sharp bound between the arboricity of $M$ and the circumference of its dual $M^*$.
We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for König-Egerváry graphs in terms of their matching numbers.
We prove that a planar graph is Gorenstein if and only if its independence complex is Eulerian.
Let $G$ be a graph and let $I := I (G)$ be its edge ideal. In this paper, we provide an upper bound of $n$ from which $\depth R/ I(G)^n$ is stationary, and compute this limit explicitly. This bound is always achieved if $G$ has no cycles of length $4$ and every its connected component is either a tree or a unicyclic graph.
Given arbitrary homogeneous ideals $I$ and $J$ in polynomial rings $A$ and $B$ over a field $k$, we investigate the depth and the Castelnuovo-Mumford regularity of powers of the sum $I+J$ in $A \otimes_k B$ in terms of those of $I$ and $J$. Our results can be used to study the behavior of the depth and regularity functions of powers of an ideal. For instance, we show that such a depth function can take as its values any infinite non-increasing sequence of non-negative integers.
We graph-theoretically characterize triangle-free Gorenstein graphs $G$. As an application, we classify when $I(G)^2$ is Cohen-Macaulay.
Let G be a graph and let I = I(G) be its edge ideal. In this paper, when G is a forest or a cycle, we explicitly compute the regularity of I^s for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear function reg(I^s) as s > 0, and the initial value of s starting from which reg(I^s) attains its linear form. We also give new bounds on the regularity of I when G contains a Hamiltonian path and when G is a Hamiltonian graph.
Let $I(G)$ be the edge ideal of a simple graph $G$. In this paper, we will give sufficient and necessary combinatorial conditions of $G$ in which the second symbolic and ordinary power of its edge ideal are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay). As an application of our results, we will classify all bipartite graphs in which the second (symbolic) powers are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay).