Sparse sums of squares on finite abelian groups and improved semidefinite lifts (Q344935): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Pablo A. Parrilo / rank
 
Normal rank
Property / review text
 
The paper is concerned with nonnegative functions on a finite abelian group \(G\) that are sparse with respect to the Fourier basis. The authors establish combinatorial conditions on subsets \(\mathcal{S}\) and \(\mathcal{T}\) of Fourier basis elements under which nonnegative functions with Fourier support \(\mathcal{S}\) are sums of squares of functions with Fourier support \(\mathcal{T}\). Their combinatorial condition involves constructing a chordal cover of a graph related to \(G\) and \(\mathcal{S}\) (Cayley graph Cay(\(\widehat{G},\mathcal{S}\))) with maximal cliques related to \(\mathcal{T}\). Their result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern, as well as a simple but key observation exploiting the structure of the Fourier basis elements of \(G\). They apply their main result to two important special cases, namely \(G=\mathbb{Z}^n_2\) (the Boolean hypercube) and \(G=\mathbb{Z}_N\).
Property / review text: The paper is concerned with nonnegative functions on a finite abelian group \(G\) that are sparse with respect to the Fourier basis. The authors establish combinatorial conditions on subsets \(\mathcal{S}\) and \(\mathcal{T}\) of Fourier basis elements under which nonnegative functions with Fourier support \(\mathcal{S}\) are sums of squares of functions with Fourier support \(\mathcal{T}\). Their combinatorial condition involves constructing a chordal cover of a graph related to \(G\) and \(\mathcal{S}\) (Cayley graph Cay(\(\widehat{G},\mathcal{S}\))) with maximal cliques related to \(\mathcal{T}\). Their result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern, as well as a simple but key observation exploiting the structure of the Fourier basis elements of \(G\). They apply their main result to two important special cases, namely \(G=\mathbb{Z}^n_2\) (the Boolean hypercube) and \(G=\mathbb{Z}_N\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Karl-Heinz Waldmann / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52B12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52B55 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6656094 / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite programming
Property / zbMATH Keywords: semidefinite programming / rank
 
Normal rank

Revision as of 07:04, 28 June 2023

scientific article
Language Label Description Also known as
English
Sparse sums of squares on finite abelian groups and improved semidefinite lifts
scientific article

    Statements

    Sparse sums of squares on finite abelian groups and improved semidefinite lifts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    The paper is concerned with nonnegative functions on a finite abelian group \(G\) that are sparse with respect to the Fourier basis. The authors establish combinatorial conditions on subsets \(\mathcal{S}\) and \(\mathcal{T}\) of Fourier basis elements under which nonnegative functions with Fourier support \(\mathcal{S}\) are sums of squares of functions with Fourier support \(\mathcal{T}\). Their combinatorial condition involves constructing a chordal cover of a graph related to \(G\) and \(\mathcal{S}\) (Cayley graph Cay(\(\widehat{G},\mathcal{S}\))) with maximal cliques related to \(\mathcal{T}\). Their result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern, as well as a simple but key observation exploiting the structure of the Fourier basis elements of \(G\). They apply their main result to two important special cases, namely \(G=\mathbb{Z}^n_2\) (the Boolean hypercube) and \(G=\mathbb{Z}_N\).
    0 references
    semidefinite programming
    0 references

    Identifiers