Modular quadratic and Hermitian forms over Dedekind rings.
Moments of characteristic polynomials enumerate two-rowed lexicographic arrays.
Monogenic functions in conformal geometry.
Monomorphisms in spaces with Lindelöf filters
is the category of spaces with filters: an object is a pair , a compact Hausdorff space and a filter of dense open subsets of . A morphism is a continuous function for which whenever . This category arises naturally from considerations in ordered algebra, e.g., Boolean algebra, lattice-ordered groups and rings, and from considerations in general topology, e.g., the theory of the absolute and other covers, locales, and frames, though we shall specifically address only one of these...
Monotone convergence of the Lanczos approximations to matrix functions of Hermitian matrices.
Monotone interval eigenproblem in max–min algebra
The interval eigenproblem in max-min algebra is studied. A classification of interval eigenvectors is introduced and six types of interval eigenvectors are described. Characterization of all six types is given for the case of strictly increasing eigenvectors and Hasse diagram of relations between the types is presented.
Monotone Norms.
Monotonicity of the maximum of inner product norms
Let be the field of real or complex numbers. In this note we characterize all inner product norms on for which the norm on is monotonic.
Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix
By a hollow symmetric matrix we mean a symmetric matrix with zero diagonal elements. The notion contains those of predistance matrix and Euclidean distance matrix as its special cases. By a centered symmetric matrix we mean a symmetric matrix with zero row (and hence column) sums. There is a one-toone correspondence between the classes of hollow symmetric matrices and centered symmetric matrices, and thus with any hollow symmetric matrix D we may associate a centered symmetric matrix B, and vice...
Moore-Penrose inverse, parabolic subgroups, and Jordan pairs.
Moore-Penrose inverses of Gram matrices leaving a cone invariant in an indefinite inner product space
In this paper we characterize Moore-Penrose inverses of Gram matrices leaving a cone invariant in an indefinite inner product space using the indefinite matrix multiplication. This characterization includes the acuteness (or obtuseness) of certain closed convex cones.
Moore-Penrose inverses of Gram operators on Hilbert C*-modules
Let t be a regular operator between Hilbert C*-modules and be its Moore-Penrose inverse. We investigate the Moore-Penrose invertibility of the Gram operator t*t. More precisely, we study some conditions ensuring that and . As an application, we get some results for densely defined closed operators on Hilbert C*-modules over C*-algebras of compact operators.
More calculations on determinant evaluations.
More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures.
More on evaluating determinants
Multi-agent solver for non-negative matrix factorization based on optimization
This paper investigates a distributed solver for non-negative matrix factorization (NMF) over a multi-agent network. After reformulating the problem into the standard distributed optimization form, we design our distributed algorithm (DisNMF) based on the primal-dual method and in the form of multiplicative update rule. With the help of auxiliary functions, we provide monotonic convergence analysis. Furthermore, we show by computational complexity analysis and numerical examples that our distributed...
Multichannel deblurring of digital images
Blur is a common problem that limits the effective resolution of many imaging systems. In this article, we give a general overview of methods that can be used to reduce the blur. This includes the classical multi-channel deconvolution problems as well as challenging extensions to spatially varying blur. The proposed methods are formulated as energy minimization problems with specific regularization terms on images and blurs. Experiments on real data illustrate very good and stable performance of...
Multi-covering radius for rank metric codes.
Multilinear forms in Pareto-like random variables and product random measures
Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions
Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime...