Pasar al contenido principal

REPRESENTACIONES Y CARACTERES DE GRUPOS IV

PID2019-103854GB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Groups whose prime graph on class sizes has a cut vertex

  • Dolfi, Silvio
  • Pacifici, Emanuele
  • Sanus, Lucia
  • Sotomayor, Víctor|||0000-0001-8649-5742
[EN] Let G be a finite group, and let Delta(G) be the prime graph built on the set of conjugacy class sizes of G: this is the simple undirected graph whose vertices are the prime numbers dividing some conjugacy class size of G, two vertices p and q being adjacent if and only if pq divides some conjugacy class size of G. In the present paper, we classify the finite groups G for which Delta(G) has a cut vertex., The research of the first and second authors is partially supported by the Italian PRIN 2015TW9LSR_006 "Group Theory and Applications" and by INdAM-GNSAGA. The research of the third author is supported by the Spanish Ministerio de Ciencia e Innovacion PID2019-103854GB-I00 partly with FEDER funds. The fourth author acknowledges the support of the Spanish Ministerio de Ciencia, Innovacion y Universidades proyecto PGC2018-096872-B-I00, the grant ACIF/2016/170 from Generalitat Valenciana, and the prize Borses Ferran Sunyer i Balaguer 2019.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I

  • Dolfi, Silvio
  • Pacifici, Emanuele
  • Sanus, Lucia
  • Sotomayor, Víctor|||0000-0001-8649-5742
[EN] Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the numbers in cd(G), and two distinct vertices p, q are adjacent if and only if pq divides some number in cd(G). In the series of three papers starting with the present one, we analyze the structure of the finite non-solvable groups whose character degree graph possesses a cut-vertex, i.e. a vertex whose removal increases the number of connected components of the graph., The research of the first and second authors is partially supported by INDAM-GNSAGA. The research of the third and fourth authors is supported by Proyecto CIAICO/2021/163, Generalitat Valenciana (Spain). The third author is also partially supported by the Spanish Ministerio de Ciencia e Innovacion PID2019-103854GB-I00 funded by MCIN/AEI/ 10.13039/501100011033. The fourth author acknowledges the financial support of Centro Universitario EDEM (Valencia). This research has been carried out during a visit of the third and fourth authors at the Dipartimento di Matematica e Informatica "Ulisse Dini" (DIMAI) of Universita degli Studi di Firenze. They thank DIMAI for the hospitality.