### Article

## Convex chains for Schubert varieties

We construct generalized Newton polytopes for Schubert subvarieties in the variety of complete flags in C^n . Every such “polytope” is a union of faces of a Gelfand–Zetlin polytope (the latter is a well-known Newton–Okounkov body for the flag variety). These unions of faces are responsible for Demazure characters of Schubert varieties and were originally used for Schubert calculus.

I describe a convex geometric procedure for building generalized Newton polytopes of Schubert varieties. One of the goals is to extend to arbitrary reductive groups our joint work with Evgeny Smirnov and Vladlen Timorin on Schubert calculus (in type A) in terms of Gelfand-Zetlin polytopes.

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed fiber polyhedra and Euler obstructions of toric varieties) in the unmixed case, suggests certain open questions in general, and generalizes a number of similar known results.

Toric geometry exhibited a profound relation between algebra and topology on one side and combinatorics and convex geometry on the other side. In the last decades, the interplay between algebraic and convex geometry has been explored and used successfully in a much more general setting: first, for varieties with an algebraic group action (such as spherical varieties) and recently for all algebraic varieties (construction of Newton-Okounkov bodies). The main goal of the conference is to survey recent developments in these directions. Main topics of the conference are: Theory of Newton polytopes and Newton-Okounkov bodies; Toric geometry, geometry of spherical varieties, Schubert calculus, geometry of moduli spaces; Tropical geometry and convex geometry; Real algebraic geometry and fewnomial theory; Polynomial vector fields and the Hilbert 16th problem.

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.

We describe a new approach to the Schubert calculus on complete flag varieties using the volume polynomial associated with Gelfand-Zetlin polytopes. This approach allows us to compute the intersection products of Schubert cycles by intersecting faces of a polytope.

In [K], a convex-geometric algorithm was introduced for building new analogs of Gelfand–Zetlin polytopes for arbitrary reductive groups. Conjecturally, these polytopes coincide with the Newton–Okounkov polytopes of flag varieties for a geometric valuation. I outline an algorithm (geometric mitosis) for finding collec- tion of faces in these polytopes that represent a given Schubert cycle. For GL_n and Gelfand–Zetlin polytopes, this algorithm reduces to a geometric version of Knutson–Miller mitosis introduced in [KST].

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.