65 research outputs found
A Generalization of Kochen-Specker Sets Relates Quantum Coloring to Entanglement-Assisted Channel Capacity
We introduce two generalizations of Kochen-Specker (KS) sets: projective KS
sets and generalized KS sets. We then use projective KS sets to characterize
all graphs for which the chromatic number is strictly larger than the quantum
chromatic number. Here, the quantum chromatic number is defined via a nonlocal
game based on graph coloring. We further show that from any graph with
separation between these two quantities, one can construct a classical channel
for which entanglement assistance increases the one-shot zero-error capacity.
As an example, we exhibit a new family of classical channels with an
exponential increase.Comment: 16 page
On the convergence of cluster expansions for polymer gases
We compare the different convergence criteria available for cluster
expansions of polymer gases subjected to hard-core exclusions, with emphasis on
polymers defined as finite subsets of a countable set (e.g. contour expansions
and more generally high- and low-temperature expansions). In order of
increasing strength, these criteria are: (i) Dobrushin criterion, obtained by a
simple inductive argument; (ii) Gruber-Kunz criterion obtained through the use
of Kirkwood-Salzburg equations, and (iii) a criterion obtained by two of us via
a direct combinatorial handling of the terms of the expansion. We show that for
subset polymers our sharper criterion can be proven both by a suitable
adaptation of Dobrushin inductive argument and by an alternative --in fact,
more elementary-- handling of the Kirkwood-Salzburg equations. In addition we
show that for general abstract polymers this alternative treatment leads to the
same convergence region as the inductive Dobrushin argument and, furthermore,
to a systematic way to improve bounds on correlations
APPLICATING CVD ALGORITHM ON EDGE-COLORING OF SPECIAL GRAPHS
Heuristics algorithm is a soultion method that typically relatively quick to find a feasibel soloution with reasonable time and quality though there are no guarantees about if the quality of the solution is bad. This research explores the application of Conflicting Vertex Displacement (CVD) algorithm on edge-coloring of special graphs. This algorithm found by Fiol and Vilaltella [2] 6in 2012 and uses the idea of recolor of two âconflictsâ edges (edges that are incident to a vertex) along the paths of adjacent vertices. The research tests the algorithm on special graphs, ie. bipartite graphs
An experimental study of the minimum linear colouring arrangement problem
The Minimum Linear Colouring Arrangement problem (MinLCA) is a variation from the Minimum Linear Arrangement problem (MinLA) and the Colouring problem. The objective of our problem is finding the best proper colouring of a graph for which the sum of the induced distances between two adjacent vertices is the minimum. In this project, we undertake the task of broadening the previous studies for the MinLCA problem. The main goal is developing some exact algorithms based on backtracking and some heuristic algorithms based on a maximal independent set approach and testing them with different instances of graph families. As a secondary goal we are interested in providing theoretical results for particular graphs. The results will be made available in a simple, open-access benchmarking platform
On (3, k) Ramsey graphs: Theoretical and computational results
A (3,k,n,e) Ramsey graph is a triangle-free graph on n vertices with e edges and no independent set of size k. Similarly, a (3,k)-, (3,k,n)- or (3,k,n,e)-graph is a (3,k,n,e) Ramsey graph for some nand e. In the first part of the paper we derive an explicit formula for the minimum number of edges in any (3,k,n)graph for n †3(k-I), i.e. a partial formula for the function e(3,k,n) investigated in [3,5,7]. We prove some general properties of minimum (3,k,n)- graphs with e(3,k,n) edges and present a construction of minimum (3,k+I,3k-I,5k-5)-graphs for k ℠2 and minimum (3,k+1,3k,5k)-graphs for k ℠4. In the second part of the paper we describe a catalogue of small Ramsey graphs: all (3,k)-graphs for k ~6 and some (3,7)-graphs including all 191 (3,7,22)-graphs, produced by a computer. We present for k †7 all minimum (3,k,n)-graphs and all 10 maximum (3,7,22)-graphs with 66 edges. *Please refer to full-text for correct equations and numerical value
Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs
Let S be a subset of a group G. We call S a Sidon subset of the first (second) kind, if for any x, y, z, w â S of which at least 3 are different, xy â zw (xy-1 â zw-1, resp.). (For abelian groups, the two notions coincide.) If G has a Sidon subset of the second kind with n elements then every n-vertex graph is an induced subgraph of some Cayley graph of G. We prove that a sufficient condition for G to have a Sidon subset of order n (of either kind) is that (âGâ â©Ÿ cn3. For elementary Abelian groups of square order, âGâ â©Ÿ n2 is sufficient. We prove that most graphs on n vertices are not induced subgraphs of any vertex transitive graph with <cn2/log2n vertices. We comment on embedding trees and, in particular, stars, as induced subgraphs of Cayley graphs, and on the related problem of product-free (sum-free) sets in groups. We summarize the known results on the cardinality of Sidon sets of infinite groups, and formulate a number of open problems.We warn the reader that the sets considered in this paper are different from the Sidon sets Fourier analysts investigate
- âŠ