Counting invertible Schrödinger operators over finite fields for trees, cycles and complete graphs (Q907230): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1408.6943 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Salem Numbers, Pisot Numbers, Mahler Measure, and Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3094456 / rank | |||
Normal rank | |||
Latest revision as of 09:35, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting invertible Schrödinger operators over finite fields for trees, cycles and complete graphs |
scientific article |
Statements
Counting invertible Schrödinger operators over finite fields for trees, cycles and complete graphs (English)
0 references
25 January 2016
0 references
Summary: We count invertible Schrödinger operators (perturbations by diagonal matrices of the adjacency matrix) over finite fields for trees, cycles and complete graphs. This is achieved for trees through the definition and use of local invariants (algebraic constructions of perhaps independent interest). Cycles and complete graphs are treated by ad hoc methods.
0 references
enumerative combinatorics
0 references
invariants
0 references
Schrödinger operator
0 references
