Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two (Q2676823): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and Randomness in Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Theory of Finitely Generated Metabelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic theory of polycyclic-by-finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reachability Problems for Low-Dimensional Matrix Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate separability in polycyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solubility of certain decision problems in arithmetic and algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some general algorithms. II: Nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5612538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems Solvable in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rational subset membership problem for groups: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tilings and submonoids of metabelian groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-complexity computations for nilpotent subgroup problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4776061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rationality of verbal subsets in a group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-based cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3101433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy problem in metabelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of group theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy in polycyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-theoretic and algorithmic questions in group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some algorithmic problems for solvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The occurrence problem for extensions of Abelian groups by nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems for solvable and nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic theory of solvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable Properties of Polycyclic Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic problems for metabelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3080616 / rank
 
Normal rank

Latest revision as of 06:34, 30 July 2024

scientific article
Language Label Description Also known as
English
Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
scientific article

    Statements

    Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two (English)
    0 references
    28 September 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers