Git Product home page Git Product logo

catreps's People

Contributors

kamalsaleh avatar mohamed-barakat avatar tschitschibor avatar zickgraf avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar

catreps's Issues

DecomposeOnceByRandomEndomorphism doesn't check if d is zero.

gap> zero;
<(1)->0, (2)->0; (a)->0x0, (b)->0x0, (c)->0x0>
gap> etas := WeakDirectSumDecomposition( zero );
Error, cannot convert float -inf to integer in
Int( Log2( Float( d ) ) ) at /home/user/.gap/pkg/FunctorCategories/gap/DirectSumDecomposition.gi:23 called from
DecomposeOnceByRandomEndomorphism( Source( eta )
) at /home/user/.gap/pkg/FunctorCategories/gap/DirectSumDecomposition.gi:80 called from
<function "WeakDirectSumDecomposition for an object in a Hom-category">( )
called from read-eval loop at stdin:2
#I Options stack has been reset

Error in UnionOfRowsOp when using WeakDirectSumDecomposition

gap> etas := WeakDirectSumDecomposition( fortyone );;
Error, no method found! For debugging hints type ?Recovery from NoMethodFound
Error, no 1st choice method found for `UnionOfRowsOp' on 2 arguments at /home/user/gap-4.10.2/lib/methsel2.g:250 called from
UnionOfRowsOp( arg, arg[1] ) at /home/user/.gap/pkg/homalg_project/Gauss/gap/GaussDense.gi:503 called from
UnionOfRows( result.coeffs, result.relations
) at /home/user/.gap/pkg/homalg_project/GaussForHomalg/gap/GaussFQI.gi:80 called from
RP!.RowReducedEchelonForm( M, T
) at /home/user/.gap/pkg/homalg_project/MatricesForHomalg/gap/Service.gi:203 called from
RowReducedEchelonForm( M, TT
) at /home/user/.gap/pkg/homalg_project/MatricesForHomalg/gap/Service.gi:2288 called from
BasisOfRowsCoeff( B, C ) at /home/user/.gap/pkg/homalg_project/MatricesForHomalg/gap/Service.gi:2566 called from
... at stdin:1
type 'quit;' to quit to outer loop

When an endomorphism is not bijective, RelationsOfEndomorphisms does not terminate

Example:

GF3 := HomalgRingOfIntegers(3);
ccat := ConcreteCategoryForCAP( [ [1,1,1], [4,5,6], [,,,5,6,4] ] );
relEndo := RelationsOfEndomorphisms( GF3, ccat );

in the inner while loop, only n is increased but one never leaves the loop to increase m. So with m = 0,

IsCongruentForMorphisms( mor^(m+n), mor^m )

is looking for a power n such that (MapOfFinSets( [1,2,3], [ [1,1], [2,1], [3,1] ], [1,2,3] ))^(0+n) = MapOfFinSets([ [ 1, 2, 3 ], [ [ 1, 1 ], [ 2, 2 ], [ 3, 3 ] ], [ 1, 2, 3 ] ] ) which is hopeless.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.