The dimension of an orbitope based on a solution to the Legendre pair problem

01/04/2023
by   Kristopher N. Kilpatrick, et al.
0

The Legendre pair problem is a particular case of a rank-1 semidefinite description problem that seeks to find a pair of vectors (𝐮,𝐯) each of length ℓ such that the vector (𝐮^⊤,𝐯^⊤)^⊤ satisfies the rank-1 semidefinite description. The group (ℤ_ℓ×ℤ_ℓ)⋊ℤ^×_ℓ acts on the solutions satisfying the rank-1 semidefinite description by ((i,j),k)(𝐮,𝐯)=((i,k)𝐮,(j,k)𝐯) for each ((i,j),k) ∈ (ℤ_ℓ×ℤ_ℓ)⋊ℤ^×_ℓ. By applying the methods based on representation theory in Bulutoglu [Discrete Optim. 45 (2022)], and results in Ingleton [Journal of the London Mathematical Society s(1-31) (1956), 445-460] and Lam and Leung [Journal of Algebra 224 (2000), 91-109], for a given solution (𝐮^⊤,𝐯^⊤)^⊤ satisfying the rank-1 semidefinite description, we show that the dimension of the convex hull of the orbit of 𝐮 under the action of ℤ_ℓ or ℤ_ℓ⋊ℤ^×_ℓ is ℓ-1 provided that ℓ=p^n or ℓ=pq^i for i=1,2, any positive integer n, and any two odd primes p,q. Our results lead to the conjecture that this dimension is ℓ-1 in both cases. We also show that the dimension of the convex hull of all feasible points of the Legendre pair problem of length ℓ is 2ℓ-2 provided that it has at least one feasible point.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2017

A lower bound on the positive semidefinite rank of convex bodies

The positive semidefinite rank of a convex body C is the size of its sma...
research
02/01/2016

Solving rank-constrained semidefinite programs in exact arithmetic

We consider the problem of minimizing a linear function over an affine s...
research
02/21/2022

Graph Coloring and Semidefinite Rank

This paper considers the interplay between semidefinite programming, mat...
research
11/01/2022

Linear optimization over homogeneous matrix cones

A convex cone is homogeneous if its automorphism group acts transitively...
research
02/23/2021

Multi-Group Multicast Beamforming by Superiorized Projections onto Convex Sets

In this paper, we propose an iterative algorithm to address the nonconve...
research
12/23/2017

A Low-Rank Approach to Off-The-Grid Sparse Deconvolution

We propose a new solver for the sparse spikes deconvolution problem over...
research
11/14/2018

Design of Spectrally Shaped Binary Sequences via Randomized Convex Relaxation

Wideband communication receivers often deal with the problems of detecti...

Please sign up or login with your details

Forgot password? Click here to reset