activity
20172026
most citedPattern-Avoiding (0,1)-Matrices

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

collaborators
Showing math.COShow all

10 papers · 1 filter

math.CO2026

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

Lei Cao, Jesse Geneson

Let be a nonzero -pattern, and let and . An matrix is strongly -forcing if every -entry belongs to an submatri…

math.CO2025

Pattern Forcing (0,1)-Matrices

Lei Cao, Shen-Fu Tsai

We introduce two related notions of pattern enforcement in -matrices: -forcing and strongly -forcing, which formalize distinct ways a fixed pattern 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 -avoiding permutation matrices refers to the set of zeros contained within an -forcing matrix. Recently, Brualdi and Cao provided a characterizat…

math.CO20208 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…

math.CO2019

Centrosymmetric Stochastic Matrices

Lei Cao, Darian McLaren, Sarah Plosker

We consider the convex set of stochastic matrices and the convex set of centrosymmetric stochastic matrices (stochastic…