Combinatorics of the two-variable zeta function

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the rank polynomial of a matroid and some well-known applications to graphs and linear codes. We compare rank polynomials with two-variable zeta functions for algebraic curves. This leads us to normalize the rank polynomial and to extend it to a rational rank function. As applications to linear codes we mention: A formulation of Greene's theorem similar to an identity for zeta functions of curves first found by Deninger, the definition of a class of generating functions for support weight enumerators, and a relation for algebraic-geometric codes between the matroid of a code and the two-variable zeta function of a curve. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Duursma, I. M. (2004). Combinatorics of the two-variable zeta function. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2948, 109–136. https://doi.org/10.1007/978-3-540-24633-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free