中文
相关论文

相关论文: On the Density of the Set of Known Hadamard Orders

200 篇论文

We prove that there is no circulant Hadamard matrix $H$ with first row $[h_{1},\ldots,h_{n}]$ of order $n>4$, under a condition about a sum of scalar products of rows of two other circulant matrices of size $n/2$ associated to $H.$

数论 · 数学 2019-03-25 Luis H. Gallardo

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…

数论 · 数学 2014-11-11 Luis H. Gallardo

Quaternary unit Hadamard (QUH) matrices were introduced by Fender, Kharagani and Suda along with a method to construct them at prime power orders. We present a novel construction of real Hadamard matrices from QUH matrices. Our construction…

We investigate the densities of the sets of abundant numbers and of covering numbers, integers $n$ for which there exists a distinct covering system where every modulus divides $n$. We establish that the set $\mathcal{C}$ of covering…

数论 · 数学 2026-02-12 Nathan McNew , Jai Setty

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

泛函分析 · 数学 2025-04-04 Michael Anshelevich , Anh Nguyen

What is the dimension of a smooth family of complex Hadamard matrices including the Fourier matrix? We address this problem with a power series expansion. Studying all dimensions up to 100 we find that the first order result is misleading…

数学物理 · 物理学 2013-03-15 Nuno Barros e Sa , Ingemar Bengtsson

In this short note we construct codes of length $4n$ with $8n+8$ codewords and minimum distance $2n-2$ whenever $4n+4$ is the order of a Hadamard matrix. This generalises work of Constantine who obtained a similar result in the special case…

组合数学 · 数学 2016-03-15 Padraig Ó Catháin

Say that A is a Hadamard factorization of the identity I_n of size n if the entrywise product of A and the transpose of A is I_n. It can be easily seen that the rank of any Hadamard factorization of the identity must be at least sqrt{n}.…

计算复杂性 · 计算机科学 2013-10-29 Aya Hamed , Troy Lee

A set $S$ of natural numbers is multiplicative Sidon if the products of all pairs in $S$ are distinct. Erd\H{o}s in 1938 studied the maximum size of a multiplicative Sidon subset of $\{1,\ldots, n\}$, which was later determined up to the…

数论 · 数学 2018-08-21 Hong Liu , Péter Pál Pach

Let the sequence $\{t_n\}_{n=1}^{\infty}$ of reals satisfy the condition $ \frac{t_{n+1}}{t_n} \ge 1+ \frac{\gamma}{n^\beta},0\le \beta <1, \gamma >0. $ Then the set $ \{\alpha \in [0,1]: \exists \varkappa > 0 \forall n \in \mathbb{N} ||t_n…

数论 · 数学 2007-10-20 Nikolai G. Moshchevitin

We introduce a new class of complex Hadamard matrices which have not been studied previously. We use these matrices to construct a new infinite family of parity proofs of the Kochen-Specker theorem. We show that the recently discovered…

组合数学 · 数学 2020-03-27 Petr Lisonek

A $\{1,-1\}$-matrix $H$ of order $m$ is a Hadamard matrix if $HH^T=mI_m$, where $T$ is the transposition operator and $I_m$ the identity matrix of order $m$. J. Hadamard published his paper on Hadamard matrices in 1893. Five years later,…

组合数学 · 数学 2024-08-08 Dragomir Z. Djokovic

The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that need to be changed in order to obtain a matrix of rank at most $r$. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit…

数据结构与算法 · 计算机科学 2021-10-13 Bohdan Kivva

We introduce Hadamard matrices whose entries are quaternionic. We then go on to provide classification of quaternionic Hadamard matrices of circulant core of orders 2 through 5. We also introduce quaternionic Hadamard matrices of Butson…

组合数学 · 数学 2022-03-08 Logan M. Higginbotham , Chase T. Worley

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…

组合数学 · 数学 2014-05-19 Ivica Martinjak

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

泛函分析 · 数学 2007-05-23 Stanislaw J. Szarek , Nicole Tomczak-Jaegermann

We provide a counterexample to a conjecture of Hildebrand which states that if $\S$ has positive lower density and is stable i.e. for all $d$, $n$ is in $\mathcal{S}$ if and only if $dn$ is in $\mathcal{S}$ except on a set of density $0$…

组合数学 · 数学 2025-09-26 Redmond McNamara

Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…

组合数学 · 数学 2020-11-16 Antonio Cossidente , Giuseppe Marino , Francesco Pavese

An $n \times n$ matrix with $\pm 1$ entries which acts on $\mathbb{R}^n$ as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices…

概率论 · 数学 2023-03-10 Xiaoyu Dong , Mark Rudelson

Skew Hadamard difference sets are an interesting topic of study for over seventy years. For a long time, it had been conjectured the classical Paley difference sets (the set of nonzero quadratic residues in $\mathbb{F}_q$ where $q \equiv 3…

组合数学 · 数学 2013-05-09 Cunsheng Ding , Alexander Pott , Qi Wang