Counting contours on trees

Noga Alon; Rodrigo Bissacot; Eric Ossami Endo

doi:10.1007/s11005-016-0927-6

Counting contours on trees

Noga Alon, Rodrigo Bissacot^*, Eric Ossami Endo

^*Corresponding author for this work

School of Computer Science

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

2 Scopus citations

Abstract

We calculate the exact number of contours of size n containing a fixed vertex in d-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with infinitely many contours of the same size containing a fixed vertex.

Original language	English
Pages (from-to)	887-899
Number of pages	13
Journal	Letters in Mathematical Physics
Volume	107
Issue number	5
DOIs	https://doi.org/10.1007/s11005-016-0927-6
State	Published - 1 May 2017

Keywords

Catalan numbers
Contours
Cut Sets
Peierls
Trees

Access to Document

10.1007/s11005-016-0927-6

Cite this

@article{965b9f11d79149dab893361b20f9394d,

title = "Counting contours on trees",

abstract = "We calculate the exact number of contours of size n containing a fixed vertex in d-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with infinitely many contours of the same size containing a fixed vertex.",

keywords = "Catalan numbers, Contours, Cut Sets, Peierls, Trees",

author = "Noga Alon and Rodrigo Bissacot and Endo, {Eric Ossami}",

note = "Publisher Copyright: {\textcopyright} 2016, Springer Science+Business Media Dordrecht.",

year = "2017",

month = may,

day = "1",

doi = "10.1007/s11005-016-0927-6",

language = "אנגלית",

volume = "107",

pages = "887--899",

journal = "Letters in Mathematical Physics",

issn = "0377-9017",

publisher = "Springer Netherlands",

number = "5",

}

TY - JOUR

T1 - Counting contours on trees

AU - Alon, Noga

AU - Bissacot, Rodrigo

AU - Endo, Eric Ossami

PY - 2017/5/1

Y1 - 2017/5/1

N2 - We calculate the exact number of contours of size n containing a fixed vertex in d-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with infinitely many contours of the same size containing a fixed vertex.

AB - We calculate the exact number of contours of size n containing a fixed vertex in d-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with infinitely many contours of the same size containing a fixed vertex.

KW - Catalan numbers

KW - Contours

KW - Cut Sets

KW - Peierls

KW - Trees

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

U2 - 10.1007/s11005-016-0927-6

DO - 10.1007/s11005-016-0927-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84996921023

SN - 0377-9017

VL - 107

SP - 887

EP - 899

JO - Letters in Mathematical Physics

JF - Letters in Mathematical Physics

IS - 5

ER -

Counting contours on trees

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this