On sets of numbers rationally represented in a rational base number system

In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition of a strong combinatorial property on languages : the bounded left iteration property. It is both an unnatural property in usual formal language theory (as it contradicts any kind of pumping lemma) and an ideal fit to the languages defined through rational base number systems

HENRI AUGUSTE DELANNOY, UNE BIOGRAPHIE

Cette biographie traite en annexe du legs de la bibliothèque mathématique de Delannoy à la ville de Guéret.Les travaux du mathématicien Delannoy (1833-1915), qui étaient tombés dans l'oubli, ont suscité récemment un vif intérêt, en raison des nombreux objets qui sont dénombrés par les suites associées à son nom. En effet, ces suites ont émergé dans des travaux aussi divers que la représentation et le raisonnement spatio-temporel en informatique et en linguistique, en biologie ou en physique théorique. Nous nous proposons ici de remettre à l'honneur ce mathématicien méconnu. Son parcours, bien que modeste, nous éclaire sur la société mathématique de la fin du dix-neuvième siècle. Dans ce premier article nous présentons les éléments connus de sa vie, en particulier de son activité de mathématicien. Nous fournissons notamment une revue complète de ses publications. En annexe, le lecteur trouvera la description de la bibliothèque mathématique donnée en héritage par Delannoy à la bibliothèque municipale de Guéret et ce qu'il en est advenu. Dans un second article, nous traiterons de façon approfondie de son apport majeur : l'usage des échiquiers arithmétiques dans la résolution de problèmes combinatoires et probabilistes et les applications actuelles

Integrated AlGaAs source of highly indistinguishable and energy-time entangled photons

The generation of nonclassical states of light in miniature chips is a crucial step towards practical implementations of future quantum technologies. Semiconductor materials are ideal to achieve extremely compact and massively parallel systems and several platforms are currently under development. In this context, spontaneous parametric down conversion in AlGaAs devices combines the advantages of room temperature operation, possibility of electrical injection and emission in the telecom band. Here we report on a chip-based AlGaAs source, producing indistinguishable and energy-time entangled photons with a brightness of $7.2\times10^6$ pairs/s and a signal-to-noise ratio of $141\pm12$. Indistinguishability between the photons is demonstrated via a Hong-Ou-Mandel experiment with a visibility of $89\pm3\%$, while energy-time entanglement is tested via a Franson interferometer leading to a value for the Bell parameter $S=2.70\pm0.10$

High-detection efficiency and low-timing jitter with amorphous superconducting nanowire single-photon detectors

Recent progress in the development of superconducting nanowire single-photon detectors (SNSPDs) made of amorphous material has delivered excellent performances, and has had a great impact on a range of research fields. Despite showing the highest system detection efficiency (SDE) ever reported with SNSPDs, amorphous materials typically lead to lower critical currents, which impacts on their jitter performance. Combining a very low jitter and a high SDE remains a challenge. Here, we report on highly efficient superconducting nanowire single-photon detectors based on amorphous MoSi, combining system jitters as low as 26 ps and a SDE of 80% at 1550 nm. We also report detailed observations on the jitter behaviour, which hints at intrinsic limitations and leads to practical implications for SNSPD performance

An electrically injected photon-pair source at room temperature

One of the main challenges for future quantum information technologies is miniaturization and integration of high performance components in a single chip. In this context, electrically driven sources of non-classical states of light have a clear advantage over optically driven ones. Here we demonstrate the first electrically driven semiconductor source of photon pairs working at room temperature and telecom wavelength. The device is based on type-II intracavity Spontaneous Parametric Down-Conversion in an AlGaAs laser diode and generates pairs at 1.57 $\mu$m. Time-correlation measurements of the emitted pairs give an internal generation efficiency of $7 \times 10^{-11}$ pairs/injected electron. The capability of our platform to support generation, manipulation and detection of photons opens the way to the demonstration of massively parallel systems for complex quantum operations.Comment: 5 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

Dynamic simulation of the THAI heavy oil recovery process

Toe-to-Heel Air Injection (THAI) is a variant of conventional In-Situ Combustion (ISC) that uses a horizontal production well to recover mobilised partially upgraded heavy oil. It has a number of advantages over other heavy oil recovery techniques such as high recovery potential. However, existing models are unable to predict the effect of the most important operational parameters, such as fuel availability and produced oxygen concentration, which will give rise to unsafe designs. Therefore, we have developed a new model that accurately predicts dynamic conditions in the reservoir and also is easily scalable to investigate different field scenarios. The model used a three component direct conversion cracking kinetics scheme, which does not depend on the stoichiometry of the products and, thus, reduces the extent of uncertainty in the simulation results as the number of unknowns is reduced. The oil production rate and cumulative oil produced were well predicted, with the latter deviating from the experimental value by only 4%. The improved ability of the model to emulate real process dynamics meant it also accurately predicted when the oxygen was first produced, thereby enabling a more accurate assessment to be made of when it would be safe to shut-in the process, prior to oxygen breakthrough occurring. The increasing trend in produced oxygen concentration following a step change in the injected oxygen rate by 33 % was closely replicated by the model. The new simulations have now elucidated the mechanism of oxygen production during the later stages of the experiment. The model has allowed limits to be placed on the air injection rates that ensure stability of operation. Unlike previous models, the new simulations have provided better quantitative prediction of fuel laydown, which is a key phenomenon that determines whether, or not, successful operation of the THAI process can be achieved. The new model has also shown that, for completely stable operation, the combustion zone must be restricted to the upper portion of the sand pack, which can be achieved by using higher producer back pressure

Trace semantics via determinization

This paper takes a fresh look at the topic of trace semantics in the theory of coalgebras. The first development of coalgebraic trace semantics used final coalgebras in Kleisli categories, stemming from an initial algebra in the underlying category (see notably~\cite{HasuoJS07}). This approach requires some non-trivial assumptions, like dcpo enrichment, which do not always hold, even in cases where one can reasonably speak of traces (like for weighted automata). More recently, it has been noticed (see~\cite{SBBR10}) that trace semantics can also arise by first performing a determinization construction. In this paper, we develop a systematic approach, in which the two approaches correspond to different orders of composing a functor and a monad, and accordingly, to different distributive laws. The relevant final coalgebra that gives rise to trace semantics does not live in a Kleisli category, but more generally, in a category of Eilenberg-Moore algebras. In order to exploit its finality, we identify an extension operation, that changes the state space of a coalgebra into a free algebra, which abstractly captures determinization of automata. Notably, we show that the two different views on trace semantics are equivalent, in the examples where both approaches are applicable.We are grateful to the anonymous referees for valuable comments. The work of Alexandra Silva is partially funded by the ERDF through the Programme COMPETE and by the Portuguese Foundation for Science and Technology, project Ref. FCOMP-01-0124-FEDER-020537 and SFRH/BPD/71956/2010