Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1704.07374

Regular approximate factorization of a class of matrix-function with an unstable set of partial indices

G. Mishuris·S. Rogosin
View original source ↗Read source document ↗Export metadata ↓

Abstract

From the classic work of Gohberg and Krein (1958), it is well known that the set of partial indices of a non-singular matrix function may change depending on the properties of the original matrix. More precisely, it was shown that if the difference between the larger and the smaller partial indices is larger than unity then, in any neighborhood of the original matrix function, there exists another matrix function possessing a different set of partial indices. As a result, the factorization of matrix functions, being an extremely difficult process itself even in the case of the canonical factorization, remains unresolvable or even questionable in the case of a non-stable set of partial indices. Such a situation, in turn, has became an unavoidable obstacle to the application of the factorization technique. This paper sets out to answer a less ambitious question than that of effective factorizing matrix functions with non-stable sets of partial indices, and instead focuses on determining the conditions which, when imposed on the original matrix function, allow to construct another matrix function that exhibits the same partial indices and is close to the original matrix function.

Explore related subjects

math.CAmath.CV

Keep this discovery

BibTeXRIS

G. Mishuris, S. Rogosin. 2017-04-24. Regular approximate factorization of a class of matrix-function with an unstable set of partial indices. https://doi.org/10.1098/rspa.2017.0279

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA↗
arXiv2026

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA↗
arXiv2026

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA↗