Related papers: Positivity certificates for linear recurrences
The Leinster matrix corresponding to a finite category has entries counting the number of morphisms between objects. A first question is to know which positive integer matrices come from at least one finite category. Here, that question…
In this paper, we show that a $D$-type map $\Phi_D:M_n\rightarrow M_n$ with $D=(n-2)I_n+P_{\pi_1}+P_{\pi_2}$ induced by a pair $\{\pi_1,\pi_2\}$ of permutations of $(1,2,..., n)$ is positive if $\{\pi_1,\pi_2\}$ has property (C). The…
Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums…
We establish the existence of loop type subcontinua of nonnegative solutions for a class of concave-convex type elliptic equations with indefinite weights, under Dirichlet and Neumann boundary conditions. Our approach depends on local and…
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism, the ability to define functions that…
Assessing non-negativity of multivariate polynomials over the reals, through the computation of {\em certificates of non-negativity}, is a topical issue in polynomial optimization. This is usually tackled through the computation of {\em…
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…
We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in…
We provide two certificates of convexity for arbitrary basic semi-algebraic sets of $\R^n$. The first one is based on a necessary and sufficient condition whereas the second one is based on a sufficient (but simpler) condition only. Both…
Certifying verification algorithms not only return whether a given property holds or not, but also provide an accompanying independently checkable certificate and a corresponding witness. The certificate can be used to easily validate the…
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a negligible…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
We present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.
Low-rank matrix recovery problems arise naturally as mathematical formulations of various inverse problems, such as matrix completion, blind deconvolution, and phase retrieval. Over the last two decades, a number of works have rigorously…
Schm\"udgen's Theorem says that if a basic closed semialgebraic set K = {g_1 \geq 0, ..., g_s \geq 0} in R^n is compact, then any polynomial f which is strictly positive on K is in the preordering generated by the g_i's. Putinar's Theorem…
Motivated by quantum thermodynamics we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We study k-positive maps on operators. Proofs are given to different positivity criteria. Special attention is on positive maps arising in the study of quantum information science. Results of other researchers are extended and improved. New…
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…
The paper studies differentially positive systems, that is, systems whose linearization along an arbitrary trajectory is positive. We illustrate the use of differential positivity on compact forward invariant sets for the characterization…