### Article

## Stability of characterization of the independence of random variables by the independence of linear statistics.

Let (X1; Y1),..., (XN; YN) be independent identically distributed random vectors. We show, that if the statistics LX = a1*X1+... + aN*XN and LY = b1*Y1 + ... + bN*YN are epsilon - independent, then under some conditions X = (X1,..., XN), Y = (Y1,..., YN) are "epsilon in the power alpha"-independent for some alpha> 0.

Models enabling to assess stability of solutions connected with the choice of the optimal production plan are presented in the article. The optimal production plan ensures the maximum profit for the company under input restraints. At the same time in the standard model supplementary variable is added which reflects inflation rate in the economy. Within the framework of current task this variable reflects external environment change. While developing models stability intervals for , production plans were defined, such as threshold levels of inflation, when the shift from one production plan to another takes place.

A scalable method for mining graph patterns stable under subsampling is proposed. The existing subsample stability and robustness measures are not antimonotonic according to definitions known so far. We study a broader notion of antimonotonicity for graph patterns, so that measures of subsample stability become antimonotonic. Then we propose gSOFIA for mining the most subsample-stable graph patterns. The experiments on numerous graph datasets show that gSOFIA is very efficient for discovering subsample-stable graph patterns.

An initial–boundary value problem for the generalized Schrödinger equation in a semi-infinite strip is solved.

A new family of two level finite-difference schemes with averaging over spatial variables on a finite mesh is constructed, which covers a set of finite-difference schemes built using various methods. For the family, an abstract approximate transparent boundary condition (TBC) is formulated and the solutions are proved to be absolutely stable in two norms with respect to both initial data and free terms. A discrete TBC is derived, and the stability of the family of schemes with this TBC is proved. The implementation of schemes with the discrete TBC is discussed.

The object of study of this paper is a regional economic system which is complex, dynamic and developable by nature. The reproduction of material wealth necessary for the region is provided in the process of functioning of the above system through the interaction between the combinations of subjective (personal) and objective (material) elements, thereby meeting regional environmental and economic needs.

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.

This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.

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.