Mappings of Butson-type Hadamard matrices

A $\mathrm{BH}(q,n)$ Butson-type Hadamard matrix $H$ is an $n\times n$ matrix over the complex $q$th roots of unity that fulfils $H{H}^1=n{I}_n$. It is well known that a $\mathrm{BH}(4,n)$ matrix can be used to construct a $\mathrm{BH}(2,2n)$ matrix, that is, a real Hadamard matrix. This method is here generalised to construct a $\mathrm{BH}(q,pn)$ matrix from a $\mathrm{BH}(pq,n)$ matrix, where $q$ has at most two distinct prime divisors, one of them being $p$. Moreover, an algorithm for finding the domain of the mapping from its codomain in the case $p=q=2$ is developed and used to classify the $\mathrm{BH}(4,16)$ matrices from a classification of the $\mathrm{BH}(2,32)$ matrices.     

Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings

Let $R$ be the Galois ring $GR(p^k,s)$ of characteristic $p^k$ and cardinality $p^{sk}$. Firstly, we give all primitive idempotent generators of irreducible cyclic codes of length $n$ over $R$, and a $p$-adic integer ring with $gcd(p,n)=1$. Secondly, we obtain all primitive idempotents of all irreducible cyclic codes of length $r{l}^m$ over $R$, where $r,l,$ and $t$ are three primes with $2?l$, $r|(q^t?1)$, $l^v\parallel (q^t?1)$ and $gcd(rl,q(q?1))=1$. Finally, as applications, weight distributions of all irreducible cyclic codes for $t=2$ and generator polynomials of self-dual cyclic codes of length $l^m$ and $r{l}^m$ over $R$ are given.     

Powerful numbers in (1ℓ + qℓ)(2ℓ + qℓ)⋯(nℓ + qℓ)

Let q be a positive integer. Recently, Niu and Liu proved that, if $n\ge \max ?\{q,1198?q\}$, then the product $(1^3+q^3)(2^3+q^3)?(n^3+q^3)$ is not a powerful number. In this note, we prove (1) that, for any odd prime power ? and $n\ge \max ?\{q,11?q\}$, the product $(1^{?}+q^{?})(2^{?}+q^{?})?(n^{?}+q^{?})$ is not a powerful number, and (2) that, for any positive odd integer ?, there exists an integer $N_{q,?}$ such that, for any positive integer $n\ge N_{q,?}$, the product $(1^{?}+q^{?})(2^{?}+q^{?})?(n^{?}+q^{?})$ is not a powerful number.     

Construction of quasi-cyclic self-dual codes

There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field ${\mathbb{F}}_q$ and linear codes over a ring $R={\mathbb{F}}_q[Y]/(Y^m?1)$. Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field ${\mathbb{F}}_q$ can be obtained by the building-up construction, provided that $\mathrm{char}({\mathbb{F}}_q)=2$ or $q\equiv 1(\mathrm{mod}4)$, m is a prime p, and q is a primitive element of ${\mathbb{F}}_p$. We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths $30,36,42,48$ (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When $m=5$, we obtain a new 8-quasi-cyclic self-dual $[40,20,12]$ code over ${\mathbb{F}}_3$ and a new 6-quasi-cyclic self-dual $[30,15,10]$ code over ${\mathbb{F}}_4$. When $m=7$, we find a new 4-quasi-cyclic self-dual $[28,14,9]$ code over ${\mathbb{F}}_4$ and a new 6-quasi-cyclic self-dual $[42,21,12]$ code over ${\mathbb{F}}_4$.     

Proof of a conjecture on monomial graphs

Let e be a positive integer, p be an odd prime, $q=p^e$, and ${\mathbb{F}}_q$ be the finite field of q elements. Let $f,g\in {\mathbb{F}}_q[X,Y]$. The graph $G_q(f,g)$ is a bipartite graph with vertex partitions $P={\mathbb{F}}_q^3$ and $L={\mathbb{F}}_q^3$, and edges defined as follows: a vertex $(p)=(p_1,p_2,p_3)\in P$ is adjacent to a vertex $[l]=[l_1,l_2,l_3]\in L$ if and only if $p_2+l_2=f(p_1,l_1)$ and $p_3+l_3=g(p_1,l_1)$. If $f=XY$ and $g=X{Y}^2$, the graph $G_q(XY,X{Y}^2)$ contains no cycles of length less than eight and is edge-transitive. Motivated by certain questions in extremal graph theory and finite geometry, people search for examples of graphs $G_q(f,g)$ containing no cycles of length less than eight and not isomorphic to the graph $G_q(XY,X{Y}^2)$, even without requiring them to be edge-transitive. So far, no such graphs $G_q(f,g)$ have been found. It was conjectured that if both f and g are monomials, then no such graphs exist. In this paper we prove the conjecture.     

Classification of some 3-subgroups of the finite groups of Lie type E6

We consider the finite exceptional group of Lie type $G=E_6^{\epsilon }(q)$ (universal version) with $3|q?\epsilon$, where $E_6^{+1}(q)=E_6(q)$ and $E_6^{?1}(q){=}^2{E}_6(q)$. We classify, up to conjugacy, all maximal-proper 3-local subgroups of G, that is, all 3-local $M<G$ which are maximal with respect to inclusion among all proper subgroups of G which are 3-local. To this end, we also determine, up to conjugacy, all elementary-abelian 3-subgroups containing $Z(G)$, all extraspecial subgroups containing $Z(G)$, and all cyclic groups of order 9 containing $Z(G)$. These classifications are an important first step towards a classification of the 3-radical subgroups of G, which play a crucial role in many open conjectures in modular representation theory.     

The adversary degree-associated reconstruction number of double-brooms

A vertex-deleted subgraph of a graph G is a card. A dacard specifies the degree of the deleted vertex along with the card. The adversary degree-associated reconstruction number $\mathrm{adrn}(G)$ is the least k such that every set of k dacards determines G. We determine $\mathrm{adrn}(D_{m,n,p})$, where the double-broom $D_{m,n,p}$ with $p\ge 2$ is the tree with $m+n+p$ vertices obtained from a path with p vertices by appending m leaves at one end and n leaves at the other end. We determine $\mathrm{adrn}(D_{m,n,p})$ for all $m,n,p$. For $2\le m\le n$, usually $\mathrm{adrn}(D_{m,n,p})=m+2$, except $\mathrm{adrn}(D_{m,m+1,p})=m+1$ and $\mathrm{adrn}(D_{m,m+2,p})=m+3$. There are exceptions when $(m,n)=(2,3)$ or $p=4$. For $m=1$ the usual value is 4, with exceptions when $p\in \{2,3\}$ or $n=2$.     

Star-critical Ramsey numbers for large generalized fans and books

In this paper, we show that for any fixed integers $m\ge 2$ and $t\ge 2$, the star-critical Ramsey number $r_1(K_1+n{K}_t,K_{m+1})=(m?1)tn+t$ for all sufficiently large $n$. Furthermore, for any fixed integers $p\ge 2$ and $m\ge 2$, $r_1(K_p+n{K}_1,K_{m+1})=(m?1+o\left(1\right))n$ as $n\to \infty$.     

Transcendence degree one function fields over a finite field with many automorphisms

Let $\mathbb{K}$ be the algebraic closure of a finite field ${\mathbb{F}}_q$ of odd characteristic p. For a positive integer m prime to p, let $F=\mathbb{K}(x,y)$ be the transcendence degree 1 function field defined by $y^q+y=x^m+x^{?m}$. Let $t=x^{m(q?1)}$ and $H=\mathbb{K}(t)$. The extension $F|H$ is a non-Galois extension. Let K be the Galois closure of F with respect to H. By Stichtenoth [20], K has genus $\mathfrak{g}(K)=(qm?1)(q?1)$, p-rank (Hasse–Witt invariant) $\gamma (K)={(q?1)}^2$ and a $\mathbb{K}$-automorphism group of order at least $2q^{2}m(q?1)$. In this paper we prove that this subgroup is the full $\mathbb{K}$-automorphism group of K; more precisely ${\text{Aut}}_{\mathbb{K}}(K)=\mathrm{\Delta }?D$ where Δ is an elementary abelian p-group of order $q^2$ and D has an index 2 cyclic subgroup of order $m(q?1)$. In particular, $\sqrt{m}|{\text{Aut}}_{\mathbb{K}}(K)|>\mathfrak{g}{(K)}^{3/2}$, and if K is ordinary (i.e. $\mathfrak{g}(K)=\gamma (K)$) then $|{\text{Aut}}_{\mathbb{K}}(K)|>{\mathfrak{g}}^{3/2}$. On the other hand, if G is a solvable subgroup of the $\mathbb{K}$-automorphism group of an ordinary, transcendence degree 1 function field L of genus $\mathfrak{g}(L)\ge 2$ defined over $\mathbb{K}$, then $|{\text{Aut}}_{\mathbb{K}}(K)|\le 34{(\mathfrak{g}(L)+1)}^{3/2}<68\sqrt{2}\mathfrak{g}{(L)}^{3/2}$; see [15]. This shows that K hits this bound up to the constant $68\sqrt{2}$.Since ${\text{Aut}}_{\mathbb{K}}(K)$ has several subgroups, the fixed subfield $F^N$ of such a subgroup N may happen to have many automorphisms provided that the normalizer of N in ${\text{Aut}}_{\mathbb{K}}(K)$ is large enough. This possibility is worked out for subgroups of Δ.