Related papers: Self-Dual Maps and Symmetric Bistochastic Matrices
We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. In particular, we link the problem of existence of maximally entangled multipartite states of $2k$ subsystems with $d$ levels each to the set of…
The first author proved that the harmonic convolution of a normalized right half-plane mapping with either another normalized right half-plane mapping or a normalized vertical strip mapping is convex in the direction of the real axis.…
Recent work has identified non-compact symmetric spaces U/H as a promising class of homogeneous manifolds to develop a geometrically consistent theory of neural networks. An initial implementation of these concepts has been presented in a…
We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…
Boundary integral equations lead to dense system matrices when discretized, yet they are data-sparse. Using the $\mathcal{H}$-matrix format, this sparsity is exploited to achieve $\mathcal{O}(N\log N)$ complexity for storage and…
A geometric interpretation of the duality between two real forms of the complex trigonometric Ruijsenaars-Schneider system is presented. The phase spaces of the systems in duality are viewed as two different models of the same reduced phase…
The dominating graph of a graph $H$ has as its vertices all dominating sets of $H$, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of $H$. In this paper we prove…
A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates…
We study the dynamics of the H\'enon map defined over complete, locally compact non-Archimedean fields of odd residue characteristic. We establish basic properties of its one-sided and two-sided filled Julia sets, and we determine, for each…
A given Hamiltonian matrix H with real spectrum is assumed tridiagonal and non-Hermitian. Its possible Hermitizations via an amended, ad hoc inner-product metric are studied. Under certain reasonable assumptions, all of these metrics are…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
Let $H$ be an undirected graph. In the List $H$-Homomorphism Problem, given an undirected graph $G$ with a list constraint $L(v) \subseteq V(H)$ for each variable $v \in V(G)$, the objective is to find a list $H$-homomorphism $f:V(G) \to…
Given an (anisotropic) Hermitian space $H$, the collection $P(H)$ of at most one-dimensional subspaces of $H$, equipped with the orthogonal relation $\perp$ and the zero linear subspace $\{0\}$, is a linear orthoset and up to…
We define geometric matrix midranges for positive definite Hermitian matrices and study the midrange problem from a number of perspectives. Special attention is given to the midrange of two positive definite matrices before considering the…
We study complex eigenvalues of large $N\times N$ symmetric random matrices of the form ${\cal H}=\hat{H}-i\hat{\Gamma}$, where both $\hat{H}$ and $\hat{\Gamma}$ are real symmetric, $\hat{H}$ is random Gaussian and $\hat{\Gamma}$ is such…
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube in an almost isometric way. We construct a simple, data-oblivious, and computationally efficient map that achieves this task with high…
We analyze properties of a map B = f(U) sending a unitary matrix U of size N into a doubly stochastic matrix defined by B_{i,j} = |U_{i,j}|^2. For any U we define its DEFECT, determined by the dimensionality of the space being the image…
Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…
A Butson Hadamard matrix $H$ has entries in the kth roots of unity, and satisfies the matrix equation $HH^{\ast} = nI_{n}$. We write $\mathrm{BH}(n, k)$ for the set of such matrices. A complete morphism of Butson matrices is a map…
We consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $\alpha$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by…