Change search
ReferencesLink to record
Permanent link

Direct link
On Postnikov-Shapiro Algebras and their generalizations
Stockholm University, Faculty of Science, Department of Mathematics.
(English)Manuscript (preprint) (Other academic)
Abstract [en]

A.Postnikov and B.Shapiro introduced a class of commutative algebras which enumerate forests and trees of graphs. Our main result is that the algebra counting forests depends only on graphical matroid and converse.

Also we generalize algebras for a hypergraph. For this, we define spanning forests and trees of a hypergraph and the corresponding "hypergraphical" matroid.

Keyword [en]
Tutte polynomial, graphical matroid, spanning forest
National Category
Discrete Mathematics
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:su:diva-132531OAI: oai:DiVA.org:su-132531DiVA: diva2:952673
Available from: 2016-08-15 Created: 2016-08-15 Last updated: 2016-11-03Bibliographically approved
In thesis
1. On a class of commutative algebras associated to graphs
Open this publication in new window or tab >>On a class of commutative algebras associated to graphs
2016 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

In 2004 Alexander Postnikov and Boris Shapiro introduced a class of commutative algebras for non-directed graphs. There are two main types of such algebras, algebras of the first type count spanning trees and algebras  of the second type count spanning forests. These algebras have a number of interesting properties including an explicit formula for their Hilbert series. In this thesis we mainly work with the second type of algebras, we discover more properties of the original algebra and construct a few generalizations. In particular we prove that the algebra counting forests depends only on graphical matroid of the graph and converse. Furthermore, its "K-theoretic" filtration reconstructs the whole graph. We introduse $t$ labelled algebras of a graph, their Hilbert series contains complete information about the Tutte polynomial of the initial graph. Finally we introduce similar algebras for hypergraphs. To do this, we define spanning forests and trees of a hypergraph and the corresponding "hypergraphical" matroid.

Place, publisher, year, edition, pages
Stockholm: Department of Mathematics, Stockholm University, 2016. 40 p.
National Category
Discrete Mathematics Algebra and Logic
Identifiers
urn:nbn:se:su:diva-132987 (URN)
Presentation
2016-09-05, Sal 14, hus 5, Kräftriket, Stockholm, 13:00 (English)
Opponent
Supervisors
Available from: 2016-11-03 Created: 2016-08-28 Last updated: 2016-11-03Bibliographically approved

Open Access in DiVA

fulltext(389 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 389 kBChecksum SHA-512
a6c66bf215829a608725af09e8ee673536f978c0e9b6f677b1d16efe7b6d5069a4f138fe9a0d683f304429ff32efa0c11ef027477f87ccaf53afc4ce2bded477
Type fulltextMimetype application/pdf

Other links

arXiv:1509.08736

Search in DiVA

By author/editor
Nenashev, Gleb
By organisation
Department of Mathematics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 49 hits
ReferencesLink to record
Permanent link

Direct link