相关论文: The Propus Construction for Symmetric Hadamard Mat…

Convolutions or Hadamard products of analytic functions is a well explored area of research and many nice results are available in literature. On the other hand, very little is known in general about the convolutions of univalent harmonic…

This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…

We axiomatize and study the matrices of type $H\in M_N(A)$, having unitary entries, $H_{ij}\in U(A)$, and whose rows and columns are subject to orthogonality type conditions. Here $A$ can be any $C^*$-algebra, for instance $A=\mathbb C$,…

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…

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

It is known that real Mutually Unbiased Bases (MUBs) do not exist for any dimension $d > 2$ which is not divisible by 4. Thus, the next combinatorial question is how one can construct Approximate Real MUBs (ARMUBs) in this direction with…

We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model…

In this paper we use a design theoretical approach to construct new, previously unknown complex Hadamard matrices. Our methods generalize and extend the earlier results of de la Harpe--Jones and Munemasa--Watatani and offer a theoretical…

1. A standard Gaussian random matrix has full rank with probability 1 and is well-conditioned with a probability quite close to 1 and converging to 1 fast as the matrix deviates from square shape and becomes more rectangular. 2. If we…

Let $S(x)$ be the number of $n \leq x$ for which a Hadamard matrix of order $n$ exists. Hadamard's conjecture states that $S(x)$ is about $x/4$. From Paley's constructions of Hadamard matrices, we have that \[ S(x) = \Omega(x/\log x). \] In…

The purpose of this paper is to introduce new parametric families of complex Hadamard matrices in two different ways. First, we prove that every real Hadamard matrix of order N>=4 admits an affine orbit. This settles a recent open problem…

A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although…

The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…

We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…

We show that 138 odd values of n less than 10000 for which one knows how to construct a Hadamard matrix of order 4n have been overlooked in the recent handbook of combinatorial designs. There are four additional odd n, namely 191, 5767,…

This paper proposes Inverse Gram Matrix (IGM) methods to prioritize the Pairwise Reciprocal Matrix (PRM) in the Analytic Hierarchy Process. The IGM methods include Pseudo-IGM, Normalized-IGM, and Lagrange-IGM. Interestingly, the proposed…

We introduce two-dimensional toroidal arrays that are a variant of the de Bruijn tori. We call them nested perfect toroidal arrays. Instead of asking that every array of a given size has exactly one occurrence, we partition the positions in…

A complete classification of quaternary complex Hadamard matrices of orders 10, 12 and 14 is given, and a new parametrization scheme for obtaining new examples of affine parametric families of complex Hadamard matrices is provided. On the…

This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…

Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…