Topological Representation of the Transit Sets of k-Point Crossover Operators

12/25/2017
by   Manoj Changat, et al.
0

k-point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of k-point crossover generate, for all k>1, the same convexity as the interval function of the underlying graph. This settles in the negative an open problem by Mulder about whether the geodesic convexity of a connected graph G is uniquely determined by its interval function I. The conjecture of Gitchoff and Wagner that for each transit set R_k(x,y) distinct from a hypercube there is a unique pair of parents from which it is generated is settled affirmatively. Along the way we characterize transit functions whose underlying graphs are Hamming graphs, and those with underlying partial cube graphs. For general values of k it is shown that the transit sets of k-point crossover operators are the subsets with maximal Vapnik-Chervonenkis dimension. Moreover, the transit sets of k-point crossover on binary strings form topes of uniform oriented matroid of VC-dimension k+1. The Topological Representation Theorem for oriented matroids therefore implies that k-point crossover operators can be represented by pseudosphere arrangements. This provides the tools necessary to study the special case k=2 in detail.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2020

Ample completions of OMs and CUOMs

This paper considers completions of COMs (complexes oriented matroids) t...
research
05/14/2020

The Interval function, Ptolemaic, distance hereditary, bridged graphs and axiomatic characterizations

In this paper we consider certain types of betweenness axioms on the int...
research
10/12/2018

Chromatic Polynomials of Oriented Graphs

The oriented chromatic polynomial of a oriented graph outputs the number...
research
09/04/2018

Shape-Enforcing Operators for Point and Interval Estimators

A common problem in statistics is to estimate and make inference on func...
research
03/31/2022

Weakly toll convexity and proper interval graphs

A walk u_0u_1 … u_k-1u_k is a weakly toll walk if u_0u_i ∈ E(G) implies ...
research
11/15/2018

A study of cops and robbers in oriented graphs

We consider the well-studied cops and robbers game in the context of ori...
research
02/15/2022

A new discrete theory of pseudoconvexity

Recently geometric hypergraphs that can be defined by intersections of p...

Please sign up or login with your details

Forgot password? Click here to reset