English
Related papers

Related papers: Integrability of matrices

200 papers

This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…

Combinatorics · Mathematics 2014-12-02 Michael Gene Dobbins

We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…

Number Theory · Mathematics 2026-03-26 Alina Ostafe , Igor E. Shparlinski

We are interested in the phenomenon of the essential spectrum instability for a class of unbounded (block) Jacobi matrices. We give a series of sufficient conditions for the matrices from certain classes to have a discrete spectrum on a…

Mathematical Physics · Physics 2017-09-19 Stanislas Kupin , Sergey Naboko

We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…

Number Theory · Mathematics 2021-11-11 Igor E. Shparlinski

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

Combinatorics · Mathematics 2014-04-21 Christine Bessenrodt , Richard P. Stanley

The problem of completing a large matrix with lots of missing entries has received widespread attention in the last couple of decades. Two popular approaches to the matrix completion problem are based on singular value thresholding and…

Statistics Theory · Mathematics 2022-04-25 Sohom Bhattacharya , Sourav Chatterjee

Necessary and sufficient conditions for the solvability of boundary value problems for a family of functional differential equations with a non-integrable singularity are obtained.

Classical Analysis and ODEs · Mathematics 2013-07-16 Eugene Bravyi

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota

We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…

Combinatorics · Mathematics 2024-09-13 Shmuel Onn

In this paper we construct nonlinear partial differential equations in more than 3 independent variables, possessing a manifold of analytic solutions with high, but not full, dimensionality. For this reason we call them ``partially…

Exactly Solvable and Integrable Systems · Physics 2009-11-11 A. I. Zenchuk , P. M. Santini

We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…

Numerical Analysis · Mathematics 2025-10-23 Adrian Kulmburg

This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…

Commutative Algebra · Mathematics 2007-05-23 Mordechai Katzman

This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…

Combinatorics · Mathematics 2018-05-01 Georgy P. Egorychev

In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…

Combinatorics · Mathematics 2020-02-26 Marija Dodig , Marko Stosic

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

Complex Variables · Mathematics 2026-04-17 Ovaisa Jan , Idrees Qasim

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

Algebraic Geometry · Mathematics 2008-07-29 Tim Netzer

In this paper, for the first time in the literature, we study the stability of solutions of two classes of feasibility (i.e., split equality and split feasibility) problems by set-valued and variational analysis techniques. Our idea is to…

Optimization and Control · Mathematics 2024-10-23 Vu Thi Huong , Hong-Kun Xu , Nguyen Dong Yen

This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…

Information Theory · Computer Science 2016-11-15 Yudong Chen

This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…

Commutative Algebra · Mathematics 2026-02-10 Zihao Dai , Hao Liang , Jingyu Lu , Lihong Zhi

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas