Searcharxiv⌕ Search

arXiv subjects

Luis H. Gallardo

Publications and source records attributed to Luis H. Gallardo.

23 records · Page 2Linked to original sources

If $p^a \vert \vert n$ where $n >4$ is the order of a Circulant Hadamard matrix, then the order of $p$ modulo $n/p^a$ is odd

We proved recently (see \cite{lhgarasu}) the result on the title for odd prime divisors of such an $n.$ The result implies for many $n's$, more precisely, for an infinity of $n$'s with an arbitrary fixed number of prime divisors, the inexistence of circulant Hadamard matrices, and the inexistence of Barker sequences of length $n >13$. The proof used a result of Arasu. It turns out that there is another, shorter proof, of the more general result that includes the prime $p=2.$ This new proof is based on a result of Brock (see \cite[Theorem 3.1]{brock}), and besides that, requires just the definition of the Fourier transform. I noticed Brock's result in a preprint (see \cite{winterhofetal}) of Winterhof et al. where it is used to study the inexistence of related Butson-Hadamard matrices.

math.NT↗

On splitting perfect polynomials over $\mathbb{F}_{p^2}$

We study some properties of the exponents of the terms appearing in the splitting perfect polynomials over $\mathbb{F}_{p^2}$, where $p$ is a prime number. This generalizes the work of Beard et al. over $\mathbb{F}_p$. Corrected paper. Older Lemmas 2.17 to 2.20 in published version required a fixing done herein.

math.NT↗

Even perfect polynomials over $F_2$ with four prime factors

A perfect polynomial over the binary field $\F_2$ is a polynomial $A \in \F_2[x]$ that equals the sum of all its divisors. If $\gcd(A,x^2-x) \neq 1$ then we call $A$ even. The list of all even perfect polynomials over $\F_2$ with at most 3 prime factors in known. The object of this paper is to give the list of all even perfect polynomials over $\F_2$ with four prime factors. These are all the known perfect polynomials with four prime factors over $\F_2$.

math.NT↗