Related papers: Majorization and Spherical Functions
Computability relative to a partial function $f$ on the natural numbers can be formalized using the notion of an oracle for this function $f$. This can be generalized to arbitrary partial combinatory algebras, yielding a notion of…
Linearization is a standard approach in the computation of eigenvalues, eigenvectors and invariant subspaces of matrix polynomials and rational matrix value functions. An important source of linearizations are the so called Fiedler…
Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
We use the general $N = 1$ supersymmetric formulation of one dimensional sigma models on non trivial manifolds and its subsequent quantization to formulate the classical and quantum dynamics of the $ N= 2 $ supersymmetric charged particle…
In decision-making, maxitive functions are used for worst-case and best-case evaluations. Maxitivity gives rise to a rich structure that is well-studied in the context of the pointwise order. In this article, we investigate maxitivity with…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
We define a notion of coordinatization for $\aleph_0$-categorical structures which is, like Lie coordinatized structures in [2], a certain kind of expansion of a tree. We show that a structure which is coordinatized, in a certain strong…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex…
Let $\Phi$ be an irreducible crystallographic root system with Weyl group $W$ and coroot lattice $\check{Q}$, spanning a Euclidean space $V$. Let $m$ be a positive integer and $\aA^m_\Phi$ be the arrangement of hyperplanes in $V$ of the…
A partial order on the set of metric measure spaces is defined; it generalizes the Lipschitz order of Gromov. We show that our partial order is closed when metric measure spaces are equipped with the Gromov-weak topology and give a new…
Self-normalized processes are basic to many probabilistic and statistical studies. They arise naturally in the the study of stochastic integrals, martingale inequalities and limit theorems, likelihood-based methods in hypothesis testing and…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
We present several aspects of the "topology of meromorphic functions", which we conceive as a general theory which includes the topology of holomorphic functions, the topology of pencils on quasi-projective spaces and the topology of…
We prove that coronizations with respect to arbitrary d-regular sets (not necessarily graphs) imply big pieces squared of these (approximating) sets. This is known (and due to David and Semmes in the case of sufficiently large co-dimension,…
Morphisms, structure preserving maps, are everywhere in Mathematics as useful tools for thinking and problem solving, or as objects to study. Here, we argue that the idea of operations being compatible across two domains goes beyond its…
Let G be a piecewise constant $n\times n$ matrix function which is defined on a smooth closed curve $\Gamma$ in the complex sphere and which has m jumps. We consider the problem of determining the partial indices of the factorization of the…
We present a development of norms and discuss their relationship to factorization. In earlier work, the first named author introduced the notion of a normset, which is the image of the norm map. A normset is a monoid with its own…
We establish a general result on the existence of partially defined semiconjugacies between rational functions acting on the Riemann sphere. The semiconjugacies are defined on the complements to at most one-dimensional sets. They are…