A-Ming Liu

activity

20162024

most citedBoolean graphs are unmixed and vertex decomposable

8 citations · 8 across the 7 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.AC2016★ 8 cited

Boolean graphs are unmixed and vertex decomposable

A-Ming Liu, Tongsuo Wu

For each Boolean graph $B_{n}$ , it is proved that both $B_{n}$ and its complement graph $B_{n}$ are vertex decomposable. It is also proved that $B_{n}$ is an unmixed graph, thus…

math.AC2016

Minimal free resolution of a graded ideal with linear quotients

A-Ming Liu, Tongsuo Wu

Let $I$ be a graded ideal of $K [x_{1}, \dots, x_{n}]$ generated by homogeneous polynomials of a same degree $d$ , and assume that $I$ has linear quotients. In this note, we use Horseshoe…