Add components method to Abelian group

[paemurru]

@simonbrandhorst suggested that instead of accessing the property using the dot notation, a proper getter would be useful. I named the method components since this is how it is referred to in the docs.

[thofma]

Yes and no, see #1466

[simonbrandhorst]

I see. Maybe we just make an arbitrary default decision and go for it? Throw a dice?
We can also add
coefficients(::Type{ZZMatrix}, x)
coefficients(::Type{Vector{ZZRingElem}, x)

[codecov]

Codecov Report

Attention: Patch coverage is 0% with 2 lines in your changes missing coverage. Please review.

Project coverage is 75.82%. Comparing base (a024dc6) to head (7d4737f).

Files with missing lines	Patch %	Lines
src/GrpAb/Elem.jl	0.00%	2 Missing ⚠️

Additional details and impacted files

@@            Coverage Diff             @@
##           master    #1632      +/-   ##
==========================================
- Coverage   75.85%   75.82%   -0.04%     
==========================================
  Files         361      361              
  Lines      113702   113704       +2     
==========================================
- Hits        86249    86212      -37     
- Misses      27453    27492      +39     

Files with missing lines	Coverage Δ
src/GrpAb/Elem.jl	95.58% <0.00%> (-1.07%)	⬇️

... and 26 files with indirect coverage changes

[fingolfin]

What do you want to do? Knowing your usecase would help decide how to best address this. Maybe a more mathematical interface would be possible.

Note that you already can do x[1] to get the first, second, etc. entry.

If we really want this, we could also allow something like Vector{ZZRingElem}(x) ...

[paemurru]

A toric geometry function outputs an algebra graded by a finitely generated abelian group. I want to make a new algebra with a slightly different grading. Namely, the last "column" replaced by ones.

Ideally I would want to be able to write x[1:end] to get the vector of entries. So I can construct the vector [x[1:end-1]; 1].

[fieker]

On Wed, Oct 09, 2024 at 05:05:18AM -0700, Erik Paemurru wrote: A toric geometry function outputs an algebra graded by a finitely generated abelian group. I want to make a new algebra with a slightly different grading. Namely, the last "column" replaced by ones. Ideally I would want to be able to write `x[1:end]` to get the vector of entries. So I can construct the vector `[x[1:end-1]; 1]`.

Is this math - or developing/ testing to get examples. In the current world you "could" do n = ngens(parent(x)) x - (x[n] + 1)*parent(x)[n] to achieve that

…

-- Reply to this email directly or view it on GitHub: #1632 (comment) You are receiving this because you are subscribed to this thread. Message ID: ***@***.***>

[paemurru]

Is this math - or developing/ testing to get examples.
Math.

I think it would be rather nice if we could write g[1:end] to get the vector of entries, considering g[i] already gives an entry. Is there an easy way to add this functionality?

[simonbrandhorst]

It is just about the interface. We know how to achieve what we want. But do others know it as well?
I find both of the following not optimal. The first because one has to go back to the parent and the second because it is not using the interface .

julia> A = abelian_group([0,1,2,3]);

julia> x = A[1]
Abelian group element [1, 0, 0, 0]

julia> [x[i] for i in 1:ngens(A)]
4-element Vector{ZZRingElem}:
 1
 0
 0
 0

julia> x.coeff
[1   0   0   0]

[fieker]

On Wed, Oct 09, 2024 at 07:15:12AM -0700, Erik Paemurru wrote: > Is this math - or developing/ testing to get examples. Math. I think it would be rather nice if we could write `g[1:end]` to get the vector of entries, considering `g[i]` already gives an entry. Is there an easy way to add this functionality?

well... yes no... it means adding getindex(GrpAbFinGenElem, ???) where ??? needs thought. - internally, at this point, the elems are using ZZMatrix hence converting to a vector is bad (memory wise) This is mostly more efficient that Vector{ZZRingElem} - Tommy wants to move towards Vector{ZZRingElem} - which has other problems - looking at most usage patterns, one would like a nice name and decent version of vcat([x.coeff for x in L]...) or similar to get the coeffs into a matrix. Possibly paired by a way of converting a matrix into a lost of group elems - not completely convinced that, apart from nice, there is a strong use case for any of that - that justifies the work...

…

-- Reply to this email directly or view it on GitHub: #1632 (comment) You are receiving this because you commented. Message ID: ***@***.***>

[fieker]

On Wed, Oct 09, 2024 at 07:25:53AM -0700, Simon Brandhorst wrote: It is just about the interface. We know how to achieve what we want. But do others know it as well? I find both of the following not optimal. The first because one has to go back to the parent and the second because it is not using the interface . ``` julia> A = abelian_group([0,1,2,3]); julia> x = A[1] Abelian group element [1, 0, 0, 0] julia> [x[i] for i in 1:ngens(A)] 4-element Vector{ZZRingElem}: 1 0 0 0 julia> x.coeff [1 0 0 0] ```

I spend time thinking about it... and I think it is really important to get down to the math. In general, there will be no element in the group with some specific component set to 1. It might work here due to free (and in particular torsion free) groups in optimal presentation. However, in general G([0,0,1])[3] != 1 is expected: julia> A = abelian_group([0 0; 0 1]) Finitely generated abelian group with 2 generators and 2 relations and relation matrix [0 0] [0 1] julia> A([0,1]) Abelian group element [0, 0]

…

-- Reply to this email directly or view it on GitHub: #1632 (comment) You are receiving this because you commented. Message ID: ***@***.***>