Optimal bounds for parity-oblivious random access codes

It is expected that the result is not true with = 0 as soon as the degree of α is ≥ 3, which means that it is expected no real algebraic number of degree at least 3 is

For each value of η (transmission fidelity of the meter quantum channel for the remote parity mea- surement) and of T 1 /T d (qubit characteristic lifetime expressed in number

Using the spinal decomposition, to compute the number of individuals in a branching random walk who stay in a well-chosen path, it is enough to know the probability for a random

Branching processes with selection of the N rightmost individuals have been the subject of recent studies [7, 10, 12], and several conjectures on this processes remain open, such as

We introduce a special metric space in which the Feynman - Kac map- ping is contracted. Taking this into account we show the fixed-point theorem for this mapping and we show that

Seemingly inescapable consequences of the physiologist's account of perception appear to demolish not just the credentials of some other theory of perception, but the

In any Markov decision process M equipped with Par ∧ Avg >0 objective, Player 0 has an almost-surely winning strategy with finite memory.. The main idea beyond Proposition 3 is

We consider bias-reduced estimation of the extreme value index in conditional Pareto-type models with random covariates when the response variable is subject to random right