All I Really Need To Know, I Learned From Dr. Z

Andrew V. Sills

All I Really Need To Know, I Learned From Dr. Z

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

Thanks to Robert Fulghum for providing a title to parody. In order to honor Doron on his 60th birthday, I will discuss a mathematical problem that I am currently working on, deliberately highlighting the useful advice that Doron gave me during my years as his postdoc, and via his famous Opinions page.

The mathematical content of the talk is joint work with Hua Wang. The Wiener index of a graph G=(V,E), which is the sum of minimal distances between every pair of vertices in V, was introduced by H. Wiener in 1947. We consider the problem of identifying trees of maximal Wiener index among all trees that possess a given degree sequence.

Original language	American English
State	Published - May 28 2010
Event	From A=B to Z=60: Conference in Honor of Doron Zeilberger's 60th Birthday - Duration: May 28 2010 → …

Conference

Conference	From A=B to Z=60: Conference in Honor of Doron Zeilberger's 60th Birthday
Period	05/28/10 → …

DC Disciplines

Mathematics
Physical Sciences and Mathematics

Access to Document

http://sites.math.rutgers.edu/events/Z60/abstracts.html

Cite this

@conference{7c9977586e24428bad7884432e4f269d,

title = "All I Really Need To Know, I Learned From Dr. Z",

abstract = " Thanks to Robert Fulghum for providing a title to parody. In order to honor Doron on his 60th birthday, I will discuss a mathematical problem that I am currently working on, deliberately highlighting the useful advice that Doron gave me during my years as his postdoc, and via his famous Opinions page. The mathematical content of the talk is joint work with Hua Wang. The Wiener index of a graph G=(V,E), which is the sum of minimal distances between every pair of vertices in V, was introduced by H. Wiener in 1947. We consider the problem of identifying trees of maximal Wiener index among all trees that possess a given degree sequence.",

author = "Sills, {Andrew V.}",

year = "2010",

month = may,

day = "28",

language = "American English",

note = "From A=B to Z=60: Conference in Honor of Doron Zeilberger's 60th Birthday ; Conference date: 28-05-2010",

}

TY - CONF

T1 - All I Really Need To Know, I Learned From Dr. Z

AU - Sills, Andrew V.

PY - 2010/5/28

Y1 - 2010/5/28

N2 - Thanks to Robert Fulghum for providing a title to parody. In order to honor Doron on his 60th birthday, I will discuss a mathematical problem that I am currently working on, deliberately highlighting the useful advice that Doron gave me during my years as his postdoc, and via his famous Opinions page. The mathematical content of the talk is joint work with Hua Wang. The Wiener index of a graph G=(V,E), which is the sum of minimal distances between every pair of vertices in V, was introduced by H. Wiener in 1947. We consider the problem of identifying trees of maximal Wiener index among all trees that possess a given degree sequence.

AB - Thanks to Robert Fulghum for providing a title to parody. In order to honor Doron on his 60th birthday, I will discuss a mathematical problem that I am currently working on, deliberately highlighting the useful advice that Doron gave me during my years as his postdoc, and via his famous Opinions page. The mathematical content of the talk is joint work with Hua Wang. The Wiener index of a graph G=(V,E), which is the sum of minimal distances between every pair of vertices in V, was introduced by H. Wiener in 1947. We consider the problem of identifying trees of maximal Wiener index among all trees that possess a given degree sequence.

UR - https://digitalcommons.georgiasouthern.edu/math-sci-facpres/22

UR - http://sites.math.rutgers.edu/events/Z60/abstracts.html

M3 - Presentation

T2 - From A=B to Z=60: Conference in Honor of Doron Zeilberger's 60th Birthday

Y2 - 28 May 2010

ER -

All I Really Need To Know, I Learned From Dr. Z

Abstract

Conference

DC Disciplines

Access to Document

Other files and links

Fingerprint

Cite this