Results 1 to 10 of about 16,107,577 (322)
Diophantine problems in solvable groups [PDF]
Bulletin of Mathematical Sciences, 2020 We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc.), which satisfy some natural “non-commutativity” conditions.
Albert Garreta +2 more
doaj +3 more sources
Classifying families of character degree graphs of solvable groups [PDF]
International Journal of Group Theory, 2019 We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion.
Mark Bissler, Jacob Laubacher
doaj +2 more sources
Envelopes of certain solvable groups [PDF]
, 2014 A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$.
Dymarz, Tullia
core +3 more sources
An exact quantum hidden subgroup algorithm and applications to solvable groups [PDF]
Quantum information & computation, 2022 We present a polynomial time exact quantum algorithm for the hidden subgroup problem in $\Z_{m^k}^n$. The algorithm uses the quantum Fourier transform modulo $m$ and does not require factorization of $m$.
Muhammad Imran, G. Ivanyos
semanticscholar +1 more source
Character Triple Conjecture for p-Solvable Groups [PDF]
Journal of Algebra, 2021 In this paper, we prove Sp\"ath's Character Triple Conjecture for $p$-solvable groups. This is a conjecture proposed by Sp\"ath during the reduction process of Dade's Projective Conjecture to quasisimple groups.
D. Rossi
semanticscholar +1 more source
Hardness of equations over finite solvable groups under the exponential time hypothesis [PDF]
International Colloquium on Automata, Languages and Programming, 2020 Goldmann and Russell (2002) initiated the study of the complexity of the equation satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it is NP-complete for non-solvable groups.
A. Weiss
semanticscholar +1 more source
Equation Satisfiability in Solvable Groups [PDF]
Theory of Computing Systems, 2020 The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell in (Inf. Comput. 178(1), 253–262, 2002) where they showed that this problem is in P for nilpotent groups while it is NP ...
P. Idziak +3 more
semanticscholar +1 more source
Some criteria for solvability and supersolvability [PDF]
Journal of Mahani Mathematical Research, 2023 Denote by $ G $ a finite group, by $ {\rm hsn}(G) $ the harmonic mean Sylow number (eliminating the Sylow numbers that are one) in $G$ and by $ {\rm gsn}(G) $ the geometric mean Sylow number (eliminating the Sylow numbers that are one) in $G$.
Zohreh Habibi, Masoomeh Hezarjaribi
doaj +1 more source
Compatibility of Balanced and SKT Metrics on Two-Step Solvable Lie Groups [PDF]
Transformation groups, 2022 It has been conjectured by Fino and Vezzoni that a compact complex manifold admitting both a compatible SKT and a compatible balanced metric also admits a compatible Kähler metric.
Marco Freibert, A. Swann
semanticscholar +1 more source
On a result of nilpotent subgroups of solvable groups [PDF]
International Journal of Group Theory, 2022 Heineken [H. Heineken, Nilpotent subgroups of finite soluble groups, Arch. Math.(Basel), 56 no. 5 (1991) 417--423.] studied the order of the nilpotent subgroups of the largest order of a solvable group.
Yong Yang
doaj +1 more source