graph_adj_trace_seq
def
For a graph G on a finite vertex set V, its adjacency trace sequence (a_i(G))_{i=1}^∞ is the sequence of real numbers tr(A(G)^i) for positive integers i.
Statement
noncomputable def graph_adj_trace_seq {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ+ → ℝ
- Defined in
- arXiv:2610.36127 Definition 13
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 1
- is_adj_trace_minimalA graph G on a finite vertex set V is trace-minimal in the class of d-regular graphs if G is d-regular and its adjacency trace sequence is…
Read back from the Lean
For a finite type V and a simple graph G on V, graph_adj_trace_seq G is defined as the sequence from positive integers ℕ+ to ℝ that sends each positive integer i to the trace of the i-th power of the real adjacency matrix of G (i.e., $\operatorname{Tr}((A_G)^i)$).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The adjacency trace sequence of a graph, defined as the trace of powers A(G)^i for i ≥ 1. -/ noncomputable def graph_adj_trace_seq {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ+ → ℝ := open scoped Classical in fun i ↦ ((G.adjMatrix ℝ) ^ (i : ℕ)).trace