◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Thanh Vu

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author4

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.AC4
ORCID 0000-0003-2367-2961
same name
  • Thanh Vu — 22 papers, h 25
  • Thanh Vu — 1 paper
  • Thanh Vu — 1 paper
  • Thanh Vu — 1 paper
  • Thanh Vu — 1 paper
  • Thanh Vu — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedDepth of powers of edge ideals of cycles and trees

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.AC2023

Depth of powers of edge ideals of Cohen-Macaulay trees

Nguyen Thu Hang, Truong Thi Hien, Thanh Vu

Let I be the edge ideal of a Cohen-Macaulay tree of dimension d over a polynomial ring S=k[x1​,…,xd​,y1​,…,yd​]. We prove that for all t≥1, $$\op…

math.AC2023

The sequentially Cohen-Macaulay property of edge ideals of edge-weighted graphs

Ly Thi Kieu Diem, Nguyen Cong Minh, Thanh Vu

Let I(Gw​) be the edge ideal of an edge-weighted graph (G,w). We prove that I(Gw​) is sequentially Cohen-Macaulay for all weight functions w…

math.AC2023★ 2 cited

Depth of powers of edge ideals of cycles and trees

Nguyen Cong Minh, Tran Nam Trung, Thanh Vu

Let I be the edge ideal of a cycle of length n≥5 over a polynomial ring S=k[x1​,…,xn​]. We prove that for 2≤t<⌈(n+1)/2⌉, $$\operatorna…

math.AC2022★ 1 cited

Characterization of graphs whose a small power of their edge ideals has a linear free resolution

Nguyen Cong Minh, Thanh Vu

Let I(G) be the edge ideal of a simple graph G. We prove that I(G)2 has a linear free resolution if and only if G is gap-free and regI(G)≤3. Similarly, we show that…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.