Related papers: Paley type group schemes from cyclotomic classes a…
We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…
A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of a group $G$ such that $|G| = v$, $|D| = k$, and every nonidentity element $x$ of $G$ can be written in either $\lambda$ or $\mu$ different ways as a product $gh^{-1}$,…
Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the…
The generalised Paley graphs are, as their name suggests, a generalisation of the Paley graphs, first defined by Paley in 1933 (see \cite{Paley}). They arise as the relation graphs of symmetric cyclotomic association schemes. However, their…
Davis and Jedwab (1997) established a great construction theory unifying many previously known constructions of difference sets, relative difference sets and divisible difference sets. They introduced the concept of building blocks, which…
Partial difference sets with parameters $(v,k,\lambda,\mu)=(v, (v-1)/2, (v-5)/4, (v-1)/4)$ are called Paley type partial difference sets. In this note we prove that if there exists a Paley type partial difference set in an abelian group $G$…
In this paper we improve our previous results on classification of groups of points on abelian varieties over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $k$-isogeny class.
In this paper we provide an algorithm to classify groups of points on abelian threefolds over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $\mathbb{F}_q$-isogeny class. This work…
The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os,…
In this paper we prove that if there is a regular Paley type partial difference set in an Abelian group $G$ of order $v$, where $v=p_1^{2k_1}p_2^{2k_2}\cdots p_n^{2k_n}$, $n\ge 2$, $p_1$, $p_2$, $\cdots$, $p_n$ are distinct odd prime…
Algebraic methods are used to construct families of unramified abelian extensions of some families of number fields with specified Galois groups.
Paley graphs and Paley sum graphs are classical examples of quasi-random graphs. In this paper, we provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum…
It is proved that with finitely many possible exceptions, each cyclotomic scheme over finite field is determined up to isomorphism by the tensor of 2-dimensional intersection numbers; for infinitely many schemes, this result cannot be…
The main result is a Paley's theory for lacunary Fourier series using semigroup-BMO and $H^1$ spaces. This interpretation allows an extension of Paley's theory to general discrete groups, complementing the work of Rudin for abelian groups…
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…
In this paper, we classify the possible group structures on the set of $R$-valued points of an abelian variety, where $R$ is any real closed field. We make use of a family of abelian varieties that, in effect, allows one to quantify over…
Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group $G$ are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct…