Introducing TAXI: a Transportable Array for eXtremely large area Instrumentation studies

A common challenge in many experiments in high-energy astroparticle physics is the need for sparse instrumentation in areas of 100 km2 and above, often in remote and harsh environments. All these arrays have similar requirements for read-out and communication, power generation and distribution, and synchronization. Within the TAXI project we are developing a transportable, modular four-station test-array that allows us to study different approaches to solve the aforementioned problems in the laboratory and in the field. Well-defined interfaces will provide easy interchange of the components to be tested and easy transport and setup will allow in-situ testing at different sites. Every station consists of three well-understood 1 m2 scintillation detectors with nanosecond time resolution, which provide an air shower trigger. An additional sensor, currently a radio antenna for air shower detection in the 100 MHz band, is connected for testing and calibration purposes. We introduce the TAXI project and report the status and performance of the first TAXI station deployed at the Zeuthen site of DESY.Comment: 4 pages, 3 figures, presented at ARENA 2014, Annapolis, MD, June 201

Equivelar and d-Covered Triangulations of Surfaces. I

We survey basic properties and bounds for $q$-equivelar and $d$-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for $q$-equivelar and $d$-covered triangulations. We identify all orientable and non-orientable surfaces $M$ of Euler characteristic $0>\chi(M)\geq -230$ which admit non-neighborly $q$-equivelar triangulations with equality in the upper bound $q\leq\Bigl\lfloor\tfrac{1}{2}(5+\sqrt{49-24\chi (M)})\Bigl\rfloor$. These examples give rise to $d$-covered triangulations with equality in the upper bound $d\leq2\Bigl\lfloor\tfrac{1}{2}(5+\sqrt{49-24\chi (M)})\Bigl\rfloor$. A generalization of Ringel's cyclic $7{\rm mod}12$ series of neighborly orientable triangulations to a two-parameter family of cyclic orientable triangulations $R_{k,n}$, $k\geq 0$, $n\geq 7+12k$, is the main result of this paper. In particular, the two infinite subseries $R_{k,7+12k+1}$ and $R_{k,7+12k+2}$, $k\geq 1$, provide non-neighborly examples with equality for the upper bound for $q$ as well as derived examples with equality for the upper bound for $d$.Comment: 21 pages, 4 figure

Why Delannoy numbers?

This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works. This answers to the question raised in the title, as these works are related to lattice paths enumeration, to the so-called Delannoy numbers, and were the first general way to solve Ballot-like problems. These numbers appear in probabilistic game theory, alignments of DNA sequences, tiling problems, temporal representation models, analysis of algorithms and combinatorial structures.Comment: Presented to the conference "Lattice Paths Combinatorics and Discrete Distributions" (Athens, June 5-7, 2002) and to appear in the Journal of Statistical Planning and Inference