Lei Cao

activity

20162026

most citedPattern-Avoiding (0,1)-Matrices

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

collaborators

14 papers

math.CO2026

Enumerating forcing and strongly forcing (0,1)-matrices

Lei Cao, Jesse Geneson

Let $Q$ be a nonzero $s \times t$ $(0, 1)$ -pattern, and let $m \geq s$ and $n \geq t$ . An $m \times n$ matrix is strongly $Q$ -forcing if every $1$ -entry belongs to an $s \times t$ submatri…

math.CO2025

Pattern Forcing (0,1)-Matrices

Lei Cao, Shen-Fu Tsai

We introduce two related notions of pattern enforcement in $(0, 1)$ -matrices: $Q$ -forcing and strongly $Q$ -forcing, which formalize distinct ways a fixed pattern $Q$ must appear wit…

math.CO2025

Leaky Forcing: Extending Zero Forcing Results to a Fault-Tolerant Setting

Beth Bjorkman, Lei Cao, Franklin Kenter +3

We study a recent variation of zero forcing called leaky forcing. Zero forcing is a propagation process on a network whereby some nodes are initially blue with all others white. Bl…

math.CO2023

Flag-Shaped Blockers of 123-Avoiding Permutation Matrices

Megan Bennett, Lei Cao

A blocker of $123$ -avoiding permutation matrices refers to the set of zeros contained within an $n \times n$ $123$ -forcing matrix. Recently, Brualdi and Cao provided a characterizat…

math.CO2020

The Complete Positivity of Symmetric Tridiagonal and Pentadiagonal Matrices

Lei Cao, Darian McLaren, Sarah Plosker

We provide a decomposition that is sufficient in showing when a symmetric tridiagonal matrix $A$ is completely positive. Our decomposition can be applied to a wide range of matrice…

math.CO2020★ 8 cited

Pattern-Avoiding (0,1)-Matrices

Richard A. Brualdi, Lei Cao

We investigate pattern-avoiding (0,1)-matrices as generalizations of pattern-avoiding permutations. Our emphasis is on 123-avoiding and 321-avoiding patterns for which we obtain ex…