Related papers: A formulation of a (q+1,8)-cage

In this paper we are interested in the {\it{Cage Problem}} that consists in constructing regular graphs of given girth $g$ and minimum order. We focus on girth $g=5$, where cages are known only for degrees $k \le 7$. We construct regular…

A mixed regular graph is a graph where every vertex has $z$ incoming arcs, $z$ outgoing arcs, and $r$ edges; furthermore, if it has girth $g$, we say that the graph is a \emph{$[z,r;g]$-mixed graph}. A \emph{$[z,r;g]$-mixed cage} is a…

We introduce the concept of weight graph for the weight system $P\frak{g}(T)$ of a finite dimensional nilpotent Lie algebra $\frak{g}$ and analyze the necessary conditions for a $(p,q)$-graph to be a weight graph for some $\frak{g}$.

For prime powers q we use "strongly orthogonal" linear Sudoku solutions of order q^2 to construct ordered orthogonal arrays of type OOA (4,s,2,q), and for each q we present a range of values of s for which these constructions are valid.

We construct $(2,3)$-generators for the finite $8$-dimensional orthogonal groups, proving the following results: the groups $\Omega_8^+(q)$ and $P\Omega_8^+(q)$ are $(2,3)$-generated if and only if $q\geq 4$; the groups $\Omega_8^-(q)$ and…

There is a Paley graph for each prime power $q$ such that $q\equiv 1\pmod 4$. The vertex set is the field $\mathbb Fq$ and two vertices $x$ and $y$ are joined by an edge if and only if $x-y$ is a nonzero square of $\mathbb Fq$. We compute…

Let $\Bbb Z$ be the set of integers, and let $p$ be a prime of the form $4k+1$. Suppose $q\in\Bbb Z$, $2\nmid q$, $p\nmid q$, $p=c^2+d^2$, $c,d\in\Bbb Z$ and $c\equiv 1\pmod 4$. In this paper we continue to discuss congruences for…

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

Let $\{E_{(p,q)}\}$ be a family of elliptic curves over a rational field such that we have $E_{(p,q)} : y^2 = x^3 - p^2x + q^2$, where $p$ and $q$ are prime numbers greater than five. Earlier work showed that the elliptic curve $E_{(p,q)}$…

We introduce the notion of a $[z, r; g]$-mixed cage. A $[z, r; g]$-mixed cage is a mixed graph $G$, $z$-regular by arcs, $r$-regular by edges, with girth $g$ and minimum order. In this paper we prove the existence of $[z, r ;g]$-mixed cages…

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

In this short note, we provide a new infinite family of $K_{2, t+1}$-free graphs for each prime power $t$. Using these graphs, we show that it is possible to partition the edges of $K_n$ into parts, such that each part is isomorphic to our…

Let $G$ be an almost simple group with socle $A_n$, the alternating group of degree $n$. We prove that there is a unit of order $pq$ in the integral group ring of $G$ if and only if there is an element of that order in $G$ provided $p$ and…

Over the past few years, the codes $\mathcal{C}_{n-1}(n,q)$ arising from the incidence of points and hyperplanes in the projective space $\text{PG}(n,q)$ attracted a lot of attention. In particular, small weight codewords of…

We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

Let $q, n, m \in \mathbb{N}$ such that $q$ is a prime power, $m \geq 3$ and $a \in \mathbb{F}$. We establish a sufficient condition for the existence of a primitive normal pair ($\alpha$, $f(\alpha)$) in $\mathbb{F}_{q^m}$ over…

The strong fractional choice number of a graph $G$ is the infimum of those real numbers $r$ such that $G$ is $(\lceil rm \rceil, m)$-choosable for every positive integer $m$. The strong fractional choice number of a family ${\cal G}$ of…

We consider a special class of generalized Paley graphs over finite fields, namely the Cayley graphs with vertex set $\mathbb{F}_{q^m}$ and connection set the nonzero $(q^\ell+1)$-th powers in $\mathbb{F}_{q^m}$, as well as their…

Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove…