EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Characterization of p -nilpotency and IC-properties of finite groups

Yanhui Xiang, Jia Zhang

Demonstratio Mathematica · 23.01.2026 · 59 (1)

DOI: 10.1515/dema-2025-0239 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Demonstratio Mathematica, online erschienen am 05.05.2026. Verfasst von Yanhui Xiang und 1 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

As is well known, the embedding of all maximal subgroups of P of a group G can determine the structure of G , where p ∈ π ( G ) and P ∈ Syl p ( G ). Based on the topic, we defined two sets δ ( P , G ) = { P 1 ⋖ P ∣ P ∩ [ P , G ] ≰ P 1 } and F ( P , G ) = { P 1 ⋖ P ∣ P G ≰ P 1 } ${\mathfrak{F}}_{\left(P,G\right)}=\left\{{P}_{1}{< dot}P\mid {P}_{G}\nleqq {P}_{1}\right\}$ , which provide a new way to select “some” maximal subgroups of P instead of “all”. Further, we analyzed p -nilpotency of a group under the condition that every element in δ ( P , G ) satisfies the ICΦ-property (or P is an ICΦ s -subgroup of G and every element in F ( P , G ) ${\mathfrak{F}}_{\left(P,G\right)}$ satisfies the ICΦ-property). To some extent, the two sets will have wide application in investigating the p -nilpotency of finite groups and improving some known theorems.

Zitieren

APA

Xiang, Y., & Zhang, J. (2026). Characterization of p -nilpotency and IC-properties of finite groups. Demonstratio Mathematica, 59(1). https://doi.org/10.1515/dema-2025-0239

Vancouver

Xiang Y, Zhang J. Characterization of p -nilpotency and IC-properties of finite groups. Demonstratio Mathematica. 2026;59(1). doi:10.1515/dema-2025-0239

BibTeX
@article{Xiang2026,
  author = {Xiang, Yanhui and Zhang, Jia},
  title = {Characterization of p -nilpotency and IC-properties of finite groups},
  journal = {Demonstratio Mathematica},
  year = {2026},
  volume = {59},
  number = {1},
  doi = {10.1515/dema-2025-0239}
}
Kostenlos starten →