Related papers: Switching graphs and Hadamard matrices
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
We present a purely diagrammatic derivation of the dual fermion scheme [Phys. Rev. B 77 (2008) 033101]. The derivation makes particularly clear that a similar scheme can be developed for an arbitrary reference system provided it has the…
Properties of morphisms represented by so-called 'string diagrams' of monoidal categories (and their braided and symmetric derivatives), mainly their resistance in value to isotopic deformation, have made the usage of graphical calculi…
In the last few years several new Random Matrix Models have been proposed and studied. They have found application in various different contexts, ranging from the physics of mesoscopic systems to the chiral transition in lattice gauge…
We propose an alternative approach for the construction of the unitary matrix which performs generalized unitary rotations of the system consisting of independent identical subsystems (for example spin system). This matrix, when applied to…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
In [Steve Butler. A note about cospectral graphs for the adjacency and normalized Laplacian matrices. Linear Multilinear Algebra, 58(3-4):387-390, 2010.], Butler constructed a family of bipartite graphs, which are cospectral for both the…
Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…
The study of homomorphisms of $(n,m)$-graphs, that is, adjacency preserving vertex mappings of graphs with $n$ types of arcs and $m$ types of edges was initiated by Ne\v{s}et\v{r}il and Raspaud in 2000. Later, some attempts were made to…
Classical path search assumes complete graphs and scalar optimization metrics, yet real infrastructure networks are incomplete and require multi-dimensional evaluation. We introduce the concept of traversal: a generalization of paths that…
In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…
To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There…
We consider continuous-time quantum walks on distance-regular graphs of small diameter. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
We investigate the problem of mapping, through the Morita equivalence, odd dimensional noncommutative lattice gauge theories onto suitable matrix models. We specialize our analysis to noncommutative three dimensional QED (NCQED) and scalar…
$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…
This paper introduces a convex optimization framework for identifying switched network systems, in which both the node dynamics and the underlying graph topology switch between a finite number of configurations. Building on our recent…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…