Arvin Sahami

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

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs

Shayan Oveis Gharan, Arvin Sahami

For a linear code $C \subseteq F_{2}^{n}$ and $α \in [0, 1]$ , call a set $S \subseteq [n]$ an (unweighted) one-sided $α$ -sparsifier of $C$ if for all $c \in…

cs.DS2024

Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters

Nicholas Harvey, Arvin Sahami

Orthogonal arrays are a type of combinatorial design that were developed in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any…