English
Related papers

Related papers: The convergence of power matrices

200 papers

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

Commutative Algebra · Mathematics 2020-06-09 Alberto Dennunzio , Enrico Formenti , Darij Grinberg , Luciano Margara

A general integral expression to transform power series is applied to $\arcsin{x}$ and its positive integer powers. We concentrate on the first to the fourth powers and obtain infinite classes of new power series involving central binomial…

Classical Analysis and ODEs · Mathematics 2025-11-25 Karl Dilcher , Christophe Vignat

A banded matrix is a real square matrix where nonzero entries appear around the main diagonal. In this article, we consider linear complementarity properties of (variants) of banded matrices. Focusing on triangular matrices and the newly…

Optimization and Control · Mathematics 2026-03-12 Samapti Pratihar , M. Seetharama Gowda , K. C. Sivakumar

We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…

Numerical Analysis · Mathematics 2018-06-27 Martin Neuenhofen

Let $A \in \mathbb{R}^{n \times n}$ be the adjacency matrix of an Erd\H{o}s R\'enyi graph $G(n, d/n)$ for $d = \omega(1)$ and $d \leq 3\log(n)$. We show that as $n$ goes to infinity, with probability that goes to $1$, the adjacency matrix…

Combinatorics · Mathematics 2022-01-25 Margalit Glasgow

We study the singularity probability of n*n random matrices with i.i.d. entries from highly biased discrete distributions. We obtain sharp non-asymptotic bounds for this probability and derive estimates on the least singular values. Our…

Probability · Mathematics 2025-12-12 Zeyan Song

For a real matrix $M$, we denote by $sp(M)$ the spectrum of $M$ and by $\left \vert M\right \vert $ its absolute value, that is the matrix obtained from $M$ by replacing each entry of $M$ by its absolute value. Let $A$ be a nonnegative real…

Combinatorics · Mathematics 2015-07-29 Kawtar Attas , Abderrahim Boussaïri , Mohamed Zaidi

In this survey article, we describe recent work that connects three separate objects of interest: totally nonnegative matrices; quantum matrices; and matrix Poisson varieties.

Quantum Algebra · Mathematics 2009-11-17 S. Launois , T. H. Lenagan

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

Combinatorics · Mathematics 2020-11-04 Igor Araujo , József Balogh , Yuzhou Wang

A nonzero pattern is a matrix with entries in {0,*}. A pattern is potentially nilpotent if there is some nilpotent real matrix with nonzero entries in precisely the entries indicated by the pattern. We develop ways to construct some…

Rings and Algebras · Mathematics 2010-10-04 Hannah Bergsma , Kevin N. Vander Meulen , Adam Van Tuyl

We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice to describe a convex n-gon up to a linear projection.

Combinatorics · Mathematics 2013-03-11 Yaroslav Shitov

Let $d\geq 3$ be a fixed integer, and a prime number $p$ such that $\gcd(p,d)=1$. Let $A$ be the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. We show that as a random matrix in ${\mathbb F}_p$, \begin{equation}…

Probability · Mathematics 2019-01-01 Jiaoyang Huang

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

Functional Analysis · Mathematics 2012-06-29 Michal Wojtylak

Let $d(N )$ (resp. $p(N )$) be the number of summands in the determinant (resp. permanent) of an $N\times N$ circulant matrix $A = (a_{ij} )$ given by $a_{ij} = X_{i+j}$ where $i + j$ should be considered $\mod N$ . This short note is…

Algebraic Geometry · Mathematics 2018-10-09 Liena Colarte , Emilia Mezzetti , Rosa Maria Miró-Roig , Martí Salat

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…

Combinatorics · Mathematics 2015-12-18 Jonathan McLaughlin

The aim of this paper is to get a complete list of positive definite symmetric matrices with integer entries $\a&b\b&d\$ such that all complex solutions to the system of equations $1-x_1=x_1^ax_2^b\ 1-x_2=x_1^bx_2^d$ are real. This result…

Mathematical Physics · Physics 2011-06-06 An Huang , Chul-hee Lee

We consider a class of interacting particle systems with values in $[0,\8)^{\zd}$, of which the binary contact path process is an example. For $d \ge 3$ and under a certain square integrability condition on the total number of the…

Probability · Mathematics 2009-06-26 Yukio Nagahata , Nobuo Yoshida

A set of nonnegative matrices $\mathcal{M}=\{M_1, M_2, \ldots, M_k\}$ is called primitive if there exist indices $i_1, i_2, \ldots, i_m$ such that $M_{i_1} M_{i_2} \ldots M_{i_m}$ is positive (i.e. has all its entries $>0$). The length of…

Formal Languages and Automata Theory · Computer Science 2016-02-25 Balázs Gerencsér , Vladimir V. Gusev , Raphaël M. Jungers

Let $n,k$ be fixed natural numbers with $1\le k\le n$ and let $A_{n+1,k,2k,\dots,sk}$ denote an $(n+1)\times (n+1)$ complex multidiagonal matrix having $s=[n/k]$ sub- and superdiagonals at distances $k,2k,\dots,sk$ from the main diagonal.…

Rings and Algebras · Mathematics 2021-05-21 L. Losonczi

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

Number Theory · Mathematics 2018-01-08 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala