Search

The smallest integer v>0 for which no skew-Hadamard matrix of order 4v is known is v=69. We show how to construct several such matrices., 3 pages

UID/MAT/00297/2019 UID/MAT/04721/2019 We consider the class (Formula presented.) of symmetric (Formula presented.) -matrices with zero trace and constant row sums k which can be identified with the class of the adjacency matrices of k-regular undirected graphs. In a previous paper, two partial orders, the Bruhat and the Bruhat-graph order, have been introduced in this class. In fact, when k = 1 or k = 2, it was shown that the two orders coincide, while for (Formula presented.) the two orders are distinct. In this paper we give general properties of minimal and maximal matrices for these orders on (Formula presented.) and study the minimal and maximal matrices when k = 1, 2 or 3. publishersversion published

Let $m,n,s,k$ be four integers such that $3\leq s \leq n$, $3\leq k\leq m$ and $ms=nk$. Set $d=\gcd(s,k)$. In this paper we show how one can construct a Heffter array $H(m,n;s,k)$ starting from a square Heffter array $H(nk/d;d)$ whose elements belong to $d$ consecutive diagonals. As an example of application of this method, we prove that there exists an integer $H(m,n;s,k)$ in each of the following cases: $(i)$ $d\equiv 0 \pmod 4$; $(ii)$ $5\leq d\equiv 1 \pmod 4$ and $n k\equiv 3\pmod 4$; $(iii)$ $d\equiv 2 \pmod 4$ and $nk\equiv 0 \pmod 4$; $(iv)$ $d\equiv 3 \pmod 4$ and $n k\equiv 0,3\pmod 4$. The same method can be applied also for signed magic arrays $SMA(m,n;s,k)$ and for magic rectangles $MR(m,n;s,k)$. In fact, we prove that there exists an $SMA(m,n;s,k)$ when $d\geq 2$, and there exists an $MR(m,n;s,k)$ when either $d\geq 2$ is even or $d\geq 3$ and $nk$ are odd. We also provide constructions of integer Heffter arrays and signed magic arrays when $k$ is odd and $s\equiv 0 \pmod 4$.

Our main objective is to show that the computational methods, developed previously to search for difference families in cyclic groups, can be fully extended to the more general case of arbitrary finite abelian groups. In particular the power spectral density test and the method of compression can be used to help the search.

We present a coarse-graining (or model order reduction) procedure for stochastic matrices by clustering. The method is consistent with the natural structure of Markov theory, preserving positivity and mass, and does not rely on any tools from Hilbert space theory. The reconstruction is provided by a generalized Penrose-Moore inverse of the coarse-graining operator incorporating the inhomogeneous invariant measure of the Markov matrix. As we show, the method provides coarse-graining and reconstruction also on the level of tensor spaces, which is consistent with the notion of an incidence matrix and quotient graphs, and, moreover, allows to coarse-grain and reconstruct fluxes. Furthermore, we investigate the connection with functional inequalities and Poincar\'e-type constants., Comment: 17 pages

A Costas array is a permutation array for which the vectors joining pairs of $1$s are all distinct. We propose a new three-dimensional combinatorial object related to Costas arrays: an order $n$ Costas cube is an array $(d_{i,j,k})$ of size $n \times n \times n$ over $\mathbb{Z}_2$ for which each of the three projections of the array onto two dimensions, namely $(\sum_i d_{i,j,k})$ and $(\sum_j d_{i,j,k})$ and $(\sum_k d_{i,j,k})$, is an order $n$ Costas array. We determine all Costas cubes of order at most $29$, showing that Costas cubes exist for all these orders except $18$ and $19$ and that a significant proportion of the Costas arrays of certain orders occur as projections of Costas cubes. We then present constructions for four infinite families of Costas cubes., Comment: 12 pages, 1 figure. Theorem 11 introduces two further infinite families of Costas cubes

The ordering of normal linear experiments with respect to quadratic estimation, introduced by Stępniak in [Ann. Inst. Statist. Math. A 49 (1997), 569-584], is extended here to the experiments involving the nuisance parameters. Typical experiments of this kind are induced by allocations of treatments in the blocks. Our main tool, called quotient of information matrices, may be interesting itself. It is known that any orthogonal allocation of treatments in blocks is optimal with respect to linear estimation of all treatment contrasts. We show that such allocation is, however, not optimal for quadratic estimation.

This work examines the concept of S-permutation matrices, namely $n^2 \times n^2$ permutation matrices containing a single 1 in each canonical $n \times n$ subsquare (block). The article suggests a formula for counting mutually disjoint pairs of $n^2 \times n^2$ S-permutation matrices in the general case by restricting this task to the problem of finding some numerical characteristics of the elements of specially defined for this purpose factor-set of the set of $n \times n$ binary matrices. The paper describe an algorithm that solves the main problem. To do that, every $n\times n$ binary matrix is represented uniquely as a n-tuple of integers., Comment: arXiv admin note: substantial text overlap with arXiv:1501.03395; text overlap with arXiv:1604.02691

Let $v\geq6$ be an integer with $v\equiv2 \pmod 4$. In this paper, we introduce a new partitioning of the set of all $3$-subsets of a $v$-set into some simple trades.

In this work we show that the Bruhat rank of a symmetric (0,1)-matrix of order n with a staircase pattern, total support, and containing In , is at most 2. Several other related questions are also discussed. Some illustrative examples are presented.

We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be no such matrices, besides the usual Hadamard ones. We verify this conjecture in a number of situations, and notably for most of the known examples of real almost Hadamard matrices, and for some of their complex extensions. We discuss as well some potential applications of our conjecture, to the general study of complex Hadamard matrices., Comment: 42 pages

For an integer $n\geq 1$, we display a poset $��_n$ whose maximal chains are in bijection with the $n\times n$ alternating sign matrices. The Hasse diagram $\widehat ��_n$ is obtained from the $n$-cube by adding some edges. We show that the dihedral group $D_{2n}$ acts on $\widehat ��_n$ as a group of automorphisms., 6 pages

In this paper, we study skew-symmetric $2$-$\{v;r,k;\lambda\}$ supplementary difference sets related to a certain class of complex spherical 2-codes. A classification of such supplementary difference sets is complete for $v \le 51$., Comment: 14 pages

An MSTD set is a finite set with more pairwise sums than differences. $(\Upsilon,\Phi)$-ismorphisms are generalizations of Freiman isomorphisms to arbitrary linear forms. These generalized isomorphisms are used to prove that every finite set of real numbers is Freiman isomorphic to a finite set of integers. This implies that there exists no MSTD set $A$ of real numbers with $|A| \leq 7$, and, up to Freiman isomorphism, there exists exactly one MSTD set $A$ of real numbers with $|A| = 8$., Comment: Revise, and expanded; 14 pages

We introduce fusion algebras with not necessarily positive structure constants and without identity element. We prove that they are semisimple when tensored with $\mathbb{C}$ and that their characters satisfy orthogonality relations. Then we define the proper notion of subrings and factor rings for such algebras. For certain algebras $R$ we prove the existence of a ring $R'$ with nonnegative structure constants such that $R$ is a factor ring of $R'$. We give some examples of interesting factor rings of the representation ring of the quantum double of a finite group. Then, we investigate the algebras associated to Hadamard matrices. For an $n\times n$-matrix the corresponding algebra is a factor ring of a subalgebra of $\mathbb{Z}[{(\mathbb{Z}/2\mathbb{Z})}^{n-2}]$., 24 pages

Two-level Cretan matrices are orthogonal matrices with two elements, x and y. At least one element per row and column is 1 and the other element has modulus ≤ 1. These have been studied in the Russian literature for applications in image processing and compression. Cretan matrices have been found by both mathematical and computational methods but this paper concentrates on mathematical solutions for the first time. We give, for the first time, families of Cretan matrices constructed using the incidence matrix of a symmetric balanced incomplete block design and Hadamard related difference sets. Disciplines Engineering | Science and Technology Studies Publication Details Balonin, N. A. & Seberry, J. (2015). Two-level Cretan matrices constructed using SBIBD. Special Matrices, 3 (1), 186-192. This journal article is available at Research Online: http://ro.uow.edu.au/eispapers/5389

\textit{Propus} (which means twins) is a construction method for orthogonal $\pm 1$ matrices based on a variation of the Williamson array called the \textit{propus array} \[ \begin{matrix*}[r] A& B & B & D B& D & -A &-B B& -A & -D & B D& -B & B &-A. \end{matrix*} \] This construction designed to find symmetric Hadamard matrices was originally based on circulant symmetric $\pm 1$ matrices, called \textit{propus matrices}. We also give another construction based on symmetric Williamson-type matrices. We give constructions to find symmetric propus-Hadamard matrices for 57 orders $4n$, $n < 200$ odd. We give variations of the above array to allow for more general matrices than symmetric Williamson propus matrices. One such is the \textit{ Generalized Propus Array (GP)}., 13 pages, 19 figures

A $Cretan(4t+1)$ matrix, of order $4t+1$, is an orthogonal matrix whose elements have moduli $\leq 1$. The only $Cretan(4t+1)$ matrices previously published are for orders 5, 9, 13, 17 and 37. This paper gives infinitely many new $Cretan(4t+1)$ matrices constructed using $regular~Hadamard$ matrices, $SBIBD(4t+1,k,\lambda)$, weighing matrices, generalized Hadamard matrices and the Kronecker product. We introduce an inequality for the radius and give a construction for a Cretan matrix for every order $n \geq 3$., Comment: 16 pages, 7 figures

In this paper we explore the problem of constructing two-level Minimum Generalized Aberration (MGA) orthogonal arrays with strength $t$, $n$ runs and $q>t$ columns, using a method that employs the $J$-characteristics of a two-level design. General results for the construction of MGA orthogonal arrays with $t+1$, $t+2$ and $t+3$ columns are given, while all MGA designs with strength $t\ge 2$, $n \equiv$ 0 mod 4 runs and $q\le 6$ are constructed. Results are also given for two-level orthogonal arrays with $q=7$ factors, but with strength greater than two. Projection properties of the MGA designs that have been identified, are also discussed.

Let n, k, α be integers, n, α>0, p be a prime and q=p α. Consider the complete q-uniform family $$\mathcal{F}\left( {k,q} \right) = \left\{ {K \subseteq \left[ n \right]:\left| K \right| \equiv k(mod q)} \right\}$$

We consider a series of configurations defined by fibers of a given base configuration. We prove that Markov degree of the configurations is bounded from above by the Markov complexity of the base configuration. As important examples of base configurations we consider incidence matrices of graphs and study the maximum Markov degree of configurations defined by fibers of the incidence matrices. In particular we give a proof that the Markov degree for two-way transportation polytopes is three., Comment: 28 pages

The purpose of this paper is to exhibit new infinite families of D-optimal (0, 1)-matrices. We show that Hadamard designs lead to D-optimal matrices of size ( j , mj ) and ( j − 1, mj ), for certain integers j ≡ 3 (mod 4) and all positive integers m . For j a power of a prime and j ≡ 1 (mod 4), supplementary difference sets lead to D-optimal matrices of size ( j , 2mj ) and ( j − 1, 2mj ), for all positive integers m . We also show that for a given j and d sufficiently large, about half of the entries in each column of a D-optimal matrix are ones. This leads to a new relationship between D-optimality for (0, 1)-matrices and for (±1)-matrices. Known results about D-optimal (±1)-matrices are then used to obtain new D-optimal (0, 1)-matrices.

This paper is concerned with (0, 1)-normal matrices. The main objective is to study the structure and the cardinality of the class of non-symmetric irreducible (0, 1)-normal matrices with each row sum equal to 2.

An algorithm for obtaining all n\times n binary matrices having exactly 2 units in every row and every column is described in the paper. After analysing the work of the algorithm a formula for calculating the number of these matrices has been obtained. This formula is known and has been obtained using other methods, which by their nature are purely analytical and not constructive. Thus a new, constructive proof of this known formula has been obtained.

We introduce a canonical form for near-normal sequences NN(n), and using it we enumerate the equivalence classes of such sequences for even n up to 30. These sequences are needed for Yang multiplication in the construction of longer T-sequences from base sequences., Comment: 13 pages, 1 table (over 5 pages long). Minor changes implemented

Strongly quadrangular matrices have been introduced in the study of the combinatorial properties of unitary matrices. It is known that if a (0, 1)-matrix supports a unitary then it is strongly quadrangular. However, the converse is not necessarily true. In this paper, we fully classify strongly quadrangular matrices up to degree 5. We prove that the smallest strongly quadrangular matrices which do not support unitaries have exactly degree 5. Further, we isolate two submatrices not allowing a (0, 1)-matrix to support unitaries., 11 pages, some typos are corrected. To appear in The Electronic journal of Linear Algebra

A k × n Latin rectangle is a k × n matrix with entries from {1,2, …, n} such that no entry occurs more than once in any row or column. Equivalently, it is an ordered set of k disjoint perfect matchings of Kn,n. We prove that the number of k × n Latin rectangles is asymptotically (n!)( n(n−1)⋯(n−k+1) n k n (1− k n ) − n 2 e − k 2 as n → ∞ with k = o(n 6 7 ) . This improves substantially on previous work by Erdős and Kaplansky, Yamamoto, and Stein. We also derive an asymptotic approximation to the generalised menage numbers, and establish a number of results on entries in random Latin rectangles.

We construct several difference families on cyclic groups of orders 47 and 97, and use them to construct skew-Hadamard matrices of orders 188 and 388. Such difference families and matrices are constructed here for the first time. The matrices are constructed by using the Goethals-Seidel array., Comment: 7 pages, no figures, a paragraph added to the introduction, two misprints corrected. To appear in the International Mathematical Forum

A (partial) Latin square is a table of multiplication of a (partial) quasigroup. Multiplication of a (partial) quasigroup may be considered as a set of triples. We give a necessary and sufficient condition for a set of triples to be a quotient of a (partial) latin square.

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 of Tadej and Zyczkowski, who asked whether a real Hadamard matrix can be isolated among complex ones. In particular, we apply our construction to the only (up to equivalence) real Hadamard matrix of order 12 and show that the arising affine family is different from all previously known examples. Second, we recall a well-known construction related to real conference matrices, and show how to introduce an affine parameter in the arising complex Hadamard matrices. This leads to new parametric families of orders 10 and 14. An interesting feature of both of our constructions is that the arising families cannot be obtained via Dita's general method. Our results extend the recent catalogue of complex Hadamard matrices, and may lead to direct applications in quantum-information theory., 16 pages; Final version. Submitted to: European Journal of Combinatorics

In [1] a near 2n-gon \( \mathbb{H}_n, n \geq 0 \), was constructed from the set of 2-factors of the complete graph on 2n+2 vertices. In this paper, we determine all near 2n-gons, \( n \geq 1 \), having \( \mathbb{H}_n - 1 \) as a big geodetically closed sub near 2(n-1)-gon under the additional assumption that every two points at distance 2 have at least two common neighbours. We will prove that such a near 2n-gon is either isomorphic to \( \mathbb{H}_n \) or to a direct product of \( \mathbb{H}_n - 1 \) with a line. As a corollary of that, the near polygon \( \mathbb{H}_n \) is characterized by means of the local space at one point.

We study birational transformations of the projective space originating from lattice statistical mechanics, specifically from various chiral Potts models. Associating these models to \emph{stable patterns} and \emph{signed-patterns}, we give general results which allow us to find \emph{all} chiral $q$-state spin-edge Potts models when the number of states $q$ is a prime or the square of a prime, as well as several $q$-dependent family of models. We also prove the absence of monocolor stable signed-pattern with more than four states. This demonstrates a conjecture about cyclic Hadamard matrices in a particular case. The birational transformations associated to these lattice spin-edge models show complexity reduction. In particular we recover a one-parameter family of integrable transformations, for which we give a matrix representation, Comment: 22 pages 0 figure The paper has been reorganized, splitting the results into two sections : results pertaining to Physics and results pertaining to Mathematics

Let $P(d)$ be the probability that a random 0/1-matrix of size $d \times d$ is singular, and let $E(d)$ be the expected number of 0/1-vectors in the linear subspace spanned by d-1 random independent 0/1-vectors. (So $E(d)$ is the expected number of cube vertices on a random affine hyperplane spanned by vertices of the cube.) We prove that bounds on $P(d)$ are equivalent to bounds on $E(d)$: \[ P(d) = (2^{-d} E(d) + \frac{d^2}{2^{d+1}}) (1 + o(1)). \] We also report about computational experiments pertaining to these numbers., Comment: 9 pages

For BIB designs $N_i$ and their complements $N_i^\ast (i = 1,2, \cdots, n)$, Kageyama (1972) gave necessary and sufficient conditions for a PBIB design $N = N_1 \otimes N_2 + N_1^\ast \otimes N_2^\ast$ with at most three associate classes having the rectangular association scheme to be reducible to a PBIB design with only two distinct associate classes having the $L_2$ association scheme. In this paper similar results for the PBIB design $N_1 \otimes N_2 \otimes \cdots \otimes N_n + N_1^\ast \otimes N_2^\ast \otimes \cdots \otimes N_n^\ast$, which is in a sense a generalization of the Kronecker products of the above type, are described.

The purpose of this paper is to prove (1) if q ≡ 1 (mod 8) is a prime power and there exists a Hadamard matrix of order (q − 1)/2, then we can construct a Hadamard matrix of order 4q, (2) if q ≡ 5 (mod 8) is a prime power and there exists a skew-Hadamard matrix of order (q + 3)/2, then we can construct a Hadamard matrix of order 4(q + 2), (3) if q ≡ 1 (mod 8) is a prime power and there exists a symmetric C-matrix of order (q + 3)/2, then we can construct a Hadamard matrix of order 4(q + 2).We have 36, 36 and 8 new orders 4n for n ≤ 10000, of Hadamard matrices from the first, the second and third theorem respectively, which were known to the list of Geramita and Seberry. We prove these theorems by using an adaptation of generalized quaternion type array and relative Gauss sums.

For the problem of weighing $k$ objects in $n$ weighings $(n \geq k)$ on a chemical balance, and certain related problems, we obtain new results and list the designs which have been proved $D$-optimum up to this time. While some of these optimality results have been known for some time, others are fairly recent. In particular, in the most difficult case $n \equiv 3(\operatorname{mod} 4)$ we prove a result characterizing optimum designs when $n \geq 2k - 5$. In addition, by a combination of theoretical bounds and computer search we find previously unknown optimum designs in the cases $(k, n) = (9, 11), (11, 15)$, and (12, 15), and establish the optimality of Mitchell's (10, 11) design. In some cases the optimum $X'X$ is not unique. Thus, we find two optimum $X'X$'s for the (6, 7), (8, 11), (10, 11), and (10, 15) cases. As a consequence of these results and other constructions, $D$-optimum designs are now known in all cases $k \leq 12$ (for all $n \geq k$), and in many other cases. Essentially complete listings for all $n \geq k$ had been given previously only for $k \leq 5$.