2007
DOI: 10.1016/j.jalgebra.2006.06.048
|View full text |Cite
|
Sign up to set email alerts
|

Hilbert series of algebras associated to directed graphs

Abstract: We compute the Hilbert series of some algebras associated to directed graphs and related to factorizations of noncommutative polynomials.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
20
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 15 publications
(22 citation statements)
references
References 7 publications
2
20
0
Order By: Relevance
“…We may replace σ by r i σ for some i and assume σ (1) = 1. Then σ (12) is either (12) or (1n), which implies either σ (2) = 2 (and thus σ = id) or σ (2) = n. In the latter case σ = (2n)(3n − 1)(4n − 2) · · · = s. Thus r and s generate the automorphism group of Γ D n ; this is the dihedral group on n elements, D n . Note that these automorphisms may be viewed as reflections and rotations of the n-gon.…”
Section: Automorphism Groups Of the Algebrasmentioning
confidence: 98%
See 2 more Smart Citations
“…We may replace σ by r i σ for some i and assume σ (1) = 1. Then σ (12) is either (12) or (1n), which implies either σ (2) = 2 (and thus σ = id) or σ (2) = n. In the latter case σ = (2n)(3n − 1)(4n − 2) · · · = s. Thus r and s generate the automorphism group of Γ D n ; this is the dihedral group on n elements, D n . Note that these automorphisms may be viewed as reflections and rotations of the n-gon.…”
Section: Automorphism Groups Of the Algebrasmentioning
confidence: 98%
“…This will give us a recursion that can then be written as a generating function. The second method of proof is much shorter and uses a theorem from [12] that gives a formula for the Hilbert series of an algebra associated to a directed, layered graph. Method 1.…”
Section: Proposition 33 the Hilbert Series For A(γ D N ) Ismentioning
confidence: 99%
See 1 more Smart Citation
“…We begin by recalling (from [9]) that a complete layered graph is a layered graph Γ = (V , E) with Proof. It is sufficient to prove the result for gr A(Γ ).…”
Section: Koszulity Of Certain A(γ )mentioning
confidence: 99%
“…Our interest in the Möbius polynomial stems from previous work on the splitting algebra or universal labeling algebra of a poset, introduced by Gelfand, Retakh, Serconek, and Wilson in their 2005 paper [2]. In their 2007 paper [3], they showed that the Hilbert series of the algebra A(P ) associated to a finite ranked poset P could be calculated using the formula:…”
Section: Introductionmentioning
confidence: 99%