New lower bounds on crossing numbers of K_m,n from permutation modules and semidefinite programming

06/06/2022
by   Daniel Brosch, et al.
0

In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph K_m,n, extending a method from de Klerk et al. [SIAM J. Discrete Math. 20 (2006), 189-202] and the subsequent reduction by De Klerk, Pasechnik and Schrijver [Math. Prog. Ser. A and B, 109 (2007) 613-624]. We exploit the full symmetry of the problem by developing a block-diagonalization of the underlying matrix algebra and use it to improve bounds on several concrete instances. Our results imply that cr(K_10,n) ≥ 4.87057 n^2 - 10n, cr(K_11,n) ≥ 5.99939 n^2-12.5n, cr(K_12,n) ≥ 7.25579 n^2 - 15n, cr(K_13,n) ≥ 8.65675 n^2-18n for all n. The latter three bounds are computed using a new relaxation of the original semidefinite programming bound, by only requiring one small matrix block to be positive semidefinite. Our lower bound on K_13,n implies that for each fixed m ≥ 13, lim_n →∞cr(K_m,n)/Z(m,n) ≥ 0.8878 m/(m-1). Here Z(m,n) is the Zarankiewicz number: the conjectured crossing number of K_m,n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2019

New Bounds on k-Planar Crossing Numbers

The crossing number cr(G) of a graph G is the minimum number of crossing...
research
03/13/2022

Semidefinite programming bounds for binary codes from a split Terwilliger algebra

We study the upper bounds for A(n,d), the maximum size of codewords with...
research
07/21/2019

Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps

The traveling salesman problem (TSP) is a fundamental problem in combina...
research
08/05/2019

Accuracy of approximate projection to the semidefinite cone

When a projection of a symmetric or Hermitian matrix to the positive sem...
research
09/23/2017

Analogies between the crossing number and the tangle crossing number

Tanglegrams are special graphs that consist of a pair of rooted binary t...
research
06/22/2022

The Bounded Beam Search algorithm for the Block Relocation Problem

In this paper we deal with the restricted Block Relocation Problem. We p...
research
08/12/2021

Matrix pencils with coefficients that have positive semidefinite Hermitian part

We analyze when an arbitrary matrix pencil is equivalent to a dissipativ...

Please sign up or login with your details

Forgot password? Click here to reset