Related papers: Rank Preserving Maps on CSL Algebras

Maps that preserve adjacency on the set of all invertible hermitian matrices over a finite field are characterized. It is shown that such maps form a group that is generated by the maps $A\mapsto PAP^{\ast}$, $A\mapsto A^{\sigma}$, and…

A rank estimator in robust regression is a minimizer of a function which depends (in addition to other factors) on the ordering of residuals but not on their values. Here we focus on the optimization aspects of rank estimators. We…

We believe three ingredients are needed for further progress in persistence and its use: invariants not relying on decomposition theorems to go beyond 1-dimension, outcomes suitable for statistical analysis and a setup adopted for…

We characterize Leavitt path algebras which are exchange rings in terms of intrinsic properties of the graph and show that the values of the stable rank for these algebras are 1, 2 or $\infty$. Concrete criteria in terms of properties of…

In this paper, two new composition operations are defined among the order-preserving maps. They can act on order-preserving maps like the usual composition operation. They are coincide with the usual composition operation when the…

In this paper we study the preservation of strong stability of strongly continuous semigroups on Hilbert spaces. In particular, we study a situation where the generator of the semigroup has a finite number of spectral points on the…

Let X be an irreducible 2n-dimensional holomorphic symplectic manifold. A reflexive sheaf F is very modular, if its Azumaya algebra End(F) deforms with X to every Kahler deformation of X. We show that if F is a slope-stable reflexive sheaf…

We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…

Rank and select queries on bitmaps are essential building bricks of many compressed data structures, including text indexes, membership and range supporting spatial data structures, compressed graphs, and more. Theoretically considered yet…

We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…

We consider the matrix completion problem of recovering a structured low rank matrix with partially observed entries with mixed data types. Vast majority of the solutions have proposed computationally feasible estimators with strong…

We consider the inclusion of the space of algebraic (regular) maps between real algebraic varieties in the space of all continuous maps. For a certain class of real algebraic varieties, which include real projective spaces, it is well known…

In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…

It is known that a single mapping defined on one term of a differential graded vector space extends to a strongly homotopy Lie algebra structure on the graded space when that mapping satisfies two conditions. This strongly homotopy Lie…

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…

Let $n$ be a positive integer. We provide an explicit geometrically motivated $1$-Lipschitz map from the space of persistence diagrams on $n$ points (equipped with the Bottleneck distance) into the Hilbert space $\ell^2$. Such maps are a…

We study stable subspaces of positive extremal maps of finite dimensional matrix algebras that preserve trace and matrix identity (so-called bistochastic maps). We have established the existence of the isometric-sweeping decomposition for…

In order to deal with the curse of dimensionality in reinforcement learning (RL), it is common practice to make parametric assumptions where values or policies are functions of some low dimensional feature space. This work focuses on the…

Let F be a continuous injective map from an open subset of R^n to R^n. Assume that, for infinitely many k>1, F induces a bijection between the rational points of denominator k in the domain and those in the image (the denominator of…

This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…