I have made some additions to posets and lattices, for example
http://trac.sagemath.org/ticket/17121
But I am confused about logic (if any...) behind location of functions on
different places. For example
is_bounded := has_top & has_bottom
and all three functions are defined on hasse_diagram
>
> do you know how to open a trac ticket? As you say, this extension can
> easily be done and thus does probably not require a poll on sage-devel.
>
It is now http://trac.sagemath.org/ticket/17123#ticket
--
You received this message because you are subscribed to the Google Groups
"sage-de
>
> do you know how to open a trac ticket? As you say, this extension can
> easily be done and thus does probably not require a poll on sage-devel.
>
No, but I will try to learn it.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscr
IMHO that should be the aim, but we shouldn't try to enforce it. Really
they are bandaids for cases where upstream does something unreasonable. I
see the spkg-src script more as documentation (its the log of commands
needed on the current tarball) than something that can be run unattended on
ev
Hi Peter,
do you know how to open a trac ticket? As you say, this extension can
easily be done and thus does probably not require a poll on sage-devel.
Best regards,
Simon
On 2014-10-09, Peter Luschny wrote:
> --=_Part_1724_1802019516.1412847516854
> Content-Type: text/plain; charset=UTF-8
In the case of ntl, which probably prompted your email, I was indeed
disappointed that
I didn't have a tar ball ready to upload as a result.
+1 for putting common bits in a central location, that would include
* fetching
* unpacking
* packaging the end product
At least.
François
On 9/10/2014, a
I have noticed that, for most of the spkg-src scripts, it is not
documented at all *how* they should be used. Also the developer
documentation at
http://www.sagemath.org/doc/developer/packaging.html#modified-tarballs
doesn't say what exactly such a script should do.
This is because these are mo
A simple and coherent extension of the binomial function
to negative integers n, k was outlined by M. J. Kronenburg in
The Binomial Coefficient for Negative Arguments,
http://arxiv.org/abs/1105.3689
This extension amounts to define
def BINOMIAL(n, k):
if n >= 0 and k >= 0:
return b
