Zobrazeno 1 - 10
of 10
pro vyhledávání: '"John K. McVey"'
Autor:
Mark L. Lewis, John K. McVey
Publikováno v:
International Journal of Group Theory, Vol 4, Iss 1, Pp 1-6 (2015)
In a previous paper, the second author established that, given finite fields F
Externí odkaz:
https://doaj.org/article/2c935013ffd449e6b00c1904c1ed6fc4
Autor:
John K. Mcvey
Publikováno v:
Pacific Journal of Mathematics. 264:213-219
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a630488875323e2815ae2ac545d48254
https://doi.org/10.2140/pjm.2013.264.213
https://doi.org/10.2140/pjm.2013.264.213
Autor:
John K. McVey
Publikováno v:
Journal of Algebra. 314(1):1-16
Given a finite, nonabelian, simple group S and labelling π as the set of prime divisors of |S|, a set C of character degrees of S strongly covers π if some fixed prime divides every member of C and every prime in π divides at least one member of C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07f94294e8cb9b163e1a647732f836f6
Autor:
John K. McVey
Publikováno v:
Archiv der Mathematik. 87:97-103
When G is a finite nonabelian group, we associate the common-divisor graph with G by letting nontrivial degrees in cd(G) = {χ(1) | χ∈Irr(G)} be the vertices and making distinct vertices adjacent if they have a common nontrivial divisor. A set $${
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f36d7ef9dc29f3ac469425eb8bccfee8
https://doi.org/10.1007/s00013-005-1679-1
https://doi.org/10.1007/s00013-005-1679-1
Autor:
John K. McVey
Publikováno v:
Archiv der Mathematik. 84:481-484
When G is a finite nonabelian group, we associate the common-divisor graph Γ(G) with G by letting nontrivial degrees in cd(G) be the vertices and making distinct vertices adjacent if they have a common nontrivial divisor. A set \(\mathcal{C}\) of ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e7873573a0a515ba7c4cce6be9fdf2c
https://doi.org/10.1007/s00013-005-1215-3
https://doi.org/10.1007/s00013-005-1215-3
Autor:
John K. McVey
Publikováno v:
Communications in Algebra. 32:3391-3402
Let G be a finite, nonabelian, solvable group. Following work by D. Benjamin, we conjecture that some prime must divide at least a third of the irreducible character degrees of G. Benjamin was able to show the conjecture is true if all primes divide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a907e5f7264196bf61422807e7094fd3
https://doi.org/10.1081/agb-120039553
https://doi.org/10.1081/agb-120039553
Autor:
John K. McVey
Publikováno v:
Journal of Algebra. 280(2):415-425
Associated with the character degrees of a finite group is the common-divisor graph, where the nontrivial degrees are the vertices and distinct degrees are adjacent when they have a common nontrivial divisor. The author has shown that common-divisor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fd930551f55117d82586e77020d2d9c
Publikováno v:
Archiv der Mathematik. 80:570-577
Let G be a group and $\pi$ be a set of primes. We consider the set ${\rm cd}^{\pi}(G)$ of character degrees of G that are divisible only by primes in $\pi$. In particular, we define $\Gamma^{\pi}(G)$ to be the graph whose vertex set is the set of pri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1f38e5567bfbbe2073adc94119e95d9
https://doi.org/10.1007/s00013-003-0801-5
https://doi.org/10.1007/s00013-003-0801-5
Autor:
John K. McVey, Mark L. Lewis
Publikováno v:
Journal of Group Theory. 12
Throughout this note, G will be a finite group, IrrðGÞ will be the set of irreducible characters of G, cdðGÞ will be the set of character degrees of G, and rðGÞ will be the set of primes that divide degrees in cdðGÞ. The prime vertex degree g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e648617f653c5ea864a8fb977fb6db50
https://doi.org/10.1515/jgt.2008.083
https://doi.org/10.1515/jgt.2008.083
Publikováno v:
Archiv der Mathematik; Jun2003, Vol. 80 Issue 6, p570-577, 8p