Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
"K-theoretic" analog of Postnikov-Shapiro algebra distinguishes graphs
Stockholm University, Faculty of Science, Department of Mathematics.
Stockholm University, Faculty of Science, Department of Mathematics.
2017 (English)In: Journal of combinatorial theory. Series A (Print), ISSN 0097-3165, E-ISSN 1096-0899, Vol. 148, 316-332 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we study a filtered "K-theoretical" analog of a graded algebra associated to any loopless graph G which was introduced in \cite{PS}. We show that two such filtered algebras are isomorphic if and only if their graphs are isomorphic. We also study a large family of filtered generalizations of the latter graded algebra which includes the above "K-theoretical" analog.

Place, publisher, year, edition, pages
2017. Vol. 148, 316-332 p.
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:su:diva-132988DOI: 10.1016/j.jcta.2017.01.001ISI: 000394723900011OAI: oai:DiVA.org:su-132988DiVA: diva2:955998
Available from: 2016-08-28 Created: 2016-08-28 Last updated: 2017-05-02Bibliographically 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

No full text

Other links

Publisher's full textarXiv:1603.04654

Search in DiVA

By author/editor
Nenashev, GlebShapiro, Boris
By organisation
Department of Mathematics
In the same journal
Journal of combinatorial theory. Series A (Print)
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf