English
Related papers

Related papers: Bohemian Matrix Geometry

200 papers

This article gives a formal definition of a lognormal family of probability distributions on the set of symmetric positive definite (PD) matrices, seen as a matrix-variate extension of the univariate lognormal family of distributions. Two…

Methodology · Statistics 2014-07-29 Armin Schwartzman

In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…

Computational Complexity · Computer Science 2024-10-15 Giuliamaria Menara , Luca Manzoni

We propose a novel method of finding the classical limit of the matrix geometry. We define coherent states for a general matrix geometry described by a large-N sequence of D Hermitian matrices X_\mu (\mu =1,2, ..., D) and construct a…

High Energy Physics - Theory · Physics 2015-09-17 Goro Ishiki

In this paper we study ternary algebras of third-order hypermatrices. By hypermatrix we mean a complex-valued variable with three indices, which is also called a three-dimensional matrix or spatial matrix. We assume that a hypermatrix is…

Rings and Algebras · Mathematics 2024-05-29 Viktor Abramov

Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson…

Cryptography and Security · Computer Science 2025-08-19 Xingxing Xu , Minjia Shi , Patrick Sole

This work deals with relations between a bounded cohomological invariant and the geometry of Hermitian symmetric spaces of noncompact type. The invariant, obtained from the K\"ahler class, is used to define and characterize a special class…

Differential Geometry · Mathematics 2007-05-23 Anna Wienhard

We propose a theory for matrix completion that goes beyond the low-rank structure commonly considered in the literature and applies to general matrices of low description complexity. Specifically, complexity of the sets of matrices…

Information Theory · Computer Science 2024-10-03 Erwin Riegler , Günther Koliander , David Stotz , Helmut Bölcskei

We classify all cyclotomic matrices over the Eisenstein and Gaussian integers, that is, all Hermitian matrices over the Eisenstein and Gaussian integers that have all their eigenvalues in the interval [-2, 2].

Number Theory · Mathematics 2013-09-10 Gary Greaves

We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.

Rings and Algebras · Mathematics 2007-05-23 Anders Skovsted Buch

A mixed graph is called \emph{second kind hermitian integral}(or \emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of second kind are integers. A mixed graph is called \emph{Eisenstein integral} if the eigenvalues of…

Combinatorics · Mathematics 2022-06-23 Monu Kadyan , Bikash Bhattacharjya

We study families of metrics on automorphic vector bundles associated to representations of the modular group. These metrics are defined using an Eisenstein series construction. We show that in certain cases, the residue of these Eisenstein…

Number Theory · Mathematics 2021-12-09 Cameron Franc

We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…

Robotics · Computer Science 2011-02-22 Milan Hladik , David Daney , Elias Tsigaridas

We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are…

Symbolic Computation · Computer Science 2018-05-21 Vincent Neiger , Johan Rosenkilde , Grigory Solomatov

We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…

Mesoscale and Nanoscale Physics · Physics 2016-05-20 Emil A. Yuzbashyan , B. Sriram Shastry , Jasen A. Scaramazza

It is known that a real symmetric circulant matrix with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and orthogonal rows exists only of order $2d+2$ (and trivially of order $1$) [Turek and Goyeneche 2019]. In this paper we…

Combinatorics · Mathematics 2021-07-06 Daniel Uzcátegui Contreras , Dardo Goyeneche , Ondřej Turek , Zuzana Václavíková

We study some (Hopf) algebraic properties of circulant matrices, inspired by the fact that the algebra of circulant $n\times n$ matrices is isomorphic to the group algebra of the cyclic group with $n$ elements. We introduce also a class of…

Rings and Algebras · Mathematics 2011-10-10 Helena Albuquerque , Florin Panaite

The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…

Functional Analysis · Mathematics 2022-08-25 Tom Needham , Clayton Shonkwiler

In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…

Representation Theory · Mathematics 2018-10-10 Ryuji Tanimoto

Given an integral domain A we consider the set of all integral elements over A that can occur as an eigenvalue of a symmetric matrix over A. We give a sufficient criterion for being such an element. In the case where A is the ring of…

Number Theory · Mathematics 2016-08-12 Mario Kummer

The hexagonal tiling honeycomb is a beautiful structure in 3-dimensional hyperbolic space. It is called {6,3,3} because each hexagon has 6 edges, 3 hexagons meet at each vertex in a Euclidean plane tiled by regular hexagons, and 3 such…

History and Overview · Mathematics 2024-12-03 John C. Baez