English
Related papers

Related papers: The Isomorphism of 3-Qubit Hadamards and $E_8$

200 papers

By solving a set of recursion relations for the matrix elements of the ${\cal U}_h(sl(2))$ generators, the finite dimensional highest weight representations of the algebra were obtained as factor representations. Taking a nonlinear…

q-alg · Mathematics 2009-10-30 B. Abdesselam , A. Chakrabarti , R. Chakrabarti

A partial Hadamard matrix $H\in M_{M\times N}(\mathbb C)$ is called of "classical type" if the associated quantum semigroup $G\subset\widetilde{S}_M^+$ is classical. In combinatorial terms, if $H_1,\ldots,H_M\in\mathbb T^N$ are the rows of…

Quantum Algebra · Mathematics 2014-12-03 Teo Banica

We prove an algebraic version of the Gauge-Invariant Uniqueness Theorem, a result which gives information about the injectivity of certain homomorphisms between ${\mathbb Z}$-graded algebras. As our main application of this theorem, we…

Rings and Algebras · Mathematics 2008-02-04 G. Abrams , P. N. Ánh , A. Louly , E. Pardo

For every positive integer $k$ such that $k>1,$ there are an infinity of odd integers $h$ with $\omega(h) =k$ distinct prime divisors such that there do not exist a Circulant Hadamard matrix $H$ of order $n=4h^2.$ Moreover, our main result…

Number Theory · Mathematics 2014-11-11 Luis H. Gallardo

An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all…

Geometric Topology · Mathematics 2009-11-09 Mathieu Dutour Sikiric , Michel Deza

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

Numerical Analysis · Mathematics 2023-11-14 Nicholas J. Higham

We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded…

Rings and Algebras · Mathematics 2007-10-31 Eli Aljadeff , Darrell Haile , Michael Natapov

Following the recent exploration of smooth heterotic compactifications with unitary bundles, orbifold compactifications in six dimensions can be shown to correspond in the blow-up to compactifications with U(1) gauge backgrounds. A powerful…

High Energy Physics - Theory · Physics 2007-09-14 Gabriele Honecker

We study general properties of holomorphic isometric embeddings of complex unit balls $\mathbb B^n$ into bounded symmetric domains of rank $\ge 2$. In the first part, we study holomorphic isometries from $(\mathbb B^n,kg_{\mathbb B^n})$ to…

Complex Variables · Mathematics 2018-04-25 Shan Tai Chan

Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that…

Combinatorics · Mathematics 2023-06-30 Matteo Cati , Dmitrii V. Pasechnik

Two skew Hadamard matrices are considered {\sf SH}-equivalent if they are similar by a signed permutation matrix. This paper determines the number of {\sf SH}-inequivalent skew Hadamard matrices of order $36$ for some types. We also study…

Combinatorics · Mathematics 2024-02-20 Makoto Araya , Masaaki Harada , Hadi Kharaghani , Ali Mohammadian , Behruz Tayfeh-Rezaie

It is proved that a code $L(q)$ which is monomially equivalent to the Pless symmetry code $C(q)$ of length $2q+2$ contains the (0,1)-incidence matrix of a Hadamard 3-$(2q+2,q+1,(q-1)/2)$ design $D(q)$ associated with a Paley-Hadamard matrix…

Combinatorics · Mathematics 2021-09-14 Vladimir D. Tonchev

In this paper, we establish an exponential inequality for U-statistics of i.i.d. data, varying kernel and taking values in a separable Hilbert space. The bound are expressed as a sum of an exponential term plus an other one involving the…

Probability · Mathematics 2024-09-19 Davide Giraudo

In this paper, we consider the rationally elliptic projective fourfolds that are holomorphically embedded into the complex projective eight-space $\mathbb{P}^8$. It is proved that a simply-connected $\mathbb Q$-homological projective…

Algebraic Geometry · Mathematics 2024-09-09 Jianqiang Yang

Call an $n$-by-$n$ invertible matrix $S$ a \emph{Perron similarity} if there is a real non-scalar diagonal matrix $D$ such that $S D S^{-1}$ is entrywise nonnegative. We give two characterizations of Perron similarities and study the…

Rings and Algebras · Mathematics 2017-08-02 Charles R. Johnson , Pietro Paparella

We investigate eigenvectors of rank-one deformations of random matrices $\boldsymbol B = \boldsymbol A + \theta \boldsymbol {uu}^*$ in which $\boldsymbol A \in \mathbb R^{N \times N}$ is a Wigner real symmetric random matrix, $\theta \in…

Statistics Theory · Mathematics 2018-08-14 Farzan Haddadi , Arash Amini

In this paper we present new Hadamard matrices and related combinatorial structures. In particular, it is constructed 5202 inequivalent Hadamard matrices of order 36 as well as 180538 Hadamard symmetric designs with 35 points in addition to…

Combinatorics · Mathematics 2014-05-19 Ivica Martinjak

An $n \times n$ matrix $H$ is Butson-Hadamard if its entries are $k^{\text{th}}$ roots of unity and it satisfies $HH^* = nI_n$. Write $BH(n, k)$ for the set of such matrices. Suppose that $k = p^{\alpha}q^{\beta}$ where $p$ and $q$ are…

Combinatorics · Mathematics 2019-08-19 Padraig O Cathain , Eric Swartz

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

Combinatorics · Mathematics 2022-10-27 Ada Chan , William J. Martin

We consider a notion of probabilistic rank and probabilistic sign-rank of a matrix, which measures the extent to which a matrix can be probabilistically represented by low-rank matrices. We demonstrate several connections with matrix…

Computational Complexity · Computer Science 2018-02-01 Josh Alman , Ryan Williams