Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Daniela Bubboloni"'
Publikováno v:
International Journal of Group Theory, Vol 3, Iss 2, Pp 57-75 (2014)
Let gamma(Sn) be the minimum number of proper subgroups Hi, i = 1,...,ell, of the symmetric group Sn such that each element in Sn lies in some conjugate of one of the Hi. In this paper we conjecture that gamma(Sn) =(n/2)(1-1/p_1) (1-1/p_2) + 2, wh
Externí odkaz:
https://doaj.org/article/0c50d7f694214bb7815959fcc38e6cc7
Autor:
Daniela Bubboloni, Florian Luca
Publikováno v:
Journal of Number Theory. 235:328-357
We show that while the number of coprime compositions of a positive integer n into k parts can be expressed as a Q -linear combination of the Jordan totient functions, this is never possible for the coprime partitions of n into k parts. We also show
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19a0c9303e7ed96cadd34efbf2f3c53a
https://doi.org/10.1016/j.jnt.2021.05.017
https://doi.org/10.1016/j.jnt.2021.05.017
Autor:
Michele Gori, Daniela Bubboloni
Publikováno v:
Networks. 80:216-234
We consider the number of paths that must pass through a subset $X$ of vertices of a network $N$ in a maximum sequence of arc-disjoint paths connecting two vertices $y$ and $z$. We show that when $X$ is a singleton, that number equals the difference
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b53930d60295f550fd041f0f6496da4c
https://doi.org/10.1002/net.22088
https://doi.org/10.1002/net.22088
Autor:
Daniela Bubboloni, Michele Gori
Publikováno v:
Decisions in Economics and Finance. 44:411-457
Many classic social preference (multiwinner social choice) correspondences are resolute only when two alternatives and an odd number of individuals are considered. Thus, they generally admit several resolute refinements, each of them naturally interp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91839c7ccc543c961664b0ccf0405f3f
https://doi.org/10.1007/s10203-020-00294-8
https://doi.org/10.1007/s10203-020-00294-8
Publikováno v:
Monatshefte für Mathematik. 191:229-247
The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for $\gamma(S_n)$, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85ec9b5f245121792fc25e021852a703
https://doi.org/10.1007/s00605-019-01287-5
https://doi.org/10.1007/s00605-019-01287-5
This book provides a complete and comprehensive classification of normal 2-coverings of non-abelian simple groups and their generalizations. While offering readers a thorough understanding of these structures, and of the groups admitting them, it del
Autor:
Daniela Bubboloni, Michele Gori
Publikováno v:
Social Choice and Welfare. 51:621-656
In this paper we propose an in-depth analysis of a method, called the flow network method, which associates with any network a complete and quasi-transitive binary relation on its vertices. Such a method, originally proposed by Gvozdik (Abstracts of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e89f355fb6374b5c506807959626f5f
https://doi.org/10.1007/s00355-018-1131-7
https://doi.org/10.1007/s00355-018-1131-7
Publikováno v:
Rendiconti del Seminario Matematico della Università di Padova. 138:61-89
In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph $\mathcal{P}_0(G)$ of a fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::071b8315858065067b4960892c25ad0a
https://doi.org/10.4171/rsmup/138-3
https://doi.org/10.4171/rsmup/138-3
Publikováno v:
Communications in Algebra. 45:5355-5373
Let $P_0(A_n), \widetilde{P}_0(A_n), P_0(\mathcal{T}(A_n))$ and $\mathcal{O}_0(A_n)$ be respectively the proper power graph, the proper quotient power graph, the proper power type graph and the proper order graph of the alternating group $A_n$, for $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::537456c3a6864411eb08ae835810ba6f
https://doi.org/10.1080/00927872.2017.1307381
https://doi.org/10.1080/00927872.2017.1307381
Autor:
Daniela Bubboloni, Michele Gori
Publikováno v:
Mathematical Social Sciences. 81:53-61
We introduce three different qualifications of the reversal bias in the framework of social choice correspondences. For each of them, we prove that the Minimax social choice correspondence is immune to it if and only if the number of voters and the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87907a430d079102b40d2a20e9ee1147
https://doi.org/10.1016/j.mathsocsci.2016.03.003
https://doi.org/10.1016/j.mathsocsci.2016.03.003