Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still ope...

Evolutionary branching-resident-mutant coexistence under disruptive selection-is one of the main contributions of Adaptive Dynamics (AD), the mathematical framework introduced by S.A.H. Geritz, J.A.J. Metz, and coauthors to model the long-term evolution of coevolving multi-species communities. It has been shown to be the basic mechanism for sympatric and parapatric speciation, despite the essen...

On the basis of experimental data a kinetic model for the heterogeneous interaction between alkylperoxyradicals and organic compounds in Langmuir- Hinshelwood approach at room temperature has been offered.The effect of oxygen on the kinetics of process in the presence, [O2]o = 1 x 1011 – 1.6 x 1012 molecules.cm-2, and absence of oxygen has been analyzed. Over time the chain degenerate branching...

We extend in two directions our previous results about the sampling and the empirical measures of immortal branching Markov processes. Direct applications to molecular biology are rigorous estimates of the mutation rates of polymerase chain reactions from uniform samples of the population after the reaction. First, we consider nonhomogeneous processes, which are more adapted to real reactions. ...

The parabolic approximation for self-consistent molecular potential is widely used theoretical analysis of conformational and thermodynamic properties polymer brushes formed by linear or branched macromolecules. architecture-dependent parameter the (topological coefficient) can be calculated arbitrary architecture from condition elastic stress balance in all branching points. However, calculati...

Branching programs are computation models measuring the space of (Turing machine) computations. Read-once branching programs (BP1s) are the most general model where each graph-theoretical path is the computation path for some input. Exponential lower bounds on the size of read-once branching programs are known since a long time. Nevertheless, there are only few functions where the BP1 size is a...

A function complex is introduced on the category of flows so that the model category of flows becomes a simplicial model category. This allows us to show that the homotopy branching space of the cone of a morphism of flows is homotopy equivalent to the cone of its image by the homotopy branching space functor. The crux of the proof is that the homotopy branching space of the terminal flow is co...