Row completion of polynomial and rational matrices II

Agurtzane Amparan; Itziar Baragaña; Silvia Marcaida; Alicia Roca

Home/Archive/arXiv

arXiv · 2509.19355

Row completion of polynomial and rational matrices II

Agurtzane Amparan·Itziar Baragaña·Silvia Marcaida·Alicia Roca

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the row completion problem of polynomial and rational matrices with partial prescription of the structural data. The prescription of the complete structural data has been solved in Amparan et al., Lin. Alg. Appl. 720 (2025) 109-138, where several results of prescription of some of the four types of invariants composing the structural data have also been obtained. In this paper we deal with the cases not analyzed there. More precisely, we solve the row completion problem of a rational or a polynomial matrix when we prescribe the infinite (finite) structure and the column and/or the row minimal indices, and when only the column and/or row minimal indices are prescribed. The necessity of the conditions obtained are valid over arbitrary fields, but in some cases the proof of the sufficiency requires working over algebraically closed fields. By transposition the results obtained hold for the corresponding column completion problems.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Agurtzane Amparan, Itziar Baragaña, Silvia Marcaida, Alicia Roca. 2025-09-18. Row completion of polynomial and rational matrices II. https://arxiv.org/abs/2509.19355

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

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗