Spinorial formulations of graph problems (Q430733): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: H. S. Yoon / rank | |||
Normal rank | |||
Property / review text | |||
This paper presents a spinorial formulation of some problems in graph theory. Firstly, it gives a brief review of basic results from graph theory and from Clifford algebras and spinors. Then, starting with an arbitrary finite graph, spinor spaces are constructed such that their properties reveal information about the structure of the graph. Spinor polynomials are introduced, and the notions of degrees of polynomials and Fock subspace dimensions are tied together with matchings, cliques, independent sets, and cycle covers of arbitrary finite graphs. The maximal clique problem is revisited and a new spinorial formulation based on the graph's vertex incidence spinor is presented. Finally, the spinor adjacency operator associated with a graph is introduced and used to enumerate cycles of arbitrary length. | |||
Property / review text: This paper presents a spinorial formulation of some problems in graph theory. Firstly, it gives a brief review of basic results from graph theory and from Clifford algebras and spinors. Then, starting with an arbitrary finite graph, spinor spaces are constructed such that their properties reveal information about the structure of the graph. Spinor polynomials are introduced, and the notions of degrees of polynomials and Fock subspace dimensions are tied together with matchings, cliques, independent sets, and cycle covers of arbitrary finite graphs. The maximal clique problem is revisited and a new spinorial formulation based on the graph's vertex incidence spinor is presented. Finally, the spinor adjacency operator associated with a graph is introduced and used to enumerate cycles of arbitrary length. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A66 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6050297 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spinors | |||
Property / zbMATH Keywords: spinors / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graphs | |||
Property / zbMATH Keywords: graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cliques | |||
Property / zbMATH Keywords: cliques / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
matchings | |||
Property / zbMATH Keywords: matchings / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cycles | |||
Property / zbMATH Keywords: cycles / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quantum probability | |||
Property / zbMATH Keywords: quantum probability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Clifford algebra | |||
Property / zbMATH Keywords: Clifford algebra / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite graph | |||
Property / zbMATH Keywords: finite graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spinor space | |||
Property / zbMATH Keywords: spinor space / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spinor polynomials | |||
Property / zbMATH Keywords: spinor polynomials / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Fock subspace | |||
Property / zbMATH Keywords: Fock subspace / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00006-011-0298-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2095129445 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cohomology in the pure spinor formalism for the superstring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A spinorial formulation of the maximum clique problem of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On computational complexity of Clifford algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5525829 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5830680 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spinor approach to the rotation and reflection groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2711809 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2881260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nilpotent adjacency matrices, random graphs and quantum random variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new adjacency matrix for finite graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:19, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Spinorial formulations of graph problems |
scientific article |
Statements
Spinorial formulations of graph problems (English)
0 references
26 June 2012
0 references
This paper presents a spinorial formulation of some problems in graph theory. Firstly, it gives a brief review of basic results from graph theory and from Clifford algebras and spinors. Then, starting with an arbitrary finite graph, spinor spaces are constructed such that their properties reveal information about the structure of the graph. Spinor polynomials are introduced, and the notions of degrees of polynomials and Fock subspace dimensions are tied together with matchings, cliques, independent sets, and cycle covers of arbitrary finite graphs. The maximal clique problem is revisited and a new spinorial formulation based on the graph's vertex incidence spinor is presented. Finally, the spinor adjacency operator associated with a graph is introduced and used to enumerate cycles of arbitrary length.
0 references
spinors
0 references
graphs
0 references
cliques
0 references
matchings
0 references
cycles
0 references
quantum probability
0 references
Clifford algebra
0 references
finite graph
0 references
spinor space
0 references
spinor polynomials
0 references
Fock subspace
0 references