Graph expression complexities and simultaneous linear recurrences

Mark Korenblit, Vadim E. Levit

Research output: Contribution to journalConference articlepeer-review


The paper investigates relationships between algebraic ex-pressions and graphs. Using the decomposition method we generate spe-cial simultaneous systems of linear recurrences for sizes of graph expres-sions. We propose techniques which provide closed-form solutions for these systems.

Original languageEnglish
Pages (from-to)104-108
Number of pages5
JournalCEUR Workshop Proceedings
StatePublished - 2017
EventJoint 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, ICTCS 2017 and CILC 2017 - Naples, Italy
Duration: 26 Sep 201728 Sep 2017


Dive into the research topics of 'Graph expression complexities and simultaneous linear recurrences'. Together they form a unique fingerprint.

Cite this