### Article

## A matrix ring with commuting graph of maximal diameter

The commuting graph of a semigroup is the set of non-central elements; the edges are defined as pairs *n * such that the commuting graph of

We prove existence and uniqueness of a solution to the problem of minimizing the logarithmic energy of vector potentials associated to a d-tuple of positive measures supported on closed subsets of the complex plane. The assumptions we make on the interaction matrix are weaker than the usual ones, and we also let the masses of the measures vary in a compact subset of ℝ+ d. The solution is characterized in terms of variational inequalities. Finally, we review a few examples taken from the recent literature that are related to our results.

Currently, the tasks of ensuring the quality and stability of the provided IT services are extremely topical. In the operation of the composite applications, the problem of increasing the effectiveness of incident management is a complex technical problem, the solution of which requires the use of the simulation methods. In the work, the integration platform Ensemble of InterSystems Company was considered as a basis for designing integration solutions. Given the architectural features of the integration platforms, a mathematical model of the incident management process in the Ensemble integration platform is proposed. This mathematical model was used to develop algorithms for identifying and classifying incidents. The results of the work can be used in the design and development of incident management information systems, as well as in organizing the work of technical support services for IT companies

Proceedings include extended abstracts of reports presented at the III International Conference on Optimization Methods and Applications “Optimization and application” (OPTIMA-2012) held in Costa da Caparica, Portugal, September 23—30, 2012.

This article introduces a new measure of linguistic complexity which is based on the dual nature of the linguistic sign. Complexity is analyzed as consisting of three components, namely the conceptual complexity (complexity of the signified), the formal complexity (complexity of the signifier) and the form-meaning correspondence complexity. I describe a way of plotting the form-meaning relationship on a graph with two tiers (the form tier and the meaning tier) and apply a complexity measure from graph theory (average vertex degree) to assess the complexity of such graphs. The proposed method is illustrated by estimating the complexity of full noun phrases (determiner + adjective + noun) in English, Swedish, and German. I also mention the limitations and the problems which might arise when using this method.

The collection represents proceedings of the nineth international conference "Discrete Models in Control Systems Theory" that is held by Lomonosov Moscow State Uneversity and is dedicated in 90th anniversary of Sergey Vsevolodovich Yablonsky's birth. The conference subject are includes: discrete functional systems; discrete functions properties; control systems synthesis, complexity, reliability, and diagnostics; automata; graph theory; combinatorics; coding theory; mathematical methods of information security; theory of pattern recognition; mathematical theory of intellegence systems; applied mathematical logic. The conference is sponsored by Russian Foundation for Basic Research (project N 15-01-20193-г).

Let *G* be a simple graph whose vertices are partitioned into two subsets, called ‘filled’ vertices and ‘empty’ vertices. A vertex *v* is said to be forced by a filled vertex *u* if *v* is a unique empty neighbor of *u*. If we can fill all the vertices of *G* by repeatedly filling the forced ones, then we call an initial set of filled vertices a forcing set. We discuss the so-called failed forcing number of a graph, which is the largest cardinality of a set which is not forcing. Answering the recent question of Ansill, Jacob, Penzellna, Saavedra, we prove that this quantity is NP-hard to compute. Our proof also works for a related graph invariant which is called the skew failed forcing number.

We study dierences in structural connectomes between typically developing and autism spectrum disorders individuals with machine learning techniques using connection weights and network metrics as features. We build linear SVM classier with accuracy score 0:64 and report 16 features (seven connection weights and nine network node centralities) best distinguishing these two groups.

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.