LP relaxations and Fuglede's conjecture

Siripuram, Aditya and Brad, Osgood (2018) LP relaxations and Fuglede's conjecture. In: IEEE International Symposium on Information Theory (ISIT), 17-22 June 2018, CO, USA.

Full text not available from this repository. (Request a copy)

Abstract

Consider a unitary (up to scaling) submatrix of the Fourier matrix with rows indexed by I and columns indexed by J. From the column index set J we construct a graph G so that the row index set I determines a max-clique. Interpreting 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.

[error in script]

IITH Creators:	IITH Creators ORCiD Siripuram, Aditya UNSPECIFIED
Item Type:	Conference or Workshop Item (Paper)
Uncontrolled Keywords:	Discrete Fourier transform, Association Schemes, Fuglede conjecture, Delsarte's linear programming bound, LP relaxations, Indexed in Scopus
Subjects:	Electrical Engineering
Divisions:	Department of Electrical Engineering
Depositing User:	Library Staff
Date Deposited:	14 Nov 2019 05:51
Last Modified:	14 Nov 2019 05:51
URI:	http://raiithold.iith.ac.in/id/eprint/6912
Publisher URL:	https://doi.org/10.1109/ISIT.2018.8437309
Related URLs:	Google Scholar

Actions (login required)

View Item

Statistics for this ePrint Item