Planck's law In 1880, André-Prosper-Paul Crova published a diagram of the three-dimensional appearance of the graph of the strength of thermal radiation as a function of wavelength and temperature. He determined the spectral variable by use of prisms. He analyzed the surface through what he called "isothermal" curves, sections for a single temperature, with a spectral variable on the abscissa and a power variable on the ordinate. He put smooth curves through his experimental data points. They had one peak at a spectral value characteristic for the temperature, and fell either side of it towards the horizontal axis. Such spectral sections are
Tournament (graph theory) & Moser later established that formula_100 voters are needed to induce every tournament on formula_98 vertices. Laslier (1997) studies in what sense a set of vertices can be called the set of "winners" of a tournament. This revealed to be useful in Political Science to study, in formal models of political economy, what can be the outcome of a democratic process. Tournament (graph theory) A tournament is a directed graph (digraph) obtained by assigning a direction for each edge in an undirected complete graph. That is, it is an orientation of a complete graph, or equivalently a directed graph in