arXiv subjects
Publications and source records attributed to G. L. Litvinov.
In this talk a brief survey of basic ideas of Idempotent Mathematics is presented. Relations between this theory and the theory of fuzzy sets as well as the possibility theory and some applications (including computer applications) are discussed.
A very brief introduction to tropical and idempotent mathematics is presented. Tropical mathematics can be treated as a result of a dequantization of the traditional mathematics as the Planck constant tends to zero taking imaginary values. In the framework of idempotent mathematics usually constructions and algorithms are more simple with respect to their traditional analogs. We especially examine algorithms of tropical/idempotent mathematics generated by a collection of basic semiring (or semifield) operations and other "good" operations. Every algorithm of this type has an interval version. The complexity of this interval version coincides with the complexity of the initial algorithm. The interval version of an algorithm of this type gives exact interval estimates for the corresponding output data. Algorithms of linear algebra over idempotent and semirings are examined. In this case, basic algorithms are polynomial as well as their interval versions. This situation is very different from the traditional linear algebra, where basic algorithms are polynomial but the corresponding interval versions are NP-hard and interval estimates are not exact.
This note is an attempt to give an answer for the following old I.M. Gelfand's question: why some important problems of integral geometry (e.g., the Radon transform and others) are related to harmonic analysis on groups, but for other quite similar problems such relations are not clear? In the note we examine standard problems of integral geometry generating harmonic analysis (the Plancherel theorem etc.) on pairs of commutative hypergroups that are in a duality of Pontryagin's type. As a result new meaningful examples of hypergroups are constructed.
A very brief introduction to tropical and idempotent mathematics is presented. Applications to classical mechanics and geometry are especially examined.
This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are examined. A very brief introduction to mathematics of semirings (including idempotent and tropical mathematics) is presented. Concrete applications to optimization problems, idempotent linear algebra and interval analysis are indicated. It is known that some nonlinear problems (and especially optimization problems) become linear over appropriate semirings with idempotent addition (the so-called idempotent superposition principle). This linearity over semirings is convenient for parallel computations.
A tropical version of the Schauder fixed point theorem for compact subsets of tropical linear spaces is proved.
In the framework of idempotent mathematics, analogs of the classical kernel theorems of L. Schwartz and A. Grothendieck are studied. Idempotent versions of nuclear spaces (in the sense of A. Grothendieck) are discussed. The so-called algebraic approach is used. This means that the basic concepts and results (including those of "topological" nature) are simulated in purely algebraic terms.
This paper is a brief introduction to idempotent and tropical mathematics. Tropical mathematics can be treated as a result of the so-called Maslov dequantization of the traditional mathematics over numerical fields as the Planck constant $\hbar$ tends to zero taking imaginary values.
For functions defined on C^n or (R_+)^n we construct a dequantization transform, which is closely related to the Maslov dequantization. The subdifferential at the origin of a dequantized polynomial coincides with its Newton polytope. For the semiring of polynomials with nonnegative coefficients, the dequantization transform is a homomorphism of this semiring to the idempotent semiring of convex polytopes with the well-known Minkowski operations. Using the dequantization transform we generalize these results to a wide class of functions and convex sets.
A unifying approach to software and hardware design generated by ideas of Idempotent Mathematics is discussed. The so-called idempotent correspondence principle for algorithms, programs and hardware units is described. A software project based on this approach is presented. Key words: universal algorithms, idempotent calculus, software design, hardware design, object oriented programming