On the evaluation at (−ι,ι) of the Tutte polynomial of a binary matroid

2013/04/19 by Rudi Pendavingh, R. A. Pendavingh · 1 voice · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Advanced Topics in Algebra

paper · pdf · doi:10.1007/s10801-013-0442-0

openalex publication_date 2013/04/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Cited by

• Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding

Discussions

• Let $C$ be an $[n,k]_2$ binary linear code, i.e. a $k$ -dimensional subspace of $\mathbb F_2^n$ . Let the polynomial $p$ be the weight enumerator of $C$ , i.e. $p(x)=\sum_{c \in C} x^{|c|}$ , where $| [stackexchange, 7 points]