Noncommutative extensions of parameters in the asymptotic spectrum of graphs

07/21/2022
by   Péter Vrana, et al.
0

The zero-error capacity of a classical channel is a parameter of its confusability graph, and is equal to the minimum of the values of graph parameters that are additive under the disjoint union, multiplicative under the strong product, monotone under homomorphisms between the complements, and normalized. We show that any such function either has uncountably many extensions to noncommutative graphs with similar properties, or no such extensions at all. More precisely, we find that every extension has an exponent that characterizes its values on the confusability graphs of identity quantum channels, and the set of admissible exponents is either an unbounded subinterval of [1,∞) or empty. In particular, the set of admissible exponents for the Lovász number, the projective rank, and the fractional Haemers bound over the complex numbers are maximal, while the fractional clique cover number does not have any extensions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2018

The asymptotic spectrum of graphs and the Shannon capacity

We introduce the asymptotic spectrum of graphs and apply the theory of a...
research
03/05/2019

Probabilistic refinement of the asymptotic spectrum of graphs

The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.001...
research
08/19/2020

Fractional hypergraph isomorphism and fractional invariants

Fractional graph isomorphism is the linear relaxation of an integer prog...
research
02/01/2018

On a fractional version of Haemers' bound

In this note, we present a fractional version of Haemers' bound on the S...
research
04/24/2023

Fractional eternal domination: securely distributing resources across a network

This paper initiates the study of fractional eternal domination in graph...
research
05/02/2023

Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs

In the zero-error Slepian-Wolf source coding problem, the optimal rate i...
research
03/25/2021

Information theoretic parameters of non-commutative graphs and convex corners

We establish a second anti-blocker theorem for non-commutative convex co...

Please sign up or login with your details

Forgot password? Click here to reset