3 papers
math.OC2026
Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs
Henrique Assumpção, Gabriel Coutinho
We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue. We also extend the equality case…
math.CO2026
Zero-freeness of a multivariate monomer-dimer-cycle polynomial on bounded-degree graphs
Gabriel Coutinho, Paula M. S. Fialho
We initiate the study of a multivariate graph polynomial that interpolates between classical counting polynomials for matchings and for cycle structures arising in th…
quant-ph2025
Peak state transfer in continuous quantum walks
Gabriel Coutinho, Krystal Guo, Vincent Schmeits
We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer…