Mathematics – Combinatorics
Scientific paper
2001-11-09
Mathematics
Combinatorics
considerable extension of math.CO/9910093
Scientific paper
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.
No associations
LandOfFree
Counting cycles and finite dimensional Lp norms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Counting cycles and finite dimensional Lp norms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting cycles and finite dimensional Lp norms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-539596