Related papers: Majorization and Spherical Functions
Diffeomorphisms can be seen as automorphisms of the algebra of functions. In the matrix regularization, functions on a smooth compact manifold are mapped to finite size matrices. We consider how diffeomorphisms act on the configuration…
We study the problem of invariance of indices of thematic factorizations. Such factorizations were introduced in [PY1] for studying superoptimal approximation by bounded analytic matrix functions. As shown in [PY1], the indices may depend…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
In this paper we describe the alternative approach to the sample boundedness and continuity of stochastic processes. We show that the regularity of paths can be understood in terms of a distribution of the argument maximum. For a centered…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
In this paper, we revisit implicit regularization from the ground up using notions from dynamical systems and invariant subspaces of Morse functions. The key contributions are a new criterion for implicit regularization---a leading…
A simple algebraic model for charged particle moving in two dimensional space under influence of singular magnetic field is given. The fundamental assumption for the model is that every charged particle coupled to the magnetic field is…
A new concept of meromorphic $\Sigma$-factorization, for H\"{o}lder continuous functions defined on a contour $\Gamma$ that is the pullback of $\dot{\mathbb{R}}$ (or the unit circle) in a Riemann surface $\Sigma$ of genus 1, is introduced…
We propose a theoretical framework under which preference profiles can be meaningfully compared. Specifically, given a finite set of feasible allocations and a preference profile, we first define a ranking vector of an allocation as the…
Although the vectorization operation is known and well-defined, it is only defined for 2-D matrices, and its inverse isn't as well-popularized. This work proposes to generalize the vectorization to higher dimensions, and define…
We present axiomatisations for a number of partial function signatures that include domain restriction, modelled as a right normal band operation. Other operations considered are override and update, difference, minus, intersection,…
Matrix factorization is a widely used approach for top-N recommendation and collaborative filtering. When implemented on implicit feedback data (such as clicks), a common heuristic is to upweight the observed interactions. This strategy has…
This paper presents a unified approach for localizing some relevant graph topological indices via majorization techniques. Through this method, old and new bounds are derived and numerical examples are provided, showing how former results…
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a…
The Douglas' majorization and factorization theorem characterizes the inclusion of operator ranges in Hilbert spaces. Notably, it reinforces the well-established connections between the inclusion of kernels of operators in Hilbert spaces…
The (extended) Linial arrangement $\mathcal{L}_{\Phi}^m$ is a certain finite truncation of the affine Weyl arrangement of a root system $\Phi$ with a parameter $m$. Postnikov and Stanley conjectured that all roots of the characteristic…
The problem of membrane topology in the matrix model of M-theory is considered. The matrix regularization procedure, which makes a correspondence between finite-sized matrices and functions defined on a two-dimensional base space, is…
In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…
Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…
We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.