Related papers: On the Finiteness Property for Rational Matrices

Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…

We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is beyond a computable bound, the Markov bases consist…

We consider the infinite sequences $(A\_n)\_{n\in\NN}$ of $2\times2$ matrices with nonnegative entries, where the $A\_n$ are taken in a finite set of matrices. Given a vector $V=\pmatrix{v\_1\cr v\_2}$ with $v\_1,v\_2>0$, we give a…

Let $\ell^p$ be the space of all $p$-summable sequences on $\mathbb{Z}$. An infinite matrix is said to have $\ell^p$-stability if it is bounded and has bounded inverse on $\ell^p$. In this paper, a practical criterion is established for the…

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…

We study pairs $(f, \Gamma)$ consisting of a non-Archimedean rational function $f$ and a finite set of vertices $\Gamma$ in the Berkovich projective line, under a certain stability hypothesis. We prove that stability can always be attained…

We prove that the permanent of nonnegative matrices can be deterministically approximated within a factor of $\sqrt{2}^n$ in polynomial time, improving upon the previous deterministic approximations. We show this by proving that the Bethe…

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

The joint spectral radius of a bounded set of $d \times d$ real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn…

A $\lambda$-quiddity of size $n$ is an $n$-tuple of elements from a fixed set, which is a solution to a matrix equation that arises in the study of Coxeter's friezes. The study of these solutions involves in particular the use of a notion…

Considered is the multiplicative semigroup of ratios of products of principal minors bounded over all positive definite matrices. A long history of literature identifies various elements of this semigroup, all of which lie in a…

We present a property satisfied by a large variety of complex continued fraction algorithms (the "finite building property") and use it to explore the structure of bijectivity domains for natural extensions of Gauss maps. Specifically, we…

A set of reals A is called perfectly meager if A \cap P is meager in P, for every perfect set P. Marczewski asked if the product of perfectly meager sets is perfectly meager. In the paper it is shown that it is consistent that the answer to…

Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…

Let $B$ be a finite set of natural numbers or complex numbers. Product set corresponding to $B$ is defined by $B.B:=\{ab:a,b\in B\}$. In this paper we give an upper bound for longest length of consecutive terms of a polynomial sequence…

In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…