English
Related papers

Related papers: Reducibility of Matrix Weights

200 papers

In the theory of matrix-valued orthogonal polynomials, there exists a longstanding problem known as the Matrix Bochner Problem: the classification of all $N \times N$ weight matrices $W(x)$ such that the associated orthogonal polynomials…

Classical Analysis and ODEs · Mathematics 2024-11-05 Ignacio Bono Parisi , Inés Pacharoni

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

Given complex numbers $w_1, \ldots, w_n$, we define the weight $w(X)$ of a set $X$ of 0-1 vectors as the sum of $w_1^{x_1} \cdots w_n^{x_n}$ over all vectors $(x_1, \ldots, x_n)$ in $X$. We present an algorithm, which for a set $X$ defined…

Combinatorics · Mathematics 2019-08-15 Alexander Barvinok , Guus Regts

We give a proof of the Universality Conjecture for orthogonal and symplectic ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial, V(x)=kappa_{2m}x^{2m}+..., kappa_{2m}>0. For such…

Mathematical Physics · Physics 2007-05-23 Percy Deift , Dimitri Gioev

Let ${\mathcal W}_n$ be the Lie algebra of polynomial vector fields. We classify simple weight ${\mathcal W}_n$-modules $M$ with finite weight multiplicities. We prove that every such nontrivial module $M$ is either a tensor module or the…

Representation Theory · Mathematics 2021-02-19 Dimitar Grantcharov , Vera Serganova

Two matrix vector spaces $V,W\subset \mathbb C^{n\times n}$ are said to be equivalent if $SVR=W$ for some nonsingular $S$ and $R$. These spaces are congruent if $R=S^T$. We prove that if all matrices in $V$ and $W$ are symmetric, or all…

Representation Theory · Mathematics 2020-09-30 Genrich R. Belitskii , Vyacheslav Futorny , Mikhail Muzychuk , Vladimir V. Sergeichuk

We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…

Mathematical Physics · Physics 2026-03-31 Umpei Miyamoto

In this note, we derive non trivial sharp bounds related to the weighted harmonic-geometric-arithmetic means inequalities, when two out of the three terms are known. As application, we give an explicit bound for the trace of the inverse of…

Classical Analysis and ODEs · Mathematics 2010-09-27 Gerard Maze , Urs Wagner

Matrix sensing is the problem of reconstructing a low-rank matrix from a few linear measurements. In many applications such as collaborative filtering, the famous Netflix prize problem, and seismic data interpolation, there exists some…

Information Theory · Computer Science 2019-04-30 Sajad Daei , Arash Amini , Farzan Haddadi

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

Metric Geometry · Mathematics 2017-12-19 Jerzy Dydak

We consider partial and total reduction of a nonhomogeneous linear system of the operator equations with the system matrix in the same particular form as in paper [N. Shayanfar, M. Hadizadeh 2013]. Here we present two different concepts.…

Spectral Theory · Mathematics 2019-10-15 Ivana Jovovic , Branko Malesevic

Matrix weights satisfying a Muckenhoupt $A_p$-condition relative to a family of anisotropic balls in $\mathbb{R}^d$ defined by a pseudo-metric are studied. It is shown that such matrix weights satisfy a doubling condition and a reverse…

Functional Analysis · Mathematics 2025-10-06 Morten Nielsen

This paper is about iteratively reweighted basis-pursuit algorithms for compressed sensing and matrix completion problems. In a first part, we give a theoretical explanation of the fact that reweighted basis pursuit can improve a lot upon…

Information Theory · Computer Science 2011-07-11 Stéphane Gaïffas , Guillaume Lecué

We study "canonical weight decompositions" slightly generalizing that defined by J. Wildeshaus. For an triangulated category $C$, any integer $n$, and a weight structure $w$ on $C$ a triangle $LM\to M\to RM\to LM[1]$, where $LM$ is of…

K-Theory and Homology · Mathematics 2021-07-27 Mikhail V. Bondarko

Let $\fg$ be any untwisted affine Kac-Moody algebra, $\mu$ any fixed complex number, and $\wt\fg(\mu)$ the corresponding toroidal extended affine Lie algebra of nullity two. For any $k$-tuple $\bm{\lambda}=({\lambda}_1, \cdots,…

Representation Theory · Mathematics 2017-11-07 Fulin Chen , Zhiqiang Li , Shaobin Tan

We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…

Rings and Algebras · Mathematics 2021-12-07 Ran Gutin

All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to…

Logic in Computer Science · Computer Science 2015-07-01 Harald Zankl , Martin Korp

Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…

Numerical Analysis · Mathematics 2024-04-08 Sofia Eriksson , Jonas Nordqvist

The algebra of Schur operators on l^2 is known not to be inverse-closed. When l^2=l^2(X) where X is a metric space, we can consider elements of the Schur algebra with certain decay at infinity. For instance if X has the doubling property,…

Functional Analysis · Mathematics 2010-07-23 Romain Tessera

The Burrows-Wheeler transform (BWT) is a reversible transform that converts a string $w$ into another string $\mathsf{BWT}(w)$. The size of the run-length encoded BWT (RLBWT) can be interpreted as a measure of repetitiveness in the class of…

Discrete Mathematics · Computer Science 2024-11-19 Hideo Bannai , Tomohiro I , Yuto Nakashima
‹ Prev 1 3 4 5 6 7 10 Next ›