Related papers: Continuous eigenvalues of minimal subshifts via S-…

It is natural to consider continuous dependence of the $n$-th eigenvalue on $d$-dimensional ($d\geq2$) Sturm-Liouville problems after the results on $1$-dimensional case by Kong, Wu and Zettl [14]. In this paper, we find all the boundary…

We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary…

If $v$ is an eigenvector for eigenvalue $\lambda$ of a graph $X$ and $\alpha$ is an automorphism of $X$, then $\alpha(v)$ is also an eigenvector for $\lambda$. Thus it is rather exceptional for an eigenvalue of a vertex-transitive graph to…

We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

At the turn of this century Durand, and Lagarias and Pleasants established that key features of minimal subshifts (and their higher-dimensional analogues) to be studied are linearly repetitive, repulsive and power free. Since then,…

We consider abstract second order systems of the form $\ddot{x}(t) + D \dot{x}(t) + Sx(t)=0$, which are typically analyzed via the operator matrix $\mathcal{A}=\left[\begin{smallmatrix} 0 & I \\ -S & -D \end{smallmatrix}\right]$ governing…

Let $H$ be a connected bipartite graph, whose signless Laplacian matrix is $Q(H)$. Suppose that the bipartition of $H$ is $(S,T)$ and that $x$ is the eigenvector of the smallest eigenvalue of $Q(H)$. It is well-known that $x$ is positive…

Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…

We provide a complete characterisation of automaticity of uniformly recurrent substitutive sequences in terms of the incidence matrix of the return substitution of the underlying purely substitutive sequence. This resolves a recent question…

For a class of non-selfadjoint $h$--pseudodifferential operators with double characteristics, we give a precise description of the spectrum and establish accurate semiclassical resolvent estimates in a neighborhood of the origin.…

We extend our combinatorial approach of decomposing the partition function of the Potts model on finite two-dimensional lattices of size L x N to the case of toroidal boundary conditions. The elementary quantities in this decomposition are…

In this work, a symbolic dynamical formulation based upon discrete iterative mappings derived from the Collatz conjecture is introduced. It is demonstrated that this formulation naturally induces a ternary alphabet useful for characterizing…

The problem of characterizing graphs with a prescribed number of main eigenvalues is a long-standing problem in spectral graph theory. Although some constructions are known, only a few produce infinite families of simple connected graphs…

We define and study exact, efficient representations of realization spaces Euclidean Distance Constraint Systems (EDCS), which includes Linkages and Frameworks. Each representation corresponds to a choice of Cayley parameters and yields a…

We address the computation of the degrees of minors of a noncommutative symbolic matrix of form \[ A[c] := \sum_{k=1}^m A_k t^{c_k} x_k, \] where $A_k$ are matrices over a field $\mathbb{K}$, $x_i$ are noncommutative variables, $c_k$ are…

A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous…

Reachability sets of linear switching dynamical systems (systems of ODE with time-dependent matrices that take values from a given compact set) are analysed. An eigenset is a non-trivial compact set M that possesses the following property:…

Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…

We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent…