Searcharxiv⌕ Search

arXiv · 2611.17993

On character conductors and Sylow p-subgroups

Abstract

Let $P\in\operatorname{Syl}_p(G)$, where $G$ is a finite group and $p$ is a prime, and let $χ\in\operatorname{Irr}(G)$. In 2024, I. M. Isaacs and G. Navarro asked whether the degree of $\mathbb{Q}_{p^f}$ over $\mathbb{Q}_p(χ_P)$ is always at most the $p$-part $χ(1)_p$ of $χ(1)$, where $p^f$ is the $p$-part of the conductor of $χ$ and $f\geq1$. Here $\mathbb{Q}_n=\mathbb{Q}(e^{2πi/n})$ is the $n$th cyclotomic field, $χ_P$ is the restriction of $χ$ to $P$, and $\mathbb{Q}_p(χ_P)$ is the field generated over $\mathbb{Q}_p$ by the values of $χ_P$. We prove that this inequality holds for $p$-solvable groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yang Zhou, Heguo Liu. 2026-11-13. On character conductors and Sylow p-subgroups. https://searcharxiv.com/abs/2611.17993

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗