Related papers: Cyclic p-roots of prime lengths p and related comp…

When using a Groebner basis to solve the highly symmetric system of algebraic equations defining the cyclic p-roots, one has the feeling that much of the advantage of computerized symbolic algebra over hand calculation is lost through the…

We use modular symmetric designs to study the existence of Hadamard matrices modulo certain primes. We solve the $7$-modular and $11$-modular versions of the Hadamard conjecture for all but a finite number of cases. In doing so, we state a…

Let $f(x) \in \mathbb{F}_p[x]$, and define the orbit of $x\in \mathbb{F}_p$ under the iteration of $f$ to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a $k$-cycle if it is periodic of…

Let p denote an odd prime. For all p-admissible conductors c over a quadratic number field \(K=\mathbb{Q}(\sqrt{d})\), p-ring spaces \(V_p(c)\) modulo c are introduced by defining a morphism \(\psi:\,f\mapsto V_p(f)\) from the divisor…

For each odd prime $p$, let $\zeta_p$ denote a primitive $p$-th root of unity. In this paper, we study the determinants of some matrices with cyclotomic unit entries. For instance, we show that when $p\equiv 3\pmod4$ and $p>3$ the…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…

We classify all the cocyclic Butson Hadamard matrices $\mathrm{BH}(n,p)$ of order $n$ over the $p$th roots of unity for an odd prime $p$ and $np\leq 100$. That is, we compile a list of matrices such that any cocyclic $\mathrm{BH}(n,p)$ for…

Milliet asks the following question: given two prime numbers $p\neq q$, is there a division algebra of characteristic $p$ which is of dp-rank $q^2$ and of dimension $q^2$ over its center? We answer in the affirmative. We also give an…

Let $p$ be a prime number. The $p$-power cyclic resultant of a polynomial is the determinant of the Sylvester matrix of $t^{p^n}-1$ and the polynomial. It is known that the sequence of $p$-power cyclic resultants and its non-$p$-parts…

For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…

The Hilbert class polynomial $H_{\mathcal{O}}(x)\in \mathbb{Z}[x]$ attached to an order $\mathcal{O}$ in an imaginary quadratic field $K$ is the monic polynomial whose roots are precisely the distinct $j$-invariants of elliptic curves over…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

In this paper we modify a fundamental block construction of Kharaghani and Seberry and show how to use certain circulant $\{-1,1\}$-matrices of odd order $p$ to construct a complex Hadamard matrix of order $2p$. In particular, for $p=47$ we…

We construct a new infinite family of pairs of imaginary cyclic fields of degree $(p-1)/2$ explicitly with both class numbers divisible by a given prime number $p$. For the proof, we use the fundamental unit of $\mathbb Q(\sqrt{p})$,…

The collection of cyclic Hadamard matrices {H = (a_{i - j}) : 0 <= i, j < n, and a_i = -1, 1} of order n is characterized by the orthogonality relation HH^T = nI. Only two of such matrices are currently known. It will be shown that this…

This paper is continuation of the paper "Primitive roots in quadratic field". We consider an analogue of Artin's primitive root conjecture for algebraic numbers which is not a unit in real quadratic fields. Given such an algebraic number,…

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

Due to the wide applications in consumer electronics, data storage systems and communication systems, cyclic codes have been an interesting research topic in coding theory. In this paper, let $p$ be a prime with $p\ge 7$. We determine the…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…