Hadi Kharaghani, Thomas Pender, Sho Suda
Balanced weighing matrices with parameters $$ \left(1+18\cdot\frac{9^{m+1}-1}{8},9^{m+1},4\cdot 9^m\right), $$ for each nonzero integer $m$ is constructed. This is the first infinite class not belonging to those with classical parameters. It is shown that any balanced weighing matrix is equivalent to a five-class association scheme.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A weighing matrix $W$ is quasi-balanced if $|W||W|^\top=|W|^\top|W|$ has at most two off-diagonal entries, where $|W|_{ij}=|W_{ij}|$. A quasi-balanced weighing matrix $W$ signs a strongly regular graph if $|W|$ coincides with its adjacency matrix. Among other things, signed strongly regular graphs and their equivalent association schemes are presented.
A unified approach to the construction of weighing matrices and certain symmetric designs is presented. Assuming the weight $p$ in a weighing matrix $W(n,p)$ is a prime power, it is shown that there is a $$W\left(\frac{p^{m+1}-1}{p-1}(n-1)+1,p^{m+1}\right)$$ for each positive integer $m$. The case of $n=p+1$ reduces to the balanced weighing matrices with classical parameters $$W\left(\frac{p^{m+2}-1}{p-1},p^{m+1}\right).$$ The equivalence with certain classes of association schemes is discussed in details.
On optimal constant weight codes derived from $ω$-circulant balanced generalized weighing matrices
本文利用具有经典参数的$\omega$-循环平衡加权矩阵，构造了长度为$(q^m-1)/(q-1)$、字母表大小为$g+1$的最优常重码，其中$q$为奇素数幂，$g$整除$q-1$。
We prove a classification theorem for Hankel weighing matrices.
Inspired by the many applications of mutually unbiased Hadamard matrices, we study mutually unbiased weighing matrices. These matrices are studied for small orders and weights in both the real and complex setting. Our results make use of and examine the sharpness of a very important existing upper bound for the number of mutually unbiased weighing matrices.
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to form commutative association schemes with 3 or 4 classes.
We provide a classification method of weighing matrices based on a classification of self-orthogonal codes. Using this method, we classify weighing matrices of orders up to 15 and order 17, by revising some known classification. In addition, we give a revised classification of weighing matrices of weight 5. A revised classification of ternary maximal self-orthogonal codes of lengths 18 and 19 is also presented.
We study the structure of unit weighing matrices of order n and weights 2, 3 and 4. We show that the number of inequivalent unit weighing matrices UW(n,4) depends on the number of decompositions of n into sums of non-negative multiples of some specific positive integers. We also show two interesting sporadic cases in order to show the complexities involved for weights larger than 4.
Unbiased weighing matrices of weight $9$
本文研究权重为9的无偏称重矩阵，提出基于相互适配拉丁方的构造方法，并确定n≤16时相互无偏称重矩阵集合的最大规模，发现最小存在阶数为13，首次找到最大类的阶数为16。
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give a classification of binary codes of lengths $8,16$ and binary maximal codes of length $32$ satisfying the conditions. As an application, sets of $8$ mutually quasi-unbiased weighing matrices for parameters $(16,16,4,64)$ and $4$ mutually quasi-unbiased weighing matrices for parameters $(32,32,4,256)$ are cons…
Orthogonal designs and weighing matrices have many applications in areas such as coding theory, cryptography, wireless networking and communication. In this paper, we first show that if positive integer $k$ cannot be written as the sum of three integer squares, then there does not exist any skew-symmetric weighing matrix of order $4n$ and weight $k$, where $n$ is an odd positive integer. Then we show that for any square $k$, there is an integer $N(k)$ such that for each $n\ge N(k)$, there is a symmetric weighing matrix of order $n$ and weight $k$. Moreover, we improve some of the asymptotic ex…
In this paper we completely classify the circulant weighing matrices of weight 16 and odd order. It turns out that the order must be an odd multiple of either 21 or 31. Up to equivalence, there are two distinct matrices in CW(31,16), one matrix in CW(21,16) and another one in CW(63,16) (not obtainable by Kronecker product from CW(21,16)). The classification uses a multiplier existence theorem.
A circulant weighing matrix $W = (w_{i,j})$ is a square matrix of order $n$ and entries $w_{i,j}$ in $\{0, \pm 1\}$ such that $WW^T=kI_n$. In his thesis, Strassler gave a table of existence results for such matrices with $n \leq 200$ and $k \leq 100$. In the latest version of Strassler's table given by Tan \cite{arXiv:1610.01914} there are 34 open cases remaining. In this paper we give nonexistence proofs for 12 of these cases, report on preliminary searches outside Strassler's table, and characterize the known proper circulant weighing matrices.
Mutually unbiased weighing matrices (MUWM) are closely related to an antipodal spherical code with 4 angles. In the present paper, we clarify the relationship between MUWM and the spherical sets, and give the complete solution about the maximum size of a set of MUWM of weight 4 for any order. Moreover we describe some natural generalization of a set of MUWM from the viewpoint of spherical codes, and determine several maximum sizes of the generalized sets. They include an affirmative answer of the problem of Best, Kharaghani, and Ramp.
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices and their orbit matrices. The LCD codes constructed can be of any length dimension according to the choice of matrices used in their construction. As a special case, LCD codes of length $2n$ and dimension $n$ are constructed which also have the property of being formally self-dual. Alternatively, under a condition depending on $q$ that the codes are not LCD, …
A survey of complex generalized weighing matrices and a construction of quantum error-correcting codes
本文调研复广义称重矩阵的现有研究，扩展其存在条件与构造、整理小参数存在结果，并基于该矩阵构造量子纠错码以证明其应用价值。
The notion of unbiased orthogonal designs is introduced as a generalization among unbiased Hadamard matrices, unbiased weighing matrices and quasi-unbiased weighing matrices. We provide upper bounds and several constructions for mutually unbiased orthogonal designs. As an application, mutually quasi-unbiased weighing matrices for various parameters are obtained.
Constructions of $t$-designs from weighing matrices and association schemes
本文提出通过权矩阵和关联方案构造t-设计的方法，展示了利用会议矩阵生成3-设计的可能性，并探讨了满足特定组合限制的矩阵变体，发现部分平衡不完全块设计和正则配对平衡设计的无限族。
Gauss periods taking exactly two values are closely related to two-weight irreducible cyclic codes and strongly regular Cayley graphs. They have been extensively studied in the work of Schmidt and White and others. In this paper, we consider the question of when Gauss periods take exactly three rational values. We obtain numerical necessary conditions for Gauss periods to take exactly three rational values. We show that in certain cases, the necessary conditions obtained are also sufficient. We give numerous examples where the Gauss periods take exactly three vlaues. Furthermore, we discuss co…
Constructing, Classifying and Studying the Space of Small Integer Weighing Matrices
本文研究并分类了小尺寸n×n权为k的整数权矩阵空间，包括到Hadamard等价和自同构群的不等价矩阵列表，并应用于射影空间权矩阵，提供算法和Sagemath实现，解决了一些开放问题。
Thin divisible designs graphs: an interplay between fixed-point free involutions of $(v,k,λ)$-graphs and symmetric weighing matrices
本文研究了薄可除设计图中加权矩阵、(v,k,λ)-图及符号图之间的相互作用，提出了两种新的递归构造方法用于正则对称Hadamard矩阵和强正则图，并发现了symplictic图中固定点自由置换的性质。
An algorithm for constructing and classifying the space of small integer weighing matrices
本文提出一种在个人计算机上高效构造并分类小尺寸整数称重矩阵的算法，改进了整数平方和表示算法，并给出 $IW(7,25)$ 的完整分类，为寻找经典称重矩阵 $W(35,25)$ 提供基础。
Complex generalised weighing matrices in centraliser algebras of monomial representations
研究复广义加权矩阵\(CGW(n,w;k)\)，利用有限群单项式表示的中心化子代数，通过对舒尔覆盖线性特征的穷举搜索，对特定条件的此类矩阵分类，恢复相关无限族，构造量子纠错码并确定其最小距离。
We investigate the existence problem of group invariant matrices using algebraic approaches. We extend the usual concept of multipliers to group rings with cyclotomic integers as coefficients. This concept is combined with the field descent method and rational idempotents to develop new non-existence results.
Quantum computation in the one-way model requires the preparation of certain resource states known as cluster states. We describe how the construction of continuous-variable cluster states for optical quantum computing relate to the existence of certain families of matrices. The relevant matrices are known as weighing matrices, with a few additional constraints. We prove some results regarding the structure of these matrices, and their associated graphs.
Cyclic relative difference sets and circulant weighing matrices
本文扩展了对循环相对差集的搜索，并将其应用于循环权矩阵的存在性研究。
Construction of Generalized Weighing-Hadamard Matrices over Finite Fields
研究有限域上广义加权哈达玛矩阵，探讨其存在性、性质与构造，证明可逆矩阵子集构成群，引入等价概念及证明商群是阿贝尔群，并讨论其在编码理论中的应用。
Classification of Symmetric Hadamard Matrices Up to Order 32
本文对阶数≤32的对称阿达马矩阵按阿达马等价分类，修正了阶数28分类的错误，用新算法完成分类与枚举，还扩展算法到称重矩阵并建立相关理论结果。
In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is ignificantly lower than the classical one. It is pointed out that this scheme captures both Bernstein & Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the article we consider Paley's construction of Hadamard matrices, which relies on the properties of quadrati…
Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design digraphs.
Character and Multiplier Obstructions for Circulant Weighing Matrices
该研究结合收缩、特征计算、乘子方法等，证明了8个不同阶数和权重的循环称重矩阵不存在。
We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard matrices. We then apply the criterion to these non-commutative association schemes to obtain symmetric fusion association schemes.
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas-Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a $CW(126,64)$ and a $CW(19…
A Method of Construction of Pairwise Additive Balanced Incomplete Block Designs
本文提出从ARSRGD设计及广义哈达玛矩阵构造成对可加BIB设计的新方法，结合广义哈达玛矩阵的已知结果得到含此前未知参数集的新无穷系列成对可加BIB设计。
We identify a relationship between a random walk on a certain Euclidean lattice and incidence matrices of balanced incomplete block designs. We then compute the return probability of the random walk and use it to obtain the asymptotic number of BIBD incidence matrices (as the number of columns increases). Our strategy is similar in spirit to the one used by de Launey and Levin to count partial Hadamard matrices.
Let $G$ be a strongly connected and balanced directed graph. The Laplacian matrix of $G$ is then the matrix (not necessarily symmetric) $L:=D-A$, where $A$ is the adjacency matrix of $G$ and $D$ is the diagonal matrix such that the row sums and the column sums of $L$ are equal to zero. Let $L^†=[l^†_{ij}]$ be the Moore-Penrose inverse of $L$. We define the resistance between any two vertices $i$ and $j$ of $G$ by $r_{ij}:=l^†_{ii}+l^†_{jj}-2l^†_{ij}$. In this paper, we derive some interesting properties of the resistance and the corresponding resistance matrix $[r_{ij}]$.
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 equivalent formulations have been previously studied using different terminology. We collate previous results phrased in terms of balanced splittable Hadamard matrices, real flat equiangular tight frames, spherical two-distance sets, and two-distance tight frames. We use combinatorial analysis to restrict the parameters of a balanced splittable Hadamard matrix to …
The (Symbolic and Numeric) Computational Challenges of Counting 0-1 Balanced Matrices
本文研究行数固定、列数任意且行列黑白平衡的0-1矩阵计数问题，并扩展到禁止特定水平与垂直模式的情形，证明序列满足多项式系数线性递推，同时显著扩展了Hardin的数值计算结果。
Let $G$ be a connected graph with $V(G)=\{1,\dotsc,n\}$. Then the resistance distance between any two vertices $i$ and $j$ is given by $r_{ij}:=l_{ii}^† + l_{jj}^†-2 l_{ij}^†$, where $l_{ij}^†$ is the $(i,j)^{\rm th}$ entry of the Moore-Penrose inverse of the Laplacian matrix of $G$. For the resistance matrix $R:=[r_{ij}]$, there is an elegant formula to compute the inverse of $R$. This says that \[R^{-1}=-\frac{1}{2}L + \frac{1}{τ' R τ} ττ', \] where \[τ:=(τ_1,\dotsc,τ_n)'~~\mbox{and}~~ τ_{i}:=2- \sum_{\{j \in V(G):(i,j) \in E(G)\}} r_{ij}~~~i=1,\dotsc,n. \] A far reaching generalization of t…
For any rational number $h$ and all sufficiently large $n$ we give a deterministic construction for an $n\times \lfloor hn\rfloor$ compressed sensing matrix with $(\ell_1,t)$-recoverability where $t=O(\sqrt{n})$. Our method uses pairwise balanced designs and complex Hadamard matrices in the construction of $ε$-equiangular frames, which we introduce as a generalisation of equiangular tight frames. The method is general and produces good compressed sensing matrices from any appropriately chosen pairwise balanced design. The $(\ell_1,t)$-recoverability performance is specified as a simple functio…
Mullineux map: $d$-balanced partitions and $d$-runner matrices
本文研究Mullineux映射在$d$-平衡分拆上的作用，通过引入$d$-游标矩阵，证明特定条件下分拆与像的$d$-游标矩阵一致，并利用新提出的Abacus Mullineux算法给出组合刻画。
Balanced rectangles over Sturmian words and minimal discrepancy intervals
研究Sturmian单词斜率为α的m×n矩形矩阵的平衡性质，通过Ostrowski表示描述其特性，扩展了Anselmo等人和Shallit的研究，采用nα mod 1的分布方法。
Permanental Inequalities and Unit Interval Orders
研究单位区间序反邻接矩阵的永久不等式，证明连续主子式永久乘积与奇偶选择主子式永久乘积的不等式，并构造置换间的双射，猜想对所有n成立。
Balanced Fibonacci word rectangles, and beyond
本文基于Anselmo等人近期的研究，探讨了由斐波那契词构成的m×n矩形矩阵的平衡性质，并通过有限自动机解决，进一步推广到所有二次无理数对应的Sturmian特征词，还研究了 tribonacci 词和Thue-Morse 词的类似问题。
Universality for cokernels of partially random integral matrices
研究部分随机整数矩阵余核的通用性，放宽元素平衡和独立性条件，证明即使有一定数量元素不满足\(\varepsilon\)-平衡及存在特定依赖关系时，余核分布仍趋近科恩 - 莱斯特拉分布，还证明特定随机带矩阵余核也有此性质，回答了相关问题。
A Lovász Theta Parameter and Theta Body for Signed Graphs
该研究为带符号图的平衡着色提出Lovász型半定参数与凸角层级结构，证明平衡完美性弱于关联双覆盖图的完美性，相关构造与广义Theta数等概念相关。
A Complete Classification of Complex Hadamard Matrices of Order Six
本文解决了悬而未决数十年的六阶复阿达马矩阵分类问题，通过有限关联分类方法，补充了Szöllősi扩张方法的全局步骤，为六阶阿达马矩阵及相关领域研究提供了严谨框架。
We show that permanents of doubly stochastic matrices with balanced entries are not far away from the minimum $n!/n^n$. As an application, we give a general law of large permanent, answering a question by Bochi, Iommi and Ponce
This is a research endeavor in two parts. We study a class of balanced urn schemes on balls of two colours (say white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn, and ball addition rules are applied. We consider these multiple drawings under sampling with or without replacement. We further classify ball addition matrices according to the structure of the expected value into affine and nonaffine classes. We give a necessary and sufficient condition for a scheme to be in the affine subclass. For the affine subclass, we get explicit results for the expected value …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。