Related papers: Binary matrices of optimal autocorrelations as ali…
We consider the problem of finding the optimal diagonal preconditioner for a positive definite matrix. Although this problem has been shown to be solvable and various methods have been proposed, none of the existing approaches are scalable…
An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
Eigenmaps are important in analysis, geometry, and machine learning, especially in nonlinear dimension reduction. Approximation of the eigenmaps of a Laplace operator depends crucially on the scaling parameter $\epsilon$. If $\epsilon$ is…
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae…
We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…
We investigate the behavior of optimal alignment paths for homologous (related) and independent random sequences. An alignment between two finite sequences is optimal if it corresponds to the longest common subsequence (LCS). We prove the…
The first examples of D-optimal matrices of orders 222, 234, 258 and 278 are constructed.
The hull of a linear code $C$ is the intersection of $C$ with its dual. To the best of our knowledge, there are very few constructions of binary linear codes with the hull dimension $\ge 2$ except for self-orthogonal codes. We propose a…
In this review we discuss the relationship between random matrix theories and symmetric spaces. We show that the integration manifolds of random matrix theories, the eigenvalue distribution, and the Dyson and boundary indices characterizing…
We characterize the existence of proper holomorphic mappings in the special class of bounded $(1,2,...,n)$-balanced domains in $\mathbb{C}^n$, called the symmetrized ellipsoids. Using this result we conclude that there are no non-trivial…
Miniversal deformations for pairs of skew-symmetric matrices under congruence are constructed. To be precise, for each such a pair $(A,B)$ we provide a normal form with a minimal number of independent parameters to which all pairs of…
We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…
We investigate unbiased weighing matrices of weight $9$ and provide a construction method using mutually suitable Latin squares. For $n \le 16$, we determine the maximum size among sets of mutually unbiased weighing matrices of order $n$…
We give a complete classification of local and global conformal biharmonic maps between any two space forms by proving that a conformal map between two space forms is proper biharmonic if and only if the dimension is 4, the domain is flat,…
We propose a novel quark mass matrix texture-pair with five free parameters, which fits the four quark mass ratios $m_s/m_b$, $m_d/m_b$, $m_c/m_t$, $m_u/m_t$, and the four CKM quark mixing observables. The matrices each have one texture…
A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recently, Biedl and Wittnebel proved that every 1-planar graph…
Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such…
The equations underlying all supersymmetric solutions of six-dimensional minimal ungauged supergravity coupled to an anti-self-dual tensor multiplet have been known for quite a while, and their complicated non-linear form has hindered all…
We present two novel applications of symmetries for mixed-integer linear programming. First we propose two variants of a new heuristic to improve the objective value of a feasible solution using symmetries. These heuristics can use either…