We review the apparently hydrodynamic behaviour of low transverse momentum particles (pT ≤ 1.5 GeV/c) produced in central and semicentral (b ≤ 7 fm) heavy ion collisions at RHIC. We investigate the impact parameter dependence of various observables, elaborating on radial and elliptic flow and particle multiplicities. We also discuss possible ambiguities in the initialization of the hydrodynamic...

This paper is devoted to Idempotent Functional Analysis, which is an “abstract” version of Idempotent Analysis developed by V. P. Maslov and his collaborators. We give a brief survey of the basic ideas of Idempotent Analysis. The correspondence between concepts and theorems of the traditional Functional Analysis and its idempotent version is discussed in the spirit of N. Bohr’s correspondence p...

1. Introduction. Idempotent Mathematics is based on replacing the usual arithmetic operations by a new set of basic operations (e.g., such as maximum or minimum), that is on replacing numerical fields by idempotent semirings and semifields. Typical (and the most common) examples are given by the so-called (max, +) algebra R max and (min, +) algebra R min. Let R be the field of real numbers. The...

‎in a recent paper c‎. ‎miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{m}_n(mathbb{r})$ is equal to $4$ if either $n=3$ or $ngeq5$‎. ‎but the case $n=4$ remained open‎, ‎since the diameter could be $4$ or $5$‎. ‎in this work we close the problem showing that also in this case the diameter is $4$.

Idempotent matrices play a significant role while dealing with different questions in matrix theory and its applications. It is easy to see that over a field any idempotent matrix is similar to a diagonal matrix with 0 and 1 on the main diagonal. Over a semiring the situation is quite different. For example, the matrix J of all ones is idempotent over Boolean semiring. The first characterizatio...

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semigroup. (4) Every finite group is a maximal subgroup of some free...

This paper is devoted to classify all idempotent uninorms defined on the finite scale Ln = {0, 1, . . . , n}, called discrete idempotent uninorms. It is proved that any discrete idempotent uninorm with neutral element e ∈ Ln is uniquely determined by a decreasing function g : [0, e]→ [e, n] and vice versa. Based on this correspondence, the number of all possible discrete idempotent uninorms on ...

In this paper, we define hedge operation on a residuated skew lattice and investigate some its properties. We get relationships between some special sets as dense, nilpotent, idempotent, regular elements sets and their hedges.  By examples, we show that hedge of a dense element is not a dense and hedge of a regular element is not a regular. Also hedge of a nilpotent element is a nilpotent and h...

Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original methods exploited the idempotent (e.g., max-plus) linearity of the associated semigroup operator. However, it is now known that the curse-of-dimensionality-free idempotent methods do not require this linearity. Instead, it...