denisrosset / alasc Goto Github PK
View Code? Open in Web Editor NEWComputational Group Theory in Scala. It's Scala permuted!
Computational Group Theory in Scala. It's Scala permuted!
Add missing hashCode to those, and maybe other classes in Alasc
Observed in Faacets using the Chen2008 inequality for 5 outputs.
This method dominates in the number of allocations, allocating SeqViewLike and friends.
Idea: implement everything as Iterables at the top level, using iterators on the nodes.
It's not a given that the action used to represent the group can represent the provided element as well.
Move implicit PermutationAction[Q]
to explicit parameter.
Right now, areConjugate
, findConjugation
, centralizer
assume that g
(or g1
, g2
) are elements of grp
.
This can be relaxed by
Checking whether the provided elements are contained in the group. If so, proceed as now.
If not, recompute a faithful action for the group that is compatible with the provided elements, and proceed to the computation.
This is to avoid recomputation of representations from generators in code where the representation is fixed.
Verify that this is the case everywhere.
Probably not, some can keep closures (ex: LazyGroup with random element function). Before using serialization, an audit should be performed.
There is no reason to prefer BigInt
, as SafeLong
is faster.
Hi, not sure if I'm doing something wrong but I don't think the dependencies (I think qalg and/or metal) are not published anywhere, and themselves are not stable/building. What can be done to have a stable base core? Are we waiting for something upstream (Cats)?
Perm(3,4,5,3)
result in an infinite loop that eventually consumes all memory.
We should probably filter duplicates or throw an IllegalArgumentException
.
Stack trace for the above:
java.lang.OutOfMemoryError: GC overhead limit exceeded
at scala.collection.immutable.List.$colon$colon(List.scala:112)
at net.alasc.perms.Cycle$.rec$1(Cycle.scala:96)
at net.alasc.perms.Cycle$.orbit(Cycle.scala:98)
at net.alasc.perms.Cycles$.rec$1(Cycles.scala:103)
at net.alasc.perms.Cycles$.fromSupportAndImageFun(Cycles.scala:108)
at net.alasc.perms.internal.GenPrmOps$.toCycles$extension(GenPrmOps.scala:52)
at net.alasc.perms.Perm.toString(Perm.scala:17)
at scala.runtime.ScalaRunTime$.inner$1(ScalaRunTime.scala:250)
at scala.runtime.ScalaRunTime$.stringOf(ScalaRunTime.scala:255)
at scala.runtime.ScalaRunTime$.replStringOf(ScalaRunTime.scala:263)
at .$print$lzycompute(<console>:10)
at .$print(<console>:6)
at $print(<console>)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.lang.reflect.Method.invoke(Method.java:498)
at scala.tools.nsc.interpreter.IMain$ReadEvalPrint.call(IMain.scala:735)
at scala.tools.nsc.interpreter.IMain$Request.loadAndRun(IMain.scala:999)
at scala.tools.nsc.interpreter.IMain.$anonfun$interpret$1(IMain.scala:567)
at scala.tools.nsc.interpreter.IMain$$Lambda$4658/2087216452.apply(Unknown Source)
at scala.reflect.internal.util.ScalaClassLoader.asContext(ScalaClassLoader.scala:34)
at scala.reflect.internal.util.ScalaClassLoader.asContext$(ScalaClassLoader.scala:30)
at scala.reflect.internal.util.AbstractFileClassLoader.asContext(AbstractFileClassLoader.scala:33)
at scala.tools.nsc.interpreter.IMain.loadAndRunReq$1(IMain.scala:566)
at scala.tools.nsc.interpreter.IMain.interpret(IMain.scala:593)
at scala.tools.nsc.interpreter.IMain.interpret(IMain.scala:563)
at scala.tools.nsc.interpreter.ILoop.interpretStartingWith(ILoop.scala:886)
at scala.tools.nsc.interpreter.ILoop.command(ILoop.scala:754)
at scala.tools.nsc.interpreter.ILoop.processLine(ILoop.scala:456)
at scala.tools.nsc.interpreter.ILoop.loop(ILoop.scala:477)
at scala.tools.nsc.interpreter.ILoop.process(ILoop.scala:1069)
by adding generators one by one to the orbit, and stopping as soon as the orbit is complete, then removing redundant generators in bulk.
Cf. the symmetry group of the Chen 2008 inequality (d=5) in Faacets, where the subgroup search produces ~950 generators for a group of order 2400. The removal takes ages.
The contravariant instance will be different for PermutationAction
and FaithfulPermutationAction
when calling isFaithful
.
TODO: refactor the usages in symdpoly
after that.
As Grp is an immutable object, it should be thread-safe.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.