Related papers: Mad Spectra
We describe some numerical experiments which determine the degree of spectral instability of medium size randomly generated matrices which are far from self-adjoint. The conclusion is that the eigenvalues are likely to be intrinsically…
The problem of approximating the discrete spectra of families of self-adjoint operators that are merely strongly continuous is addressed. It is well-known that the spectrum need not vary continuously (as a set) under strong perturbations.…
In 1969 H\"ochster proved that for every quasi-compact T1-space $X$ we can find a commutative ring $R$ such that $X$ is homeomorphic to the maximal spectrum $\mathrm{Specm}(R)$ of $R$. This result implies the existence of a commutative ring…
It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.
The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of this graph. In this paper we obtain new results about the…
In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…
The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…
A sum of open sets is a map taking two bounded open sets $A,B$ and producing a new open set $A \oplus B$. We prove that, up to sets of measure zero, there is only one such sum satisfying a natural list of axioms. It is the scaling limit of…
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…
Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…
For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…
Thus far, digraphs that are uniquely determined by their Hermitian spectra have proven elusive. Instead, researchers have turned to spectral determination of classes of switching equivalent digraphs, rather than individual digraphs. In the…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
The class of effectively closed infinite-genus surfaces, defining the completion of the domain of string perturbation theory, can be included in the category $O_G$, which is characterized by the vanishing capacity of the ideal boundary. The…
This note deals with the direct and inverse spectral analysis for a class of infinite band symmetric matrices. This class corresponds to operators arising from difference quations with usual and inner boundary conditions. We give a…
The Spectral Edges Conjecture is a well-known and widely believed conjecture in the theory of discrete periodic operators. It states that the extrema of the dispersion relation are isolated, non-degenerate, and occur in a single band. We…
A space $X$ is said to be $\kappa$-resolvable (resp. almost $\kappa$-resolvable) if it contains $\kappa$ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). $X$ is maximally resolvable iff…
A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…
Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.