We consider the regular subgroups of the automorphism group of the linear Hadamard code. These subgroups correspond to the regular subgroups of $GA(r,2)$, w.t.r action on the vectors of $F_2^{r}$, where $n=2^r-1 $ is the length of the Hamadard code. We show that the dihedral group $D_{2^{r-1}}$ is a regular subgroup of $GA(r,2)$ only when $r=3$. Following the approach of \cite{M} we study the regular subgroups of the Hamming code obtained from the regular subgroups of the automorphism group of the Hadamard code of length 15.
A $Z_2Z_4$-linear Hadamard code of length $α+2β=2^t$ is a binary Hadamard code which is the Gray map image of a $Z_2Z_4$-additive code with $α$ binary coordinates and $β$ quaternary coordinates. It is known that there are exactly $[(t-1)/2]$ and $[t/2]$ nonequivalent $Z_2Z_4$-linear Hadamard codes of length $2^t$, with $α=0$ and $α\not=0$, respectively, for all $t\geq 3$. In this paper, it is shown that each $Z_2Z_4$-linear Hadamard code with $α=0$ is equivalent to a $Z_2Z_4$-linear Hadamard code with $α\not=0$; so there are only $[t/2]$ nonequivalent $Z_2Z_4$-linear Hadamard codes of length $…
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 those structures that admit an automorphism of order 3. Consequently, there are at least 272116 Hadamard 3-designs with 36 points and 70 lines. We found that all Hadamard matrices constructed here are equivalent to a regular Hadamard matrix. This fact contributes to the conjecture that Hadamard matrices of order 36, and possibly those of order $4m^2$, are r…
Heilbronn Institute for Mathematical Research（海布龙数学研究所）；University of Bristol（布里斯托大学）；Worcester Polytechnic Institute（伍斯特理工学院）；University of Western Australia（西澳大学）
We give a new construction of the outer automorphism of the symmetric group on six points. Our construction features a complex Hadamard matrix of order six containing third roots of unity and the algebra of split quaternions over the real numbers.
It is proved that a code $L(q)$ which is monomially equivalent to the Pless symmetry code $C(q)$ of length $2q+2$ contains the (0,1)-incidence matrix of a Hadamard 3-$(2q+2,q+1,(q-1)/2)$ design $D(q)$ associated with a Paley-Hadamard matrix of type II. Similarly, any ternary extended quadratic residue code contains the incidence matrix of a Hadamard 3-design associated with a Paley-Hadamard matrix of type I. If $q=5, 11, 17, 23$, then the full permutation automorphism group of $L(q)$ coincides with the full automorphism group of $D(q)$, and a similar result holds for the ternary extended quadr…
We give a new construction of difference families generalizing Szekeres's difference families \cite{Sze}. As an immediate consequence, we obtain some new examples of difference families with several blocks in multiplicative subgroups of finite fields. We also prove that there exists an infinite family of divisible difference families with two blocks in a unit subgroup of the Galois ring GR(4,n). Furthermore, we obtain a new construction method of symmetric Hadamard matrices by using divisible difference families and a new array.
Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved when $|G|$ is even and $(k,|G|)=1$.
It has been shown that there is a Hamilton cycle in every connected Cayley graph on each group G whose commutator subgroup is cyclic of prime-power order. This paper considers connected, vertex-transitive graphs X of order at least 3 where the automorphism group of X contains a transitive subgroup G whose commutator subgroup is cyclic of prime-power order. We show that of these graphs, only the Petersen graph is not hamiltonian.
We discuss the set of subgroups of the automorphism group of a full shift, and submonoids of its endomorphism monoid. We prove closure under direct products in the monoid case, and free products in the group case. We also show that the automorphism group of a full shift embeds in that of an uncountable sofic shift. Some undecidability results are obtained as corollaries.
We classify binary completely regular codes of length $m$ with minimum distance $δ$ for $(m,δ)=(12,6)$ and $(11,5)$. We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard codes. We prove that the automorphism groups of these Hadamard codes, modulo the kernel of a particular action, are isomorphic to certain Mathieu groups, from which we prove that completely regular codes with these parameters are necessarily completely transitive.
Let $G$ be a simple algebraic group of adjoint type over the field $\mathbb{C}$ of complex numbers, $B$ be a Borel subgroup of $G$ containing a maximal torus $T$ of $G.$ Let $w$ be an element of the Weyl group $W$ and $X(w)$ be the Schubert variety in $G/B$ corresponding to $w$. In this article we show that given any parabolic subgroup $P$ of $G$ containing $B$ properly, there is an element $w\in W$ such that $P$ is the connected component, containing the identity element of the group of all algebraic automorphisms of $X(w).$
A countable poset is ultrahomogeneous if every isomorphism between its finite subposets can be extended to an automorphism. The groups $\operatorname{Aut}(A)$ of such posets $A$ have a natural topology in which $\operatorname{Aut}(A)$ are Polish topological groups. We consider the problem whether $\operatorname{Aut}(A)$ contains a dense free subgroup of two generators. We show that if $A$ is ultrahomogeneous, then $\operatorname{Aut}(A)$ contains such subgroup. Moreover, we characterize whose countable ultrahomogeneous posets $A$ such that for each natural $m$, the set of all cyclically dense …
The quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was hoped that similar approach may be useful to solve the other combinatorial problems. One such problem is the graph isomorphism problem which has survived decades of efforts using the hidden subgroup approach. This paper provides a systematic approach to create arbitrarily large classes of classically efficiently solvable graph automorphism problems or easy graph automorphism problems for which hidden subgroup approac…
A skew Hadamard difference set (SHDS) is a difference set that satisfies the skew condition. It is known that if a group G admits a skew hadamard difference set, then G is a p-group with order congruent to 3 modulo 4. We will generalize skew Hadamard difference sets to Generalized Skew Hadamard Difference Sets (GSHDS) to cover the case when p is congruent to 1 module 4, and we will extend all known results that yield necessary existence conditions of skew Hadamard difference sets to our generalization, including the known exponent bounds. We will also show a set of necessary existence conditio…
The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem turned out to be hard, and so far it has been settled only for a few special classes of permutation groups. The problem have been solved, in particular, for the class of primitive permutation groups, using the classification of finite simple groups and other deep results of permutation group theory. In this paper we show that, if $G$ is a finite simple primitive permutation group other then the alternating group $A_n$…
