New lower bounds on crossing numbers of Km,n from semidefinite programming
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:189–202, 2006) and the subsequent reduction by De Klerk, Pasechnik a...
Saved in:
| Published in: | Mathematical programming Vol. 207; no. 1-2; pp. 693 - 715 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.09.2024
|
| Subjects: | |
| ISSN: | 0025-5610, 1436-4646 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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:189–202, 2006) and the subsequent reduction by De Klerk, Pasechnik and Schrijver (Math Prog Ser A and B 109:613–624, 2007). We exploit the full symmetry of the problem using a novel decomposition technique. This results in a full block-diagonalization of the underlying matrix algebra, which we use to improve bounds on several concrete instances. Our results imply that
cr
(
K
10
,
n
)
≥
4.87057
n
2
-
10
n
,
cr
(
K
11
,
n
)
≥
5.99939
n
2
-
12.5
n
,
cr
(
K
12
,
n
)
≥
7.25579
n
2
-
15
n
,
cr
(
K
13
,
n
)
≥
8.65675
n
2
-
18
n
for all
n
. The latter three bounds are computed using a new and well-performing relaxation of the original semidefinite programming bound. This new relaxation is obtained by only requiring one small matrix block to be positive semidefinite. |
|---|---|
| ISSN: | 0025-5610 1436-4646 |
| DOI: | 10.1007/s10107-023-02028-1 |