The Tutte polynomial modulo a prime

AJ Goodall

doi:10.1016/S0196-8858(03)00084-8

The Tutte polynomial modulo a prime

AJ Goodall

School of Mathematics

Research output: Contribution to journal › Article (Academic Journal) › peer-review

Abstract

For F_p the field on prime number p > 3 elements, it has been conjectured that there are just p + 3 evaluations of the Tutte polynomial in F_p which are computable in polynomial time. In this note it is shown that if p not equivalent to -1 mod 12 then there are further polynomial-time computable evaluations. (C) 2003 Elsevier Inc. All rights reserved.

Translated title of the contribution	The Tutte polynomial modulo a prime
Original language	English
Pages (from-to)	293 - 298
Number of pages	6
Journal	Advances in Applied Mathematics
Volume	32 (1-2)
DOIs	https://doi.org/10.1016/S0196-8858(03)00084-8
Publication status	Published - Jan 2004

Bibliographical note

Publisher: Academic Press Inc Elsevier Science
Other identifier: IDS Number: 757LV

Access to Document

10.1016/S0196-8858(03)00084-8

Handle.net

Persistent link

Cite this

@article{681c6bc07bf24a9ba66aa97489242c09,

title = "The Tutte polynomial modulo a prime",

abstract = "For F_p the field on prime number p > 3 elements, it has been conjectured that there are just p + 3 evaluations of the Tutte polynomial in F_p which are computable in polynomial time. In this note it is shown that if p not equivalent to -1 mod 12 then there are further polynomial-time computable evaluations. (C) 2003 Elsevier Inc. All rights reserved.",

author = "AJ Goodall",

note = "Publisher: Academic Press Inc Elsevier Science Other identifier: IDS Number: 757LV ",

year = "2004",

month = jan,

doi = "10.1016/S0196-8858(03)00084-8",

language = "English",

volume = "32 (1-2)",

pages = "293 -- 298",

journal = "Advances in Applied Mathematics",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - The Tutte polynomial modulo a prime

AU - Goodall, AJ

N1 - Publisher: Academic Press Inc Elsevier Science Other identifier: IDS Number: 757LV

PY - 2004/1

Y1 - 2004/1

N2 - For F_p the field on prime number p > 3 elements, it has been conjectured that there are just p + 3 evaluations of the Tutte polynomial in F_p which are computable in polynomial time. In this note it is shown that if p not equivalent to -1 mod 12 then there are further polynomial-time computable evaluations. (C) 2003 Elsevier Inc. All rights reserved.

AB - For F_p the field on prime number p > 3 elements, it has been conjectured that there are just p + 3 evaluations of the Tutte polynomial in F_p which are computable in polynomial time. In this note it is shown that if p not equivalent to -1 mod 12 then there are further polynomial-time computable evaluations. (C) 2003 Elsevier Inc. All rights reserved.

U2 - 10.1016/S0196-8858(03)00084-8

DO - 10.1016/S0196-8858(03)00084-8

M3 - Article (Academic Journal)

VL - 32 (1-2)

SP - 293

EP - 298

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

ER -

The Tutte polynomial modulo a prime

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this