Sfoglia per Autore
Sulle partizioni dei p-gruppi di ordine p alla n con n minore o uguale a 5
1991 D. Bubboloni
Solvable finite groups with a particular configuration of Fitting sets
1995 D. Bubboloni
p-groups with some regularity properties
2000 D. BUBBOLONI; G. CORSI TANI
Polynomials with roots mod p for all primes p
2001 BRANDL R; D. BUBBOLONI; HUPP I
Coverings of linear groups
2002 D. BUBBOLONI; LUCIDO M. S
p-groups with all the elements of order p in the center
2004 D. BUBBOLONI; CORSI TANI G
Generic 2-coverings of finite Groups of Lie type
2006 D. Bubboloni; M. S. Lucido ; T. Weigel
On bipartite divisor graphs for group conjugacy class sizes
2009 D. Bubboloni; S. Dolfi; M. Iranmanesh; C. Praeger
Finite groups whose irreducible characters vanish only on p-elements
2009 D. BUBBOLONI; S. DOLFI; P. SPIGA
Coverings of the symmetric and alternating groups
2010 D. Bubboloni
2-Coverings of classical groups
2011 D. Bubboloni; M.S. Lucido; T. Weigel
Normal coverings of finite symmetric and alternating groups
2011 D. Bubboloni; C. Prager
Compositions of n satisfying some coprimality conditions
2012 D. Bubboloni; F. Luca; P. Spiga
Normal coverings and pairwise generation of finite alternating and symmetric groups
2013 Daniela Bubboloni; Cheryl E. Praeger; Pablo Spiga
Conjectures on the normal covering number of the finite symmetric and alternating groups
2014 D. Bubboloni; C. E. Praeger; P. Spiga
Anonymous and neutral majority rules
2014 Bubboloni, Daniela; Gori, Michele
Symmetric majority rules
2015 Bubboloni, Daniela; Gori, Michele
Intersective S_n polynomials with few irreducible factors
2016 Bubboloni, Daniela; Sonn, Jack
On the reversal bias of the Minimax social choice correspondence
2016 Bubboloni, Daniela; Gori, Michele
Resolute refinements of social choice correspondences
2016 Bubboloni, Daniela; Gori, Michele
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile