In Honour of Ted Swart

05/08/2023
by   Stephen Gismondi, et al.
0

This is a tribute to my dear life-long friend, mentor and colleague Ted Swart. It includes anecdotal stories and memories of our times together, and also includes a new academic contribution in his honour, Teds polytope. Tweeks made to the Birkhoff polytope Bn endow Teds polytope Tn(ϵ) with a special tunable parameter ϵ = ϵ(n). Observe how Bn can be viewed as the convex hull of both the TSP polytope, and the set of non-tour permutation extrema, and, that its extended formulation is compact. Tours (connected 2-factor permutation matrices when viewed as adjacency matrices) can be distinguished from non-tours (disconnected 2-factor permutation matrices) where ϵ scales the magnitude of tweeks made to Bn. For ϵ > 0, Tn(ϵ) is tuned so that the convex hull of extrema corresponding to transformed tours is lifted from Bn, and separated (by a hyperplane) from the convex hull of extrema corresponding to translated non-tours. This leads to creation of the feasible region of an LP model that can decide existence of a tour in a graph based on an extended formulation of the TSP polytope. That is, by designing for polynomial-time distinguishable tour extrema embedded in a subspace disjoint from non-tour extrema, NP-completeness strongholds come into play, necessarily expressed in a non-compact extended formulation of Tn(ϵ) i.e. a compact extended formulation of the TSP polytope cannot exist. No matter, Ted would have loved these ideas, and Tn(ϵ) might one day yet be useful in the study of the P versus NP conundrum. In summary, Tn(ϵ) is a perturbed Bn i.e. the convex hull of both an ϵ-stretched TSP polytope, and the set of translated non-tour permutation extrema i.e. a TSP-like polytope and separable non-tour extrema.

READ FULL TEXT

page 1

page 5

research
03/26/2020

A Blind Permutation Similarity Algorithm

This paper introduces a polynomial blind algorithm that determines when ...
research
04/05/2023

Cryptanalysis of quantum permutation pad

Cryptanalysis increases the level of confidence in cryptographic algorit...
research
11/15/2019

Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles

The weighted T-free 2-matching problem is the following problem: given a...
research
11/27/2019

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles

Let G be an n-node graph without two disjoint odd cycles. The algorithm ...
research
04/02/2021

Permutation-Invariant Subgraph Discovery

We introduce Permutation and Structured Perturbation Inference (PSPI), a...
research
10/26/2017

Reparameterizing the Birkhoff Polytope for Variational Permutation Inference

Many matching, tracking, sorting, and ranking problems require probabili...
research
12/19/2019

Gaussianity and typicality in matrix distributional semantics

Constructions in type-driven compositional distributional semantics asso...

Please sign up or login with your details

Forgot password? Click here to reset