Dense Arrangements are Locally Very Dense. I
The Szemerédi–Trotter theorem [Combinatorica, 3 (1983), pp. 381–392] gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particula...
The Szemerédi–Trotter theorem [Combinatorica, 3 (1983), pp. 381–392] gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particula...
A Combinatorial Interpretation of the Chebyshev Polynomials
We give a combinatorial interpretation of the Chebyshev polynomials in terms of the number of ideals of generalized fences and crowns.
We give a combinatorial interpretation of the Chebyshev polynomials in terms of the number of ideals of generalized fences and crowns.
You are not logged in to this journal. Log in
Comparing Partial Rankings
SIAM J. Discrete Math. Volume 20, Issue 3, pp. 628-648 (2006)
Published September 5, 2006
Connotea
CiteULike
del.icio.us
BibSonomy
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other.
©2006 Society for Industrial and Applied Mathematics| History: | Received May 6, 2005; accepted February 7, 2006; published September 5, 2006 |
| Permalink: | http://dx.doi.org/10.1137/05063088X |
KEYWORDS and AMS
06A06, 68R99
PUBLICATION DATA
0895-4801 (print)
1095-7146 (online)
SIAM