English
Related papers

Related papers: A note concerning the invertibility of certain alt…

200 papers

We analyse various exponential off-diagonal decay rates of the elements of infinite matrices and their inverses. It is known that such decay of the elements of an infinite matrix does not imply inverse--closeness, i.e. the inverse, if…

Functional Analysis · Mathematics 2023-03-16 Stevan Pilipovic , Bojan Prangoski , Milica Zigic

We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…

Rings and Algebras · Mathematics 2014-03-06 Paweł J. Szabłowski

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

Functional Analysis · Mathematics 2010-10-05 Daniel A. Spielman , Nikhil Srivastava

This note extends the invariant defined in "An invariant of metric spaces under bornologous equivalences" to the coarse category.

Metric Geometry · Mathematics 2024-03-20 Addison Fox , Brendon LaBuz , Robert Laskowsky

By modifying the proof of a paper by O. Bournez and M. Branicky, we establish that the Matrix Mortality Problem is decidable with any finite set of $2\times2$ matrices which has at most one invertible matrix. The same modification also…

Rings and Algebras · Mathematics 2019-12-23 Christopher Carl Heckman

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

Numerical Analysis · Mathematics 2025-02-26 Mark Embree , Joel A. Henningsen , Jordan Jackson , Ronald B. Morgan

In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…

General Mathematics · Mathematics 2012-07-26 Garimella Rama Murthy

Invariant manifolds are important sets arising in the stability theory of dynamical systems. In this article, we take a brief review of invariant sets. We provide some results regarding the existence of invariant lines and parabolas in…

Dynamical Systems · Mathematics 2022-08-29 Sachin Bhalekar , Madhuri Patil

We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.

Combinatorics · Mathematics 2012-10-02 Leonid Bedratyuk

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

Rings and Algebras · Mathematics 2025-08-29 Daren A. Thimm , Zijia Li , Hans-Peter Schröcker , Johannes Siegele

This paper presents new approaches for finding the determinant and inverse of a matrix. The choice of pivot selection is kept arbitrary and can be made according to the users need. So the ill conditioned matrices can be handled easily. The…

Commutative Algebra · Mathematics 2013-04-26 Hafsa Athar Jafree , Muhammad Imtiaz , Syed Inayatullah , Fozia Hanif Khan , Tajuddin Nizami

We show that a perturbation of any fixed square matrix D by a random unitary matrix is well invertible with high probability. A similar result holds for perturbations by random orthogonal matrices; the only notable exception is when D is…

Probability · Mathematics 2014-03-05 Mark Rudelson , Roman Vershynin

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Commutative Algebra · Mathematics 2012-10-09 Joost Berson

Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…

Mathematical Physics · Physics 2018-08-03 Oksana Bihun

In this short note we discuss ordinary differential equations which linearize upon one (or more) differentiations. Although the subject is fairly elementary, equations of this type arise naturally in the context of integrable systems.

Exactly Solvable and Integrable Systems · Physics 2015-06-26 E. V. Ferapontov , S. R. Svirshchevskii

Simple necessary and sufficient conditions for a $n$-tuple of noncommutative polynomials to be a cyclic gradient are given and similarly for a noncommutative polynomial to have a vanishing cyclic gradient. Connections with free probability…

Rings and Algebras · Mathematics 2007-05-23 Dan Voiculescu

For system of two ordinary differential equations of the second order representing autonomous non-conservative holonomic mechanical system, in case of dynamics such as one-frequency periodical oscillations, is found integrated invariant of…

Mathematical Physics · Physics 2007-05-23 A. N. Skripka

The aim of this note is to show that Poincar\'e inequalities imply corresponding weighted versions in a quite general setting. Fractional Poincar\'e inequalities are considered, too. The proof is short and does not involve covering…

Analysis of PDEs · Mathematics 2013-02-08 Bartłomiej Dyda , Moritz Kassmann

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

Symbolic Computation · Computer Science 2024-09-17 James H. Davenport
‹ Prev 1 3 4 5 6 7 10 Next ›