Currently:
def is_subgroup(self):
"""
Return whether the group was defined as a subgroup of a bigger
group.
You can access the containing group with :meth:`ambient`.
OUTPUT:
Boolean.
EXAMPLES::
sage: G = FreeGroup(3)
I forgot to say this is in sage.groups.libgap_wrapper
On Friday, February 9, 2018 at 9:45:50 AM UTC+1, Simon Brandhorst wrote:
>
> Currently:
>
>def is_subgroup(self):
> """
> Return whether the group was defined as a subgroup of a bigger
> group.
>
> You can
On 09/02/2018 09:47, Simon Brandhorst wrote:
Return whether the group was defined as a subgroup of a bigger
group.
This description is very unclear anyway. See also #24535 for ambiguities
concerning group comparisons.
For me there are two relevant concepts
1) whether H is a
Hi, the following script
def test(m,c,precision):
M = 3*m
RRR = RealField(prec = precision)
coef02 = [RRR(1/i) for i in [1..M+1]]
g = coef02[M]
for i in [M-1..2,step=-1]:
g = x*g+coef02[i]
ME = 32
disk = [exp (2*pi.n(precision)*I*i/ME) for i in range(ME)]
ep
I think 1) is the reasonable way.
G.is_subgroup(H) should return if G is (in a natural way) a subset of H
such that it is closed under the group operations i.e. a subset.
For example for permutation groups (of {1,...,n} ) the "natural way" Is to
regard all of them as permutation groups of the n
On Friday, February 9, 2018 at 11:03:11 AM UTC, Marco Caliari wrote:
>
> Hi, the following script
>
> def test(m,c,precision):
> M = 3*m
> RRR = RealField(prec = precision)
> coef02 = [RRR(1/i) for i in [1..M+1]]
> g = coef02[M]
> for i in [M-1..2,step=-1]:
> g = x*g+coe
On 09/02/18 15:07, Simon Brandhorst wrote:
The application I have in mind is to create an abstract base class for
group homomorphisms of libgap groups. And if we want to compute the
inverse image of a subgroup, then this should be decided by the method
"is_subgroup".
A bit off-topic, but
