Let $C$ be an $[n,k,d]_q$ Griesmer code, where $q=p^f$ with $p$ prime, and write $e=\nu_p(d)$. Ward conjectured that $C$ is $p^{\max\{0,e-f+1\}}$-divisible. In this paper, we prove this conjecture.
Let $n,k$ be positive integers and $q$ be a prime power. We prove that there exists a real constant $C_k$ depending only on $k$ such that if $ \# M_n(\mathbb{F}_q)>C_k$ then every element in $M_n(\mathbb{F}_q)$ is a sum of two $k$th powers, proving Larsen's conjecture.
Let $p$ be prime and let $S\subseteq\mathbb F_p^3$ have $p^2$ points, with every affine plane meeting $S$ in a multiple of $p$ points. We give a self-contained argument that $S$ is a union of $p$ parallel lines.
The present article proves (assuming GRH and a minor technical result) the veracity of Serre's conjectures for the field $\Q(\sqrt{13})$. In doing so, we prove a ``reduction to level 1''result that holds for any real quadratic field with narrow class number one. However we can only establish the needed base cases for $...
We show that there exists a constant $\epsilon>0$ such that if $C$ is a conjugacy class in $A_n$ of size at least $|A_n|^{1-\epsilon}$, then $A_n \setminus \{1\} \subseteq C^2$. This proves the robust version of Thompson's conjecture for the alternating group, conjectured by Shalev (Annals of Math., 2009). Our proof co...
Nathan Keller, Noam Lifshitz, Avichai Marmor et al.· 1 citation
Let $p$ be an odd prime, let $G$ be a finite $p$-solvable group, and let $\varphi\in\IBr_p(G)$ have vertex $Q$. We prove that $\varphi$ has at most $|Q:Q'|$ lifts to ordinary irreducible characters, establishing Cossey's conjecture for odd primes.
Let $S_{\chi}(N)= \sum_{n\leq N} \chi(n)$, where $\chi$ is a Dirichlet character modulo a prime $p$. For integral $r\geq 2$, Burgess gave bounds of the shape $S_{\chi}(N) \ll N^{1-1/r} p^{(r+1)/(4r^{2})} \log p$. The factor of $\log p$ was reduced by several authors. We show that it can be removed completely.
Bryce Kerr, James Punch, T. Trudgian· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.