On Thursday, November 22, 2012 4:21:02 PM UTC, Simon King wrote:
> Can you give me a pointer for that trickery? I am not so good in C++.
> And actually my plan was to implement it in Cython.
>
Basically you can use integers as template parameters
template
class Monomial
{
Coeff coefficient
Hi!
> ... about fast implementation of path algebras
Does anyone know how things are done in the C sources of KBMag[1]?
After all, it's quite similar in nature: the basic objects are (more
or less) words, and non commutative Gröbner bases are closely related
to Knuth Bendix completions. O
Hi Volker,
On 2012-11-22, Volker Braun wrote:
> Using C++ template trickery one could compile multi-int exponents for a
> range of statically known exponents so that the loop over the exponent
> machine ints can be unrolled.
Can you give me a pointer for that trickery? I am not so good in C++
On Thursday, November 22, 2012 1:55:36 PM UTC, Simon King wrote:
> However, that's only *my* application - but I want it to be useful to
> other people. So, a bounded length may not work.
>
The length bound is just the analog of the exponent bound in Singular.
Clearly you need to be able to in
Hi Volker,
On 2012-11-22, Volker Braun wrote:
> --=_Part_1271_8275328.1353589681337
> Content-Type: text/plain; charset=ISO-8859-1
>
> On Thursday, November 22, 2012 7:37:49 AM UTC, Simon King wrote:
>
>> Bit packed exponents? What does that mean in a path algebra? I thought
>> that monomial
On Thursday, November 22, 2012 7:37:49 AM UTC, Simon King wrote:
> Bit packed exponents? What does that mean in a path algebra? I thought
> that monomials (i.e., paths in the quiver) would rather be represented by
> lists of integers, the integers being the labels of arrows in the quiver.
>
Wha
Hi Volker,
Am Mittwoch, 21. November 2012 13:52:15 UTC+1 schrieb Volker Braun:
>
> A C++/Cython implementation of the basic path algebra arithmetic with
> bit-packed exponents and arbitrary coefficient rings would be a nice thing
> to have though ;-)
Bit packed exponents? What does that mean i
I haven't tried QPA but it seems to be a pure GAP script, so I would expect
that performance will be comparable to a pure Python implementation. But it
looks like a very nice project and its likely that it would be of some use
even if the core computations of a Sage quiver module were implemente
