Non-Wieferich primes under the abc conjecture

Assuming the abc conjecture, Silverman proved that, for any given positive integer $a?2$, there are $?\log ?x$ primes $p?x$ such that $a^{p?1}?1(\mathrm{mod}{p}^2)$. In this paper, we show that, for any given integers $a?2$ and $k?2$, there still are $?\log ?x$ primes $p?x$ satisfying $a^{p?1}?1(\mathrm{mod}{p}^2)$ and $p\equiv 1(\mathrm{mod}k)$, under the assumption of the abc conjecture. This improves a recent result of Chen and Ding.     

Jacobsthal sums and permutations of biquadratic residues

Let $p\equiv 1(\mathrm{mod}4)$ be a prime. In this paper, with the help of Jacobsthal sums over finite fields, we study some permutation problems involving biquadratic residues modulo p.     

Generalized rainbow Turán numbers of odd cycles

Given graphs F and H, the generalized rainbow Turán number $\mathrm{ex}(n,F,\mathrm{rainbow-}H)$ is the maximum number of copies of F in an n-vertex graph with a proper edge-coloring that contains no rainbow copy of H. B. Janzer determined the order of magnitude of $\mathrm{ex}(n,C_s,\mathrm{rainbow-}{C}_t)$ for all $s\ge 4$ and $t\ge 3$, and a recent result of O. Janzer implied that $\mathrm{ex}(n,C_3,\mathrm{rainbow-}{C}_{2k})=O(n^{1+1/k})$. We prove the corresponding upper bound for the remaining cases, showing that $\mathrm{ex}(n,C_3,\mathrm{rainbow-}{C}_{2k+1})=O(n^{1+1/k})$. This matches the known lower bound for k even and is conjectured to be tight for k odd.     

The spectrum of resolvable holey Mendelsohn triple systems and holey Mendelsohn frames with block size three

A holey Mendelsohn triple system (HMTS) is a decomposition of a complete multipartite directed graph into directed cycles of length 3. If the directed cycles of length 3 can be partitioned into parallel classes, then the HMTS is called an RHMTS. Bennett, Wei and Zhu [J. Combin. Des., 1997] showed that an RHMTS of type $g^n$ exists when $gn\equiv 0(\mathrm{mod}3)$ and $(g,n)\ne (1,6)$ with some possible exceptions. In this paper, motivated by the application in constructing RHMTSs, we investigate the constructions of holey Mendelsohn frames. We prove that a 3-MHF of type $(n,h^t)$ exists if and only if $n\ge 3$, $t\ge 4$ and $nh(t-1)\equiv 0(\mathrm{mod}3)$, and then determine that the necessary condition for the existence of an RHMTS of type $g^n$, namely, $gn\equiv 0(\mathrm{mod}3)$ is also sufficient except for $(g,n)=(1,6)$. New recursive constructions on incomplete RHMTSs via MHFs are introduced to settle this problem completely.