3 papers
math.CO2025
Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity
Steffen Borgwardt, MacKenzie Carr, Ce Chen +4
Fomin, Kratochvíl, Lokshtanov, Mancini, and Telle showed that every -free graph is reconstructible from the \emph{multiset} of closed neighborhoods. We strengthen their resu…
math.CO2025
Maximal independent sets in the middle two layers of the Boolean lattice
József Balogh, Ce Chen, Ramon I. Garcia
Let be the subgraph of the hypercube induced by its two largest layers. Duffus, Frankl and Rödl proposed the problem of finding the asymptotics fo…
math.NA2024
Estimating the numerical range with a Krylov subspace
Cecilia Chen, John Urschel
Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspac…