On zeros of the characteristic polynomial of matroids of bounded tree-width

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/13421

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chun, C	-
dc.contributor.author	Hall, R	-
dc.contributor.author	Merino, C	-
dc.contributor.author	Noble, S	-
dc.date.accessioned	2016-10-26T13:05:00Z	-
dc.date.available	2017-02-01	-
dc.date.available	2016-10-26T13:05:00Z	-
dc.date.issued	2017	-
dc.identifier.citation	European Journal of Combinatorics, 60: pp. 10 - 20, (2017)	en_US
dc.identifier.issn	0195-6698	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/13421	-
dc.description.abstract	We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power qq and constant kk, the characteristic polynomial of any loopless, GF(q)GF(q)-representable matroid with tree-width kk has no real zero greater than qk−1qk−1.	en_US
dc.format.extent	10 - 20	-
dc.language.iso	en	en_US
dc.publisher	Elsevier	en_US
dc.title	On zeros of the characteristic polynomial of matroids of bounded tree-width	en_US
dc.type	Article	en_US
dc.identifier.doi	http://dx.doi.org/10.1016/j.ejc.2016.08.011	-
dc.relation.isPartOf	European Journal of Combinatorics	-
pubs.publication-status	Accepted	-
pubs.volume	60	-
Appears in Collections:	Dept of Mathematics Research Papers

Files in This Item:

File	Description	Size	Format
Fulltext.pdf		288.99 kB	Adobe PDF	View/Open