相关论文: On the $p'$-subgraph of the Young graph

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…

We define and study supercharacters of the classical finite unipotent groups of symplectic and orthogonal types (over any finite field of odd characteristic). We show how supercharacters for groups of those types can be obtained by…

Let p be a prime. In this paper we provide a lower bound for the number of almost p-rational characters of degree coprime to p in the principal p-block of a finite group of order divisible by p. We further describe the p-local structure of…

Let $G = {\rm U}(2m, {\mathbb F}_{q^2})$ be the finite unitary group, with $q$ the power of an odd prime $p$. We prove that the number of irreducible complex characters of $G$ with degree not divisible by $p$ and with Frobenius-Schur…

We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…

We study the relationship between the existence of Hall $\pi$-subgroups and that of irreducible characters of $\pi'$-degree with prescribed fields of values in finite groups. This work extends a result of Navarro and Tiep from a single odd…

In this article, we study the structure of the graph implied by a given map on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context…

Dade's conjecture predicts that if p is a prime, then the number of irreducible characters of a finite group of a given p-defect is determined by local subgroups. In this paper we replace $p$ by a set of primes pi and prove a pi-version of…

S-prime graphs are graphs that cannot be represented as nontrivial subgraphs of nontrivial Cartesian products of graphs, i.e., whenever it is a subgraph of a nontrivial Cartesian product graph it is a subgraph of one the factors. A graph is…

Let $p$ be any prime. We determine precisely those irreducible characters of symmetric groups which contain at most $p$ distinct linear constituents in their restriction to a Sylow $p$-subgroup, answering a question of Giannelli and…

The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…

We study finite groups which possess a strongly p-embedded subgroup for some odd prime p. The main results of the paper will be applied in the ongoing project to classify the simple groups of local characteristic p.

The structure of the character degree graphs $\Delta(G)$, i.e. the prime graphs on the set $\mathrm{cd}(G)$ of the irreducible character degrees of a finite group $G$, such that $G$ is solvable and $\Delta(G)$ has diameter three, remains an…

For a prime \(p\ge 2\) and a number field K with p-class group of type (p,p) it is shown that the class, coclass, and further invariants of the metabelian Galois group \(G=Gal(F_p^2(K) | K)\) of the second Hilbert p-class field \(F_p^2(K)\)…

We study the algorithmic decidability of the domination number in the Erdos-Renyi random graph model $G(n,p)$. We show that for a carefully chosen edge probability $p=p(n)$, the domination problem exhibits a strong irreducible property.…

In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…

We study an analogue of the Herbrand-Ribet theorem, and its refinement by Mazur and Wiles, in graph theory. For an odd prime number $p$, we let $\mathbb{F}_{p}$ and $\mathbb{Z}_{p}$ denote the finite field with $p$ elements and the ring of…

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…