Chromatic roots and fibonacci numbers
About this item
| Description: |
Alikhani, S (Inspem, University Putra Malaysia)
Monday 21 January 2008, 15:30-16:00 Zeros of Graph Polynomials |
|---|
| Created: | 2008-01-30 21:44 | ||||
|---|---|---|---|---|---|
| Collection: | Combinatorics and Statistical Mechanics | ||||
| Publisher: | Isaac Newton Institute | ||||
| Copyright: | Alikhani, S | ||||
| Language: | eng (English) | ||||
| Credits: |
|
||||
| Abstract: | We prove that all natural power of golden ratio, cannot be a root of any chromatic polynomial.
We also consider generalized Fibonacci sequences and prove that all 2n-anacci constants and all natural powers of them cannot be root of any chromatic polynomial. Finally, we introduce new numbers related to n-annaci numbers and ask a question similar to Beraha question. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 480x360 | 1.84 Mbits/sec | 322.85 MB | View | Download | |
| Flash Video | 480x360 | 803.99 kbits/sec | 137.99 MB | View | Download | |
| iPod Video | 480x360 | 505.02 kbits/sec | 86.68 MB | View | Download | |
| Windows Media Video (for download) | 480x360 | 476.93 kbits/sec | 81.86 MB | View | Download | |
| Windows Media Video (for streaming) | 480x360 | 445.82 kbits/sec | 76.52 MB | View | Download | Stream |
| RealMedia | 480x360 | 878.59 kbits/sec | 150.79 MB | View | Download | Stream |
| QuickTime (for download) | 384x288 | 846.78 kbits/sec | 145.33 MB | View | Download | |
| QuickTime (for streaming) | 480x360 | 907.93 kbits/sec | 155.83 MB | View | Download | |
| MP3 | 44100 Hz | 125.02 kbits/sec | 21.24 MB | Listen | Download | |
