Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.08165

A Bivariate Polynomial Problem for Matrices

Dharm Prakash Singh·Amit Ujlayan·Bhim Sen Choudhary
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate polynomial subspaces (BVPSs) to be an isomorphism in some finite-dimensional BVPSs. In the process of solving, the article deals with the existence, uniqueness, and construction of the polynomials in some finite-dimensional BVPSs concerning the solution of the proposed problem. To this end, a relationship is established between the proposed problem and a class of Lagrange bivariate polynomial interpolation problems (LBVPIPs). As a result, the existence of a standard and a new class of finite-dimensional BVPSs of various total degrees has been established in which the proposed problem always possesses a unique solution. In addition, some formulas are derived to construct the needed polynomials in these BVPSs. Further, the possible applicability of the proposed problem is discussed in LBVPIPs, focusing on the finite rectangular schemes of bivariate interpolation points on the natural Cartesian grid. At last, some numerical examples are considered to justify the theoretical findings.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Dharm Prakash Singh, Amit Ujlayan, Bhim Sen Choudhary. 2017-12-21. A Bivariate Polynomial Problem for Matrices. https://arxiv.org/abs/1712.08165

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

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↗