Prime Power

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 47163 Experts worldwide ranked by ideXlab platform

Olga Balkanova - One of the best experts on this subject based on the ideXlab platform.

Dmitry Frolenkov - One of the best experts on this subject based on the ideXlab platform.

María José Felipe - One of the best experts on this subject based on the ideXlab platform.

  • Prime Power Indices in Factorised Groups
    Mediterranean Journal of Mathematics, 2017
    Co-Authors: María José Felipe, A. Martínez-pastor, V. M. Ortiz-sotomayor
    Abstract:

    Let the group $$G=AB$$ be the product of the subgroups A and B. We determine some structural properties of G when the p-elements in $$A\cup B$$ have Prime Power indices in G, for some Prime p. More generally, we also consider the case that all Prime Power order elements in $$A\cup B$$ have Prime Power indices in G. In particular, when $$G=A=B$$ , we obtain as a consequence some known results.

  • Normal subgroups and class sizes of elements of Prime Power order
    Proceedings of the American Mathematical Society, 2012
    Co-Authors: Antonio Beltrán Felip, María José Felipe
    Abstract:

    If G is a finite group and N is a normal subgroup of G with two Gconjugacy class sizes of elements of Prime Power order, then we show that N is nilpotent.

Stephan Hell - One of the best experts on this subject based on the ideXlab platform.

  • On the number of Tverberg partitions in the Prime Power case
    European Journal of Combinatorics, 2007
    Co-Authors: Stephan Hell
    Abstract:

    We give an extension of the lower bound of A. Vucic, R. Živaljevic [Notes on a conjecture of Sierksma, Discrete Comput. Geom. 9 (1993) 339-349] for the number of Tverberg partitions from the Prime to the Prime Power case. Our proof is inspired by the Zp-index version of the proof in [J. Matousek, Using the Borsuk-Ulam Theorem, in: Lectures on Topological Methods in Combinatorics and Geometry, Universitext, Springer-Verlag, Heidelberg, 2003] and uses Volovikov's Lemma. Analogously, one obtains an extension of the lower bound for the number of different splittings of a generic necklace to the Prime Power case.

  • On the number of Tverberg partitions in the Prime Power case
    arXiv: Combinatorics, 2004
    Co-Authors: Stephan Hell
    Abstract:

    We give an extension of the lower bound of Vucic and Zivaljevic for the number of Tverberg partitions from the Prime to the Prime Power case. Our proof is inspired by the Z_p-index version of the proof in Matousek's book "Using the Borsuk-Ulam Theorem" and uses Volovikov's Lemma. Analogously, one obtains an extension of the lower bound for the number of different splittings of a generic necklace to the Prime Power case.

Xuding Zhu - One of the best experts on this subject based on the ideXlab platform.

  • Weighted-1-antimagic graphs of Prime Power order
    Discrete Mathematics, 2012
    Co-Authors: Po-yi Huang, Tsai Lien Wong, Xuding Zhu
    Abstract:

    Abstract Suppose G is a graph, k is a non-negative integer. We say G is weighted- k -antimagic if for any vertex weight function w : V → N , there is an injection f : E → { 1 , 2 , … , ∣ E ∣ + k } such that for any two distinct vertices u and v , ∑ e ∈ E ( v ) f ( e ) + w ( v ) ≠ ∑ e ∈ E ( u ) f ( e ) + w ( u ) . There are connected graphs G ≠ K 2 which are not weighted-1-antimagic. It was asked in Wong and Zhu (in press) [13] whether every connected graph other than K 2 is weighted-2-antimagic, and whether every connected graph on an odd number of vertices is weighted-1-antimagic. It was proved in Wong and Zhu (in press) [13] that if a connected graph G has a universal vertex, then G is weighted-2-antimagic, and moreover if G has an odd number of vertices, then G is weighted-1-antimagic. In this paper, by restricting to graphs of odd Prime Power order, we improve this result in two directions: if G has odd Prime Power order p z and has total domination number 2 with the degree of one vertex in the total dominating set not a multiple of p , then G is weighted-1-antimagic. If G has odd Prime Power order p z , p ≠ 3 and has maximum degree at least ∣ V ( G ) ∣ − 3 , then G is weighted-1-antimagic.

  • A simple proof of the multiplicativity of directed cycles of Prime Power length
    Discrete Applied Mathematics, 1992
    Co-Authors: Xuding Zhu
    Abstract:

    Abstract This paper gives a simple combinatorial proof of the multiplicativity of directed cycles of Prime Power length.