scholarly journals Orthogonal representations over finite fields and the chromatic number of graphs

COMBINATORICA ◽  
1996 ◽  
Vol 16 (3) ◽  
pp. 417-431 ◽  
Author(s):  
Ren� Peeters
Keyword(s):  
Chromatic Number ◽  
Finite Fields ◽  
Orthogonal Representations

scholarly journals On the Quantum Chromatic Number of a Graph

10.37236/999 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Peter J. Cameron ◽  
Ashley Montanaro ◽  
Michael W. Newman ◽  
Simone Severini ◽  
Andreas Winter
Keyword(s):  
Chromatic Number ◽  
Random Graphs ◽  
First Principles ◽  
Clique Number ◽  
The Other ◽  
Quantum Model ◽  
Other Hand ◽  
Orthogonal Representations

We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a referee that they have a colouring of the graph.After discussing this notion from first principles, we go on to establish relations with the clique number and orthogonal representations of the graph. We also prove several general facts about this graph parameter and find large separations between the clique number and the quantum chromatic number by looking at random graphs. Finally, we show that there can be no separation between classical and quantum chromatic number if the latter is $2$, nor if it is $3$ in a restricted quantum model; on the other hand, we exhibit a graph on $18$ vertices and $44$ edges with chromatic number $5$ and quantum chromatic number $4$.

Finite Fields

1996 ◽  
Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  
Finite Fields

Maximum Distance Separable Hankel Rhotrices over Finite Fields

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Maximum Distance Separable

Notes on three-pass protocol

2020 ◽  
Vol 25 (4) ◽  
pp. 4-9
Author(s):  
Yerzhan R. Baissalov ◽  
Ulan Dauyl
Keyword(s):  
Finite Fields ◽  
Matrix Algebras ◽  
Associative Structures

The article discusses primitive, linear three-pass protocols, as well as three-pass protocols on associative structures. The linear three-pass protocols over finite fields and the three-pass protocols based on matrix algebras are shown to be cryptographically weak.

About the Complexity of Square Root Extraction Algorithms in Finite Fields and Residue Rings

Vestnik MEI ◽  
2018 ◽  
Vol 5 (5) ◽  
pp. 79-88
Author(s):  
Sergey B. Gashkov ◽  
◽  
Aleksandr B. Frolov ◽  
Elizaveta Р. Popova ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Square Root ◽  
Root Extraction
Sign in / Sign up

Export Citation Format

Share Document