The Remainder in Ruijsenaars’ Asymptotic Expansion of Barnes Double Gamma Function

We show that the remainder in Ruijsenaars’ asymptotic expansion of the logarithm of Barnes double gamma function gives rise to a completely monotone function. Fourier expansions of the multiple Bernoulli polynomials are also obtained. Research supported by the Carlsberg Foundation.     

Self-organized critical pinball machine

The nature of self-organized criticality (SOC) is pin-pointed with a simple mechanical model: a pinball machine. Its phase space is fully parameterized by two integer variables, one describing the state of an on-going game, the other describing the state of the machine. This is the simplest possible SOC system, having only two degrees of freedom and no spatial correlations, yet is not solvable by analytical means.     

Cyclic and telechelic ladder polymers derived from tetrahydroxytetramethylspirobisindane and 1,4‐dicyanotetrafluorobenzene

5,5′,6,6′‐Tetrahydroxy‐3,3,3′,3′‐tetramethylspirobisindane was polycondensed with 1,4‐dicyanotetrafluorobenzene in four different solvents at 70 °C. In dimethylformamide, N‐methylpyrrolidone, and sulfolane exclusively, cyclic polymers were detectable by matrix‐assisted laser desorption/ionization time‐of‐flight (MALDI‐TOF) mass spectrometry up to masses around 13,000 Da. In dimethyl sulfoxide, linear byproducts were also found. Higher temperatures caused degradation reactions catalyzed by potassium carbonate. Polycondensations performed with the addition of 4‐tert‐butyl catechol or 2,2′‐dihydroxy binaphthyl yielded linear telechelic oligomers. Equimolar mixtures of linear and cyclic ladder polymers were examined by MALDI‐TOF mass spectra to determine how the end groups and the cyclic structure influenced the signal‐to‐noise ratio. The results suggested a preferential detection of the linear chains. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 5344–5352, 2006     

Range convexity,continuity, and strategy-proofness of voting schemes

A voting scheme assigns to each profile of alternatives reported byn individuals a compromise alternative. A voting scheme is strategy-proof if no individual is better off by lying, i.e., not reporting a best alternative. In this paper the main results concern the case where the set of alternatives is the Euclidean plane and the preferences are Euclidean. It is shown that for strategy-proof voting schemes continuity is equivalent to convexity of the range of the voting scheme. Using a result by Kim and Roush (1984), this leads to characterizations of surjective or unanimous, anonymous, strategy-proof voting schemes.Furthermore, the paper contains an extensive discussion of related results in the area.     

Recognition of ring pairs in the data analysis of Cherenkov detectors

We present a new algorithm for the identification of ring pairs in Cherenkov detectors. The approach combines linear regression methods for the construction of an appropriate reference quantity, methods from statistics for the evaluation of hypotheses and Monte Carlo simulation runs for the tuning of threshold levels.