scholarly journals APPROXIMATION OF GEODESICS IN METABELIAN GROUPS

2012 ◽  
Vol 22 (02) ◽  
pp. 1250012 ◽  
Author(s):  
OLGA KHARLAMPOVICH ◽  
ATEFEH MOHAJERI MOGHADDAM
Keyword(s):  
Abelian Group ◽  
Wreath Product ◽  
Polynomial Time ◽  
Deterministic Algorithm ◽  
Np Hard ◽  
Finitely Generated ◽  
Metabelian Groups ◽  
Geodesic Length ◽  
Geodesic Problem ◽  
Approximation Polynomial

It is known that the bounded Geodesic Length Problem in free metabelian groups is NP-complete [A. Myasnikov, V. Roman'kov, A. Ushakov and A. Vershik, The word and geodesic problems in free solvable groups, Trans. Amer. Math. Soc.362(9) (2010) 4655–4682] (in particular, the Geodesic Problem is NP-hard). We construct a 2-approximation polynomial time deterministic algorithm for the Geodesic Problem. We show that the Geodesic Problem in the restricted wreath product of a finitely generated non-trivial group with a finitely generated abelian group containing ℤ2 is NP-hard and there exists a Polynomial Time Approximation Scheme for this problem. We also show that the Geodesic Problem in the restricted wreath product of two finitely generated non-trivial abelian groups is NP-hard if and only if the second abelian group contains ℤ2.

On the profinite topology on solvable groups

2017 ◽  
Vol 20 (4) ◽  
Author(s):  
Khadijeh Alibabaei
Keyword(s):  
Abelian Group ◽  
Wreath Product ◽  
Solvable Group ◽  
Solvable Groups ◽  
Polycyclic Group ◽  
Finitely Generated ◽  
Metabelian Groups ◽  
Finitely Generated Group ◽  
Hnn Extension ◽  
Profinite Topology

AbstractWe show that the wreath product of a finitely generated abelian group with a polycyclic group is a LERF group. This theorem yields as a corollary that finitely generated free metabelian groups are LERF, a result due to Coulbois. We also show that a free solvable group of class 3 and rank at least 2 does not contain a strictly ascending HNN-extension of a finitely generated group. Since such groups are known not to be LERF, this settles, in the negative, a question of J. O. Button.

On Commutator Length and Square Length of the Wreath Product of a Group by a Finitely Generated Abelian Group

2010 ◽  
Vol 17 (spec01) ◽  
pp. 799-802 ◽  
Author(s):  
Mehri Akhavan-Malayeri
Keyword(s):  
Abelian Group ◽  
Wreath Product ◽  
Finitely Generated ◽  
Commutator Length

Let W = G ≀ H be the wreath product of G by an n-generator abelian group H. We prove that every element of W′ is a product of at most n+2 commutators, and every element of W2 is a product of at most 3n+4 squares in W. This generalizes our previous result.

Dehn functions of finitely presented metabelian groups

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Wenhao Wang
Keyword(s):  
Abelian Group ◽  
Upper Bound ◽  
Finite Rank ◽  
Free Abelian Group ◽  
Metabelian Group ◽  
Finitely Generated ◽  
Dehn Function ◽  
Metabelian Groups ◽  
Dehn Functions ◽  
Finitely Presented

Abstract In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. In addition, we prove that the same upper bound works for the relative Dehn function of a finitely generated metabelian group. We also show that every wreath product of a free abelian group of finite rank with a finitely generated abelian group can be embedded into a metabelian group with exponential Dehn function.

Representations of holomorphs of group extensions with Abelian kernels

1975 ◽  
Vol 78 (3) ◽  
pp. 357-368 ◽  
Author(s):  
B. A. F. Wehrfritz
Keyword(s):  
Abelian Group ◽  
Automorphism Group ◽  
Finite Rank ◽  
Automorphism Groups ◽  
Abelian Groups ◽  
Finitely Generated ◽  
Metabelian Groups ◽  
Soluble Groups ◽  
Group Extensions

This paper is devoted to the construction of faithful representations of the automorphism group and the holomorph of an extension of an abelian group by some other group, the representations here being homomorphisms into certain restricted parts of the automorphism groups of smallish abelian groups. We apply these to two very specific cases, namely to finitely generated metabelian groups and to certain soluble groups of finite rank. We describe the applications first.

scholarly journals TWISTED CONJUGACY CLASSES IN WREATH PRODUCTS

2006 ◽  
Vol 16 (05) ◽  
pp. 875-886 ◽  
Author(s):  
DACIBERG GONÇALVES ◽  
PETER WONG
Keyword(s):  
Abelian Group ◽  
Wreath Product ◽  
Wreath Products ◽  
Conjugacy Classes ◽  
Finitely Generated ◽  
Twisted Conjugacy

Let G be a finitely generated abelian group and G ≀ ℤ be the wreath product. In this paper, we classify all such groups G for which every automorphism of G ≀ ℤ has infinitely many twisted conjugacy classes.

scholarly journals Minimal generating sets for some wreath products of groups

1973 ◽  
Vol 9 (1) ◽  
pp. 127-136
Author(s):  
Yeo Kok Chye
Keyword(s):  
Abelian Group ◽  
Nilpotent Group ◽  
Wreath Product ◽  
Wreath Products ◽  
Finitely Generated ◽  
Generating Set ◽  
Generating Sets ◽  
Products Of Groups ◽  
Minimal Generating Set ◽  
Standard Wreath Product

Let d(G) denote the minimum of the cardinalities of the generating sets of the group G. Call a generating set of cardinality d(G) a minimal generating set for G. If A is a finitely generated nilpotent group, B a non-trivial finitely generated abelian group and A wr B is their (restricted, standard) wreath product, then it is proved (by explicitly constructing a minimal generating set for A wr B ) that d(AwrB) = max{l+d(A), d(A×B)} where A × B is their direct product.

Learning Importance of Preferences

10.29007/v68w ◽  
2018 ◽  
Author(s):  
Ying Zhu ◽  
Mirek Truszczynski
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scoring Rules ◽  
Np Hard ◽  
Individual Preferences

We study the problem of learning the importance of preferences in preference profiles in two important cases: when individual preferences are aggregated by the ranked Pareto rule, and when they are aggregated by positional scoring rules. For the ranked Pareto rule, we provide a polynomial-time algorithm that finds a ranking of preferences such that the ranked profile correctly decides all the examples, whenever such a ranking exists. We also show that the problem to learn a ranking maximizing the number of correctly decided examples (also under the ranked Pareto rule) is NP-hard. We obtain similar results for the case of weighted profiles when positional scoring rules are used for aggregation.

On the Complexity of Deadlock Recovery

1986 ◽  
Vol 9 (3) ◽  
pp. 323-342
Author(s):  
Joseph Y.-T. Leung ◽  
Burkhard Monien
Keyword(s):  
Computational Complexity ◽  
Polynomial Time ◽  
Arbitrary Number ◽  
The Other ◽  
Np Hard ◽  
Total Cost ◽  
Other Hand ◽  
Input Parameters ◽  
Resource Type

We consider the computational complexity of finding an optimal deadlock recovery. It is known that for an arbitrary number of resource types the problem is NP-hard even when the total cost of deadlocked jobs and the total number of resource units are “small” relative to the number of deadlocked jobs. It is also known that for one resource type the problem is NP-hard when the total cost of deadlocked jobs and the total number of resource units are “large” relative to the number of deadlocked jobs. In this paper we show that for one resource type the problem is solvable in polynomial time when the total cost of deadlocked jobs or the total number of resource units is “small” relative to the number of deadlocked jobs. For fixed m ⩾ 2 resource types, we show that the problem is solvable in polynomial time when the total number of resource units is “small” relative to the number of deadlocked jobs. On the other hand, when the total number of resource units is “large”, the problem becomes NP-hard even when the total cost of deadlocked jobs is “small” relative to the number of deadlocked jobs. The results in the paper, together with previous known ones, give a complete delineation of the complexity of this problem under various assumptions of the input parameters.

Infinitely presented permutation stable groups and invariant random subgroups of metabelian groups

2021 ◽  
pp. 1-36
Author(s):  
ARIE LEVIT ◽  
ALEXANDER LUBOTZKY
Keyword(s):  
Ergodic Theorem ◽  
Abelian Groups ◽  
Wreath Products ◽  
Finitely Generated ◽  
Metabelian Groups ◽  
Amenable Groups ◽  
Pointwise Ergodic Theorem ◽  
Lamplighter Group ◽  
Invariant Random Subgroups

Abstract We prove that all invariant random subgroups of the lamplighter group L are co-sofic. It follows that L is permutation stable, providing an example of an infinitely presented such group. Our proof applies more generally to all permutational wreath products of finitely generated abelian groups. We rely on the pointwise ergodic theorem for amenable groups.

scholarly journals ABELIAN GROUPS WITH A p2-BOUNDED SUBGROUP, REVISITED

2011 ◽  
Vol 10 (03) ◽  
pp. 377-389
Author(s):  
CARLA PETRORO ◽  
MARKUS SCHMIDMEIER
Keyword(s):  
Abelian Group ◽  
Prime Number ◽  
Maximal Ideal ◽  
Abelian Groups ◽  
Finitely Generated ◽  
Uniserial Ring

Let Λ be a commutative local uniserial ring of length n, p be a generator of the maximal ideal, and k be the radical factor field. The pairs (B, A) where B is a finitely generated Λ-module and A ⊆B a submodule of B such that pmA = 0 form the objects in the category [Formula: see text]. We show that in case m = 2 the categories [Formula: see text] are in fact quite similar to each other: If also Δ is a commutative local uniserial ring of length n and with radical factor field k, then the categories [Formula: see text] and [Formula: see text] are equivalent for certain nilpotent categorical ideals [Formula: see text] and [Formula: see text]. As an application, we recover the known classification of all pairs (B, A) where B is a finitely generated abelian group and A ⊆ B a subgroup of B which is p2-bounded for a given prime number p.

Sign in / Sign up

Export Citation Format

Share Document