相关论文: Idempotent functional analysis: an algebraic appro…
In this paper, we present an algebraic approach to idempotent functional analysis, which is an abstract version of idempotent analysis. The basic concepts and results are expressed in purely algebraic terms. We consider idempotent versions…
We study idempotent analogs of topological tensor products in the sense of A. Grothendieck. The basic concepts and results are simulated on the algebraic level. This is one of a series of papers on idempotent functional analysis.
A brief introduction into Idempotent Mathematics and an idempotent version of Interval Analysis are presented. Some applications are discussed.
This paper is devoted to heuristic aspects of the so-called idempotent calculus. There is a correspondence between important, useful and interesting constructions and results over the field of real (or complex) numbers and similar…
A brief survey of some basic ideas of the so-called Idempotent Mathematics is presented; an "idempotent" version of the representation theory is discussed. The Idempotent Mathematics can be treated as a result of a dequantization of the…
In this note we describe conditions under which, in idempotent functional analysis, linear operators have integral representations in terms of idempotent integral of V. P. Maslov. We define the notion of nuclear idempotent semimodule and…
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…
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
We study the class of those linear relations that can be factorized as products of idempotent relations. We provide several characterizations of this class, extending known factorization results for operators to the more general setting of…
In this paper, we study a natural extension of Multi-Layer Perceptrons (MLP) to functional inputs. We show that fundamental results for classical MLP can be extended to functional MLP. We obtain universal approximation results that show the…
Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…
Let $\Lambda$ be an artin algebra and $\mathfrak{A}$ a two-sided idempotent ideal of $\Lambda$, that is, $\mathfrak{A}$ is the trace of a projective $\Lambda$-module $P$ in $\Lambda$. We consider the categories of finitely generated modules…
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…
The functional ANOVA, or Hoeffding decomposition, provides a principled framework for interpretability by decomposing a model prediction into main effects and higher-order interactions. For independent inputs, this classical decomposition…
Inspired by the theories of Kaplansky-Hilbert modules and probability theory in vector lattices, we generalise functional analysis by replacing the scalars $\mathbb{R}$ or $\mathbb{C}$ by a real or complex Dedekind complete unital…
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…
The incomplete version of the Macdonald function has various appellations in literature and earns a well-deserved reputation of being a computational challenge. This paper ties together the previously disjoint literature and presents the…
We recently introduced the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. There is a type of idempotent system, said to be symmetric. In the present paper we classify up…
An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…