Nonlethal Fraction of Virus Population in Evolution Models with Lethal Mutations
Lethal mutations are very common in asexual evolution, both in RNA viruses and in the clonal evolution of cancer cells. In a special case of lethal mutations (truncated selection), after a critical total number of mutations the replicator (the virus or the cell) has no offspring. We consider the Eigen and Crow–Kimura models with truncated fitness landscapes, and calculate the fraction of viable replicators (that do have offspring) in the population. We derive a formula for the fraction of the population with nonlethal replicators for the case of a uniform distribution of lethal sequences in the sequence space. We assume that our results can be applied to the origin of life and cancer biology.
It is shown that genetic algorithms can be used successfully in problems of definite integral calculation especially when an integrand has a primitive which can't be expressed analytically through elementary functions. A testing of the program, which uses the genetic algorithm developed by authors, showed that the best results are reached if the size of population makes 30-50 chromosomes, approximately 40-60% of its take a part in crossover, and the program stops if the population's leader didn't change during 5‑10 generations. An answer of genetic algorithm is more exact than answer received by the classical numerical methods, even if a quantity of partition’s points into segment is small or if an integrand is quickly oscillating. So genetic algorithms can compete both on the accuracy of calculations and on operating time with well-known classical numerical methods such as midpoint approximation, top-left corner approximation, top-right corner approximation, trapezoidal rule, Simpson's rule.
We construct an example of blow-up in a ”ow of min-plus linear operators arising as solution operators for a Hamilton…Jacobi equation @S/@t+|∇S|/ + U(x, t) = 0, where > 1 and the potential U(x, t) is uniformly bounded together with its gradient. The construction is based on the fact that, for a suitable potential de“ned on a time interval of length T, the absolute value of velocity for a Lagrangian minimizer can be as large as O(log T)2−2/. We also show that this growth estimate cannot be surpassed. Implications of this example for existence of global generalized solutions to randomly forced Hamilton…Jacobi or Burgers equations are discussed.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.