### Article

## Вычисление энтропии скрытой марковской цепи с одним "немарковским" состоянием

The present paper analyses characteristics of an input flow controlled by Markov chain. At the base of construction of the given flow rests the model of semi-Markov process. The paper has stated and proved the theorem about stationarity of an input flow controlled by Markov chain. In addition to that the theorem proved that in a stationary case distributions and expectations of hopping and under-hopping time concerning the measures defining management strategy represent fractional-linear functional.

This article concerns the problem of predicting the size of company's customer base in case of solving the task of managing its clients. The author purposes a new approach to segment-oriented predicting the size of clients based on adopting the Staroverov's employees moving model. Besides the article includes the limitations of using this model and its modification for each type of relations of the client and the company.

We use a Markov chains models for the analysis of Russian stock market. First problem studied in the paper is the multiperiod portfolio optimization. We show that known approaches applied for the Russian stock market produce the phenomena of non stability and propose a new methods in order to smooth it. The second problem addressed in the paper is a structural changes on the Russian stock market after the financial crisis of 2008.We propose a hidden Markov chains model to analyse a structural changes and apply it for the Russian stock market.

The celebrated Nagel–Schreckenberg model allows to study a reasonably large class of one-dimensional traffic flow models with parallel updates. Unfortunately further generalizations of this construction turn out to be not especially fruitful. Namely, numerical simulations of such generalizations did not demonstrate stable behavior qualitatively different from the original model, and more to the point their mathematical treatment is still not available even up to nowadays. I'll discuss several features of these models which partially explain the failure of both numerical and mathematical attempts to study generalizations of the Nagel–Schreckenberg model.

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.