Related papers: Bohemian Matrix Geometry
The octonions are one of the four normed division algebras, together with the real, complex and quaternion number systems. The latter three hold a primary place in random matrix theory, where in applications to quantum physics they are…
The barrier billiard is the simplest example of pseudo-integrable models with interesting and intricate classical and quantum properties. Using the Wiener-Hopf method it is demonstrated that quantum mechanics of a rectangular billiard with…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
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…
Boolean matrix has been used to represent digital information in many fields, including bank transaction, crime records, natural language processing, protein-protein interaction, etc. Boolean matrix factorization (BMF) aims to find an…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
Hessian operators arising in inverse problems governed by partial differential equations (PDEs) play a critical role in delivering efficient, dimension-independent convergence for both Newton solution of deterministic inverse problems, as…
An $n \times n$ matrix with $\pm 1$ entries which acts on $\mathbb{R}^n$ as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices…
The multiplication of matrices is an important arithmetic operation in computational mathematics. In the context of hierarchical matrices, this operation can be realized by the multiplication of structured block-wise low-rank matrices,…
Heffter arrays are combinatorial structures used to construct orthogonal cyclic cycle decompositions and biembeddings of complete graphs onto surfaces. A Heffter array $H(m,n;h,k)$ is an $m \times n$ partially filled array with distinct…
Baxter permutations are a class of permutations which are in bijection with a class of floorplans that arise in chip design called mosaic floorplans. We study a subclass of mosaic floorplans called $HFO_k$ defined from mosaic floorplans by…
We present explicit algorithms for computing structured matrix-vector products that are optimal in the sense of Strassen, i.e., using a provably minimum number of multiplications. These structures include Toeplitz/Hankel/circulant,…
Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…
The aim of this work is to construct families of weighing matrices via their automorphism group action. This action is determined from the $0,1,2$-cohomology groups of the underlying abstract group. As a consequence, some old and new…
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…
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…
A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…
A harmonic mapping is a univalent harmonic function of one complex variable. We define a family of harmonic mappings on the unit disk whose images are rotationally symmetric rosettes with $n$ cusps or n nodes, where $n \ge 3$. These…
The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a…