Related papers: Extremal sequences of polynomial complexity
The joint spectral radius of a finite set of real $d \times d$ matrices is defined to be the maximum possible exponential rate of growth of long products of matrices drawn from that set. A set of matrices is said to have the…
The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices is said to satisfy the finiteness…
In this article we consider the maximum possible growth rate of sequences of long products of $d \times d$ matrices all of which are drawn from some specified compact set which has been normalised so as to have joint spectral radius equal…
The joint spectral radius of a compact set of d-times-d matrices is defined ?to be the maximum possible exponential growth rate of products of matrices drawn from that set. In this article we investigate the ergodic-theoretic structure of…
For finite-dimensional linear semigroups which leave a proper cone invariant it is shown that irreducibility with respect to the cone implies the existence of an extremal norm. In case the cone is simplicial a similar statement applies to…
The $p$-spectral radius of a graph $G\ $of order $n$ is defined for any real number $p\geq1$ as \[ \lambda^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\right) \ }x_{i}x_{j}:x_{1},\ldots,x_{n}\in\mathbb{R}\text{…
A zero-one matrix $M$ is said to contain another zero-one matrix $A$ if we can delete some rows and columns of $M$ and replace some $1$-entries with $0$-entries such that the resulting matrix is $A$. The extremal number of $A$, denoted…
The $n$-grid $E_n$ consists of $n$ equally spaced points in $[-1,1]$ including the endpoints $\pm 1$. The extremal polynomial $p_n^*$ is the polynomial that maximizes the uniform norm $\| p \|_{[-1,1]}$ among polynomials $p$ of degree $\leq…
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts but is…
Let $\bS=\{S_1,...,S_K\}$ be a finite set of complex $d\times d$ matrices and $\varSigma_{K}^+$ the compact space of all one-sided infinite sequences $i_{\bcdot}\colon\mathbb{N}\rightarrow\{1,...,K\}$. An ergodic probability $\mu_*$ of the…
The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. Under quite mild conditions such a set of matrices admits…
Let $F$ be a $k\times \ell$ (0,1)-matrix. A matrix is simple if it is a (0,1)-matrix with no repeated columns. A (0,1)-matrix $A$ is said to have a $F$ as a configuration if there is a submatrix of $A$ which is a row and column permutation…
The $f$ adjacency matrix is a type of edge-weighted adjacency matrix, whose weight of an edge $ij$ is $f(d_i,d_j)$, where $f$ is a real symmetric function and $d_i,d_j$ are the degrees of vertex $i$ and vertex $j$. The $f$-spectral radius…
The lower spectral radius, or joint spectral subradius, of a set of real $d \times d$ matrices is defined to be the smallest possible exponential growth rate of long products of matrices drawn from that set. The lower spectral radius arises…
We study the 'bad science matrix problem': among all matrices $A\in\mathbb{R}^{n\times n}$ whose rows have unit $\ell_2$-norm, determine the maximum of $\beta(A)=\frac{1}{2^n}\sum_{x\in\{\pm1\}^n}\|Ax\|_\infty$. Steinerberger [1]…
The conventional definition of extremality of a finite collection of sets is extended by replacing a fixed point (extremal point) in the intersection of the sets by a collection of sequences of points in the individual sets with the…
In 2002, Kamae and Zamboni introduced maximal pattern complexity and determined that any aperiodic sequence must have maximal pattern complexity at least $2k$. In 2006, Kamae and Rao examined the maximal pattern complexity of sequences over…
Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…
The Schur product of two complex m x n matrices is their entry wise product. We show that an extremal element X in the convex set of m x n complex matrices of Schur multiplier norm at most 1 satisfies the inequality rank(X) =< (m +n)^(1/2)…
We study the finite-step realizability of the joint/generalized spectral radius of a pair of real $d\times d$ matrices, one of which has rank 1. Then we prove that there always exists a finite-length word for which there holds the spectral…