Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.06903

Lifts of Brauer characters and vertex pairs for odd primes

Yong Yang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $p$ be an odd prime, let $G$ be a finite $p$-solvable group, and let $φ\in\IBr_p(G)$ have vertex $Q$. We prove that $φ$ has at most $|Q:Q'|$ lifts to ordinary irreducible characters, establishing Cossey's conjecture for odd primes.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yong Yang. 2026-11-04. Lifts of Brauer characters and vertex pairs for odd primes. https://arxiv.org/abs/2611.06903

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Strongly Regular Graphs of Rank Four

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms.

math.GR↗
arXiv2026

Every finite group admits a just finite presentation

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

math.GR↗
arXiv2026

Assouad--Nagata dimension of systolic complexes with almost flat intervals

We introduce the notion of systolic complexes with almost flat intervals. They constitute a subclass of fit systolic complexes and arise naturally in the study of graphical C(3)--T(6) small cancellation complexes. We prove that their Assouad--Nagata dimension is bounded above by a universal constant. As consequences, we obtain universal bounds on the Assouad--Nagata dimension of tame simply connected graphical C(3)--T(6) small cancellation complexes and of finitely generated groups defined by graphical C(3)--T(6) small cancellation presentations. In the appendix, we observe that the proof of finiteness of asymptotic dimension for buildings due to Dymara and Schick also yields finiteness of their asymptotic Assouad--Nagata dimension.

math.GR↗