A graph-theoretic approach for comparing dimensions of components in simply-graded algebras

Yuval Ginosar; Ofir Schnabel

doi:10.1016/j.disc.2014.08.018

A graph-theoretic approach for comparing dimensions of components in simply-graded algebras

Yuval Ginosar, Ofir Schnabel

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal.

Original language	English
Pages (from-to)	59-63
Number of pages	5
Journal	Discrete Mathematics
Volume	338
DOIs	https://doi.org/10.1016/j.disc.2014.08.018
State	Published - 6 Jan 2015

Bibliographical note

Publisher Copyright:
© 2014 Elsevier B.V.

Keywords

Mutually neighbored vertices
Simply-graded algebras

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2014.08.018

Cite this

@article{8fcbc261e92f4f3e9cfa03cdfa5284d2,

title = "A graph-theoretic approach for comparing dimensions of components in simply-graded algebras",

abstract = "Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal.",

keywords = "Mutually neighbored vertices, Simply-graded algebras",

author = "Yuval Ginosar and Ofir Schnabel",

note = "Publisher Copyright: {\textcopyright} 2014 Elsevier B.V.",

year = "2015",

month = jan,

day = "6",

doi = "10.1016/j.disc.2014.08.018",

language = "English",

volume = "338",

pages = "59--63",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

}

TY - JOUR

T1 - A graph-theoretic approach for comparing dimensions of components in simply-graded algebras

AU - Ginosar, Yuval

AU - Schnabel, Ofir

PY - 2015/1/6

Y1 - 2015/1/6

N2 - Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal.

AB - Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal.

KW - Mutually neighbored vertices

KW - Simply-graded algebras

UR - http://www.scopus.com/inward/record.url?scp=84908200303&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2014.08.018

DO - 10.1016/j.disc.2014.08.018

M3 - Article

AN - SCOPUS:84908200303

SN - 0012-365X

VL - 338

SP - 59

EP - 63

JO - Discrete Mathematics

JF - Discrete Mathematics

ER -

A graph-theoretic approach for comparing dimensions of components in simply-graded algebras

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this