graph_lap_trace_seq
def
For a graph G on a finite vertex set V, its Laplacian trace sequence (ℓ_i(G))_{i=1}^∞ is the sequence of real numbers tr(L(G)^i) for positive integers i.
Statement
noncomputable def graph_lap_trace_seq {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ+ → ℝ
- Defined in
- arXiv:2610.36127 Definition 31
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 2
- regular_graph_lap_mul_pow_scalar_sub_all_ones_traceFor each d-regular graph G on n vertices and each pair of positive integers i and j, the trace of L(G)^i ((d+1)I_n - J_n)^j equals (d+1)^j…
- is_lap_trace_minimalA graph G on a finite vertex set V is Laplacian trace-minimal in the class of d-regular graphs if G is d-regular and its Laplacian trace…
Read back from the Lean
Given a finite type V and a simple graph G on V, graph_lap_trace_seq G is the function (sequence) from positive integers ℕ+ to ℝ that maps each positive integer i to the trace of the i-th power of the Laplacian matrix of G with real coefficients, ((G.lapMatrix ℝ) ^ (i : ℕ)).trace.
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 Laplacian trace sequence of a graph, defined as the trace of powers L(G)^i for i ≥ 1. -/ noncomputable def graph_lap_trace_seq {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ+ → ℝ := open scoped Classical in fun i ↦ ((G.lapMatrix ℝ) ^ (i : ℕ)).trace