Related papers: Variable decoupling and the Kolmogorov Superpositi…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study…
A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of…
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…
In an attempt to demonstrate that local hidden variables are mathematically possible, Pitowsky constructed "spin-$\frac12$ functions" and later "Kolmogorovian models", which employs a nonstandard notion of probability. We describe…
We develop a higher order generalization of the LQ decomposition and show that this decomposition plays an important role in likelihood-based estimation and testing for separable, or Kronecker structured, covariance models, such as the…
Functional decomposition is a powerful tool for systems analysis because it can reduce a function of arbitrary input dimensions to the sum and superposition of functions of a single variable, thereby mitigating (or potentially avoiding) the…
A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…
Let $f\in K(t)$ be a univariate rational function. It is well known that any non-trivial decomposition $g \circ h$, with $g,h\in K(t)$, corresponds to a non-trivial subfield $K(f(t))\subsetneq L \subsetneq K(t)$ and vice-versa. In this…
In multicentric calculus one takes a polynomial $p$ with distinct roots as a new variable and represents complex valued functions by $\mathbb C^d$-valued functions, where $d$ is the degree of $p$. An application is e.g. the possibility to…
A new model-free screening method called the fused Kolmogorov filter is proposed for high-dimensional data analysis. This new method is fully nonparametric and can work with many types of covariates and response variables, including…
We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the…
We return to Takagi's variational principle, generalized after forty years to two complex variables by Pfister. Both isolating some extremal rational functions associated to a bounded holomorphic function in the unit disk, respectively the…
We discuss some applications of the Morse-Novikov theory to some problems in modern physics, where appears a non-exact closed 1-form $\omega$ (a multi-valued functional). We focus mainly our attention to the cohomology of the de Rham…
The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several…
The main object of this work is to show how some rather elementary techniques based upon certain inverse pairs of symbolic operators would lead us easily to several decomposition formulas associated with confluent hypergeometric functions…
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…
$k$-submodular functions, introduced by Huber and Kolmogorov, are functions defined on $\{0, 1, 2, \dots, k\}^n$ satisfying certain submodular-type inequalities. $k$-submodular functions typically arise as relaxations of NP-hard problems,…