Counting cycles and finite dimensional Lp norms
| dc.creator | Rivin, Igor | |
| dc.date | 2001-11-09 | |
| dc.date.accessioned | 2026-07-07T04:44:29Z | |
| dc.date.available | 2026-07-07T04:44:29Z | |
| dc.description | We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th powers of the coordinates and the Lk norm subject to the constraints that the sum of squares of the coordinates is fixed, and that the sum of the coordinates vanishes. | |
| dc.description | considerable extension of math.CO/9910093 | |
| dc.identifier | https://arxiv.org/abs/math/0111106 | |
| dc.identifier | http://arxiv.org/abs/math/0111106 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62606 | |
| dc.subject | Combinatorics | |
| dc.subject | Classical Analysis and ODEs | |
| dc.subject | 05C38, 49N99 | |
| dc.title | Counting cycles and finite dimensional Lp norms | |
| dc.type | text |