English
Related papers

Related papers: Total positivity of recursive matrices

200 papers

For a 4th order 3-dimensional symmetric tensor with its some entries $1$ or $-1$, we show the analytic sufficient and necessary conditions of its positive definiteness. By applying these conclusions, several strict inequalities is bulit for…

Classical Analysis and ODEs · Mathematics 2024-08-27 Yisheng Song

Based on a classical result on partitions of an integer into a finite set of positive integers, we establish a general positivity result on coefficients of certain $q$-series which uniformly refines the positivity of truncated pentagonal…

Number Theory · Mathematics 2024-12-03 Ji-Cai Liu

The concept of the {\em half density matrix} is proposed. It unifies the quantum states which are described by density matrices and physical processes which are described by completely positive maps. With the help of the half-density-matrix…

Quantum Physics · Physics 2009-11-06 Sixia Yu

We consider the following question: Which real sequences (a(n)) that satisfy a linear recurrence with constant coefficients are positive for sufficiently large n? We show that the answer is negative for both (a(n)) and (-a(n)), if the…

Number Theory · Mathematics 2007-05-23 Stefan Gerhold

A subset of positive integers $F$ is a Schreier set if it is non-empty and $|F|\leqslant \min F$ (here $|F|$ is the cardinality of $F$). For each positive integer $k$, we define $k\mathcal{S}$ as the collection of all the unions of at most…

Combinatorics · Mathematics 2024-11-20 Kevin Beanland , Dmitriy Gorovoy , Jȩdrzej Hodor , Daniil Homza

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

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Veronika Pillwein

Call a Laurent polynomial $W$ `complete' if its Newton polytope is full-dimensional with zero in its interior. We show that if $W$ is any complete Laurent polynomial with coefficients in the positive part of the field $K$ of generalised…

Algebraic Geometry · Mathematics 2025-10-03 Jamie Judd , Konstanze Rietsch

Let ${\bf a}=(a_1, a_2, \ldots, a_n)$ and ${\bf e}=(e_1, e_2, \ldots, e_n)$ be real sequences. Denote by $M_{{\bf e}\rightarrow {\bf a}}$ the $(n+1)\times(n+1)$ matrix whose $(m,k)$ entry ($m, k \in \{0,\ldots, n\}$) is the coefficient of…

Combinatorics · Mathematics 2023-06-26 David Galvin , Yufei Zhang

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…

A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP…

Optimization and Control · Mathematics 2014-01-08 Anwa Zhou , Jinyan Fan

In this paper we characterize the nonnegative irreducible tridiagonal matrices and their permutations, using certain entries in their primitive idempotents. Our main result is summarized as follows. Let $d$ denote a nonnegative integer. Let…

Combinatorics · Mathematics 2010-10-08 Kazumasa Nomura , Paul Terwilliger

We study the recursions $A(n) = A(n-a-A^k(n-b)) + A(A^k(n-b))$ where $a \geq 0$, $b \geq 1$ are integers and the superscript $k$ denotes a $k$-fold composition, and also the recursion $C(n) = C(n-s-C(n-1)) + C(n-s-2-C(n-3))$ where $s \geq…

Combinatorics · Mathematics 2014-07-03 Abraham Isgur , Mustazee Rahman

We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a…

Discrete Mathematics · Computer Science 2013-10-11 Joel Ouaknine , James Worrell

A sequence of positive integers is complete if every positive integer is a sum of distinct terms. A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with nonnegative coefficients…

We investigate the tropical analogues of totally positive and totally nonnegative matrices. These arise when considering the images by the nonarchimedean valuation of the corresponding classes of matrices over a real nonarchimedean valued…

Commutative Algebra · Mathematics 2019-12-30 Stéphane Gaubert , Adi Niv

We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…

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

By an $abc$ triple, we mean a triple $(a,b,c)$ of relatively prime positive integers $a,b,$ and $c$ such that $a+b=c$ and $\operatorname{rad}(abc)<c$, where $\operatorname{rad}(n)$ denotes the product of the distinct prime factors of $n$.…

Number Theory · Mathematics 2023-08-29 Elise Alvarez-Salazar , Alexander J. Barrios , Calvin Henaku , Summer Soller

We study ranks of the $r\textrm{th}$ Hadamard powers of doubly nonnegative matrices and show that the matrix $A^{\circ r}$ is positive definite for every $n\times n$ doubly nonnegative matrix $A$ and for every $r>n-2$ if and only if no…

Classical Analysis and ODEs · Mathematics 2020-04-09 Tanvi Jain