Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Conferences
LP relaxations and Fuglede's conjecture
Aditya Siripuram
,
B. Osgood
Published in Institute of Electrical and Electronics Engineers Inc.
2018
DOI:
10.1109/ISIT.2018.8437309
Volume: 2018-June
Pages: 2525 - 2529
Abstract
Consider a unitary (up to scaling) submatrix of the Fourier matrix with rows indexed by \mathcal{I} and columns indexed by \mathcal{J}. From the column index set \mathcal{J} we construct a graph \mathcal{G} so that the row index set \mathcal{I} determines a max-clique. Interpreting \mathcal{G} as coming from an association scheme gives certain bounds on the clique number, which has possible applications to Fuglede's conjecture on spectral and tiling sets. © 2018 IEEE.
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
Data powered by Typeset
IEEE International Symposium on Information Theory - Proceedings
Publisher
Data powered by Typeset
Institute of Electrical and Electronics Engineers Inc.
ISSN
21578095
Authors (1)
Aditya Siripuram
Department of Electrical Engineering
Recent publications
On the k-coverage of line segments by a non homogeneous Poisson-Boolean model
LP relaxations and Fuglede's conjecture
A channel coding perspective of collaborative filtering
Fast DFT computation for signals with spectral support
Get all the updates for this publication
Follow