A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
From MaRDI portal
Publication:426914
zbMath1244.05019MaRDI QIDQ426914
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p34
Trees (05C05) Exact enumeration problems, generating functions (05A15) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (4)
The Goldman-Rota identity and the Grassmann scheme ⋮ A \(q\)-analog of the adjacency matrix of the \(n\)-cube ⋮ A \(Q\)-polynomial structure associated with the projective geometry \(L_N (q)\) ⋮ On non-optimally expanding sets in Grassmann graphs
This page was built for publication: A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
