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

A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…

All generalized Hadamard matrices of order 18 over a group of order 3, H(6,3), are enumerated in two different ways: once, as class regular symmetric (6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of…

We consider several related problems of estimating the 'sparsity' or number of nonzero elements $d$ in a length $n$ vector $\mathbf{x}$ by observing only $\mathbf{b} = M \odot \mathbf{x}$, where $M$ is a predesigned test matrix independent…

Although many authors have considered how many ternary comparisons it takes to sort a multiset $S$ of size $n$, the best known upper and lower bounds still differ by a term linear in $n$. In this paper we restrict our attention to online…

Let $\mathscr{S}$ be the class of all structures whose growth rate on orbits of subsets of size $n$ is not faster than $\frac{2^n}{p(n)}$ for any polynomial $p$. In this article we give a complete classification of all structures in…

Let $q$ be a prime power of the form $q=12c^2+4c+3$ with $c$ an arbitrary integer. In this paper we construct a difference family with parameters $(2q^2;q^2,q^2,q^2,q^2-1;2q^2-2)$ in ${\mathbb Z}_2\times ({\mathbb F}_{q^2},+)$. As a…

We study $m \times n$ matrices whose columns are of the form \[\{(a_{1j},\ldots, a_{nj}): \quad a_{1j} = \lambda_j,\ a_{ij} = \pm\lambda_j\ , \ \lambda_j >0 ,\ j=1,2,\ldots,n\}.\] We explicitly construct for all $a = (a_1,\ldots,…

We present a new method for constructing affine families of complex Hadamard matrices in every even dimension. This method has an intersection with the Di\c{t}\u{a} construction and it generalizes the Sz\"oll\H{o}si's method. We reproduce…

We study the problem of extending any order-preserving Lipschitz function that maps a subset of a partially ordered Hilbert space X into a Hadamard poset Y without increasing its Lipschitz constant and preserving its monotonicity. This sort…

Many problems in combinatorial linear algebra require upper bounds on the number of solutions to an underdetermined system of linear equations $Ax = b$, where the coordinates of the vector $x$ are restricted to take values in some small…

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

The $N\times N$ complex Hadamard matrices form a real algebraic manifold $C_N$. The singularity at a point $H\in C_N$ is described by a filtration of cones $T^\times_HC_N\subset T^\circ_HC_N\subset T_HC_N\subset\widetilde{T}_HC_N$, coming…

In this paper Butson-type complex Hadamard matrices $\mathrm{BH}(n,q)$ of order $n$ and complexity $q$ are classified for small parameters by computer-aided methods. Our main results include the enumeration of $\mathrm{BH}(21,3)$,…

Two matrices with elements taken from the set {-1,1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is…

Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…

We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

This paper introduces a new problem concerning additive properties of convex sets. Let $S= \{s_1 < \dots <s_n \}$ be a set of real numbers and let $D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}$. We expect that $D_i(S)$ is large, with respect to…

The optimal branch number of MDS matrices has established their importance in designing diffusion layers for various block ciphers and hash functions. As a result, numerous matrix structures, including Hadamard and circulant matrices, have…

Hadamard's maximal determinant problem consists in finding the maximal value of the determinant of a square $n\times n$ matrix whose entries are plus or minus ones. This is a difficult mathematical problem which is not yet solved. In the…