Luis M. b. Varona

collaborators

3 papers

cs.DS2026

A polynomial-time algorithm for recognizing high-bandwidth graphs

Luis M. B. Varona

An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have…

math.CO2026

Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers

Finn A. Steinke, Luis M. B. Varona

We investigate spectral lower bounds on the chromatic number $χ$ of Hamming graph powers $H (n, q)^{p}$ , Johnson graph powers $J (n, k)^{p}$ , and Kneser graph powers $K (n, k)^{p}$ providin…

math.FA2025

Generalizing the Cauchy-Schwarz inequality: Hadamard powers and tensor products

Nathaniel Johnston, Sarah Plosker, Charles Torrance +1

We explore and generalize a Cauchy-Schwarz-type inequality originally proved in [Electronic Journal of Linear Algebra 35, 156-180 (2019)]: $\|\mathbf{v}^2\|\|\mathbf{w}^2\| - \lang…