相关论文: The Filbert Matrix

We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…

A composite positive integer n is Lehmer if \phi(n) divides n-1, where \phi(n) is the Euler's totient function. No Lehmer number is known, nor has it been proved that they don't exist. In 2007, the second author [7] proved that there is no…

It is observed that the infinite matrix with entries $(\sqrt{mn}\log (mn))^{-1}$ for $m, n\ge 2$ appears as the matrix of the integral operator $\mathbf{H}f(s):=\int_{1/2}^{+\infty}f(w)(\zeta(w+s)-1)dw$ with respect to the basis…

In this paper, we study a structured family of matrices whose entries are given by products of $k$-Fibonacci and $k$-Lucas numbers. For this family, we obtain explicit and unified formulas for several classical matrix invariants, including…

Prempreesuk, Noppakaew, and Pongsriiam determined the Zeckendorf representation of the multiplicative inverse of $2$ modulo $F_n$, for every positive integer $n$ not divisible by $3$, where $F_n$ denotes the $n$th Fibonacci number. We…

We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…

We give a formula for the inverse matrix to an infinite matrix with possibly noncommutative entries, generalizing the Newton interpolation formula and the Taylor formula.

It has been recently shown that $|| F_n(A) ||\leq 2$, where $A$ is a linear continuous operator acting in a Hilbert space, and $F_n$ is the Faber polynomial of degree $n$ corresponding to some convex compact $E\subset \mathbb C$ containing…

The research aims to construct a new type of matrix called the Fibonacci-Hessenberg-Lorentz matrix by multiplying Fibonacci-Hessenberg matrices with Lorentz matrix multiplication. The study will start by examining the properties of…

We find the eigenvalues and eigenvectors of the n by n matrix with (i,j) entry \binom(i-1,n-j), establishing a conjecture of Peele and Stanica. Curiously, the eigenvectors can be chosen to form a matrix which is its own inverse.

We study the multiplicative Hilbert matrix, i.e. the infinite matrix with entries $(\sqrt{mn}\log(mn))^{-1}$ for $m,n\geq2$. This matrix was recently introduced within the context of the theory of Dirichlet series, and it was shown that the…

Let $ K $ be a number field, $ S $ a finite set of places of $ K $, and $ \mathcal{O}_S $ be the ring of $ S $-integers. Moreover, let $$ G_n^{(0)} Z^d + \cdots + G_n^{(d-1)} Z + G_n^{(d)} $$ be a polynomial in $ Z $ having simple linear…

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

The recursively-constructed family of Mandelbrot matrices $M_n$ for $n=1$, $2$, $\ldots$ have nonnegative entries (indeed just $0$ and $1$, so each $M_n$ can be called a binary matrix) and have eigenvalues whose negatives $-\lambda = c$…

The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

The Stern polynomials defined by $s(0;x)=0$, $s(1;x)=1$, and for $n\geq 1$ by $s(2n;x)=s(n;x^2)$ and $s(2n+1;x)=x\,s(n;x^2)+s(n+1;x^2)$ have only 0 and 1 as coefficients. We construct an infinite lower-triangular matrix related to the…

Given polynomials a(z) of degree m and b(z) of degree n, we represent the inverse to the Sylvester resultant matrix of a(z) and b(z), if this inverse exists, as a canonical sum of m+n dyadic matrices each of which is a rational function of…