Graph expression complexities and simultaneous linear recurrences

Mark Korenblit; Vadim E. Levit

Graph expression complexities and simultaneous linear recurrences

Mark Korenblit
, Vadim E. Levit

Department of Mathematics

نتاج البحث: نشر في مجلة › مقالة من مؤنمر › مراجعة النظراء

ملخص

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.

اللغة الأصلية	الإنجليزيّة
الصفحات (من إلى)	104-108
عدد الصفحات	5
دورية	CEUR Workshop Proceedings
مستوى الصوت	1949
حالة النشر	نُشِر - 2017
الحدث	Joint 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, ICTCS 2017 and CILC 2017 - Naples, إيطاليا المدة: 26 سبتمبر 2017 → 28 سبتمبر 2017

الملفات والروابط الأخرى

Link to publication in Scopus

قم بذكر هذا

@article{65d48a6ad7f14022953ff22625736f4b,

title = "Graph expression complexities and simultaneous linear recurrences",

abstract = "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.",

author = "Mark Korenblit and Levit, \{Vadim E.\}",

year = "2017",

language = "אנגלית",

volume = "1949",

pages = "104--108",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

publisher = "CEUR-WS",

note = "Joint 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, ICTCS 2017 and CILC 2017 ; Conference date: 26-09-2017 Through 28-09-2017",

}

TY - JOUR

T1 - Graph expression complexities and simultaneous linear recurrences

AU - Korenblit, Mark

AU - Levit, Vadim E.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85031910506

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85031910506

SN - 1613-0073

VL - 1949

SP - 104

EP - 108

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

T2 - Joint 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, ICTCS 2017 and CILC 2017

Y2 - 26 September 2017 through 28 September 2017

ER -

Graph expression complexities and simultaneous linear recurrences

ملخص

الملفات والروابط الأخرى

بصمة

قم بذكر هذا