activity
20042021
most citedBoolean graphs are unmixed and vertex decomposable

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

collaborators

23 papers

math.AC2021

Simplicial complexes which are minimal Cohen-Macaulay

Yanyan Wang, Tongsuo Wu

Let $\D$ be a -dimensional pure -simplicial complex over vertex set . In this paper, it is proved that holds true if $\D$ is minimal Cohen-Macaulay. It is als…

math.AC2020★ 2 cited

The Cohen-Macaulay Property of -ideals

A-Ming Liu, Jin Guo, Tongsuo Wu

For positive integers , let where . For a pure -simplicial complex such that an…

math.HO2019

Remarks on two theorems in linear algebra

Yifan Ren, Tongsuo Wu

In this note, we use the concept of a polynomial ring to give an elementary proof to Cayley-Hamilton Theorem. We also give an elementary proof to Birkhoff theorem on Bi-stochastic…

math.AC2018

On reduction number of products of ideals

Dancheng Lu, Tongsuo Wu

Let be a standard graded algebra over an infinite field and a finitely generated $\ZZ$-graded -module. Let be graded ideals of . The fun…

math.AC2018

A construction of sequentially Cohen-Macaulay graphs

A-Ming Liu, Tongsuo Wu

For every simple graph , a class of multiple clique cluster-whiskered graphs is introduced, and it is shown that all graphs are vertex decomposable, thus the i…

math.AC2016★ 8 cited

Boolean graphs are unmixed and vertex decomposable

A-Ming Liu, Tongsuo Wu

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