A. Sali

activity

20242026

collaborators

4 papers

math.CO2026

Exact Bounds for Forbidden Configurations and the Extremal Matrices

Richard P. Anstee, Oakley Edens, Arvin Sahami +2

Let $F$ be a $k \times ℓ$ (0,1)-matrix. A matrix is simple if it is a (0,1)-matrix with no repeated columns. A (0,1)-matrix $A$ is said to have a $F$ as a configuration if there…

math.CO2025

Forbidden Configurations and Boundary Cases

Richard P. Anstee, Oakley Edens, Arvin Sahami +1

Let $F$ be a $k \times ℓ$ (0,1)-matrix. Define a (0,1)-matrix $A$ to have a $F$ as a \emph{configuration} if there is a submatrix of $A$ which is a row and column permutation of…

math.CO2025

Multivalued forbidden numbers of two-rowed configurations -- the missing cases

Wallace Peaslee, Attila Sali, Jun Yan

The present paper considers extremal combinatorics questions in the language of matrices. An $s$ -matrix is a matrix with entries in ${0, 1, \dots, s - 1}$ . An $s$ -matrix is simple i…

math.CO2024

Stability Theorems for Forbidden Configurations

Richard P. Anstee, Benjamin Kreiswirth, Bowen Li +2

Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of th…