2 papers
cs.DS2026
On (Non-)Isomorphism of Self-Dual Lattices and Codes
Huck Bennett, Kyle Fridberg
A recent line of work motivated by cryptographic applications has studied the complexity of the Lattice Isomorphism Problem (LIP). In this work, we study LIP on self-dual lattices…
math.CO2025
Tiling with Boundaries: Dense digital images have large connected components
Kyle Fridberg
If most of the pixels in an digital image are the same color, must the image contain a large connected component? How densely can a given set of connected components p…