In #19280, I added a patch file to package mpir, the package itself and its
version did not change.
I can force manual recompilation of the package using sage -p (or sage -f).
My question: how can I force recompilation of that package automatically? Say,
if #19280 is merged in a beta release, how
More on docstrings:
"The Frattini sublattice `\Phi(L)` is the intersection - -" vs. "Returns
the Frattini subgroup of ``self``. The Frattini - -".
1) Should we include symbols in docstrings? I.e. add \otimes to
ordinal_product() of posets, as used in Enumerative combinatorics?
2) What about
In Maple 'is' is part of the assume mechanism
http://www.maplesoft.com/support/help/maple/view.aspx?path=assume
and returns True, False or FAIL (if it cannot determine whether the
property is always satisfied). Maple also has 'evalb' and 'testeq'
with somewhat different semantics.
Are you propo
On 2015-09-25, Kwankyu Lee wrote:
> The ticket is waiting for a reviewer. Please!
Which one?
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr.
On Thursday, September 24, 2015 at 8:22:53 PM UTC+2, Bill Page wrote:
>
> What answer should be expected when it is not possible to show that an
> expression is zero? Would you expect that
>
>ex.is_zero() = not(ex.is_nonzero()) ?
>
Yes, for constant expressions (i.e. not containing symbols
The ticket is waiting for a reviewer. Please!
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send
On Thursday, 24 September 2015 17:02:23 UTC-7, Volker Braun wrote:
>
> On Friday, September 25, 2015 at 1:51:04 AM UTC+2, Dima Pasechnik wrote:
>>
>> Just as LLL, and probably even BKZ, are. And I wonder why Sage has LLL
>> and BKZ just fine, but cannot take one more relatively common abbreviati
On Friday, September 25, 2015 at 1:51:04 AM UTC+2, Dima Pasechnik wrote:
>
> Just as LLL, and probably even BKZ, are. And I wonder why Sage has LLL and
> BKZ just fine, but cannot take one more relatively common abbreviation.
>
Google for "LLL" and its in the first 10 hits. I define that as "rela
On Thursday, 24 September 2015 15:45:37 UTC-7, Volker Braun wrote:
>
> On Friday, September 25, 2015 at 12:36:20 AM UTC+2, Dima Pasechnik wrote:
>>
>> FYI, Mathscinet finds 8 papers with abbreviation ...
>>>
>>
> That is utterly irrelevant, MathSciNet only indexes research papers. So
> its obvio
On Friday, September 25, 2015 at 12:36:20 AM UTC+2, Dima Pasechnik wrote:
>
> FYI, Mathscinet finds 8 papers with abbreviation ...
>>
>
That is utterly irrelevant, MathSciNet only indexes research papers. So its
obviously biased towards cutting-edge research. If anything, a large number
of hits o
On Thursday, 24 September 2015 15:34:46 UTC-7, Dima Pasechnik wrote:
>
>
>
> On Thursday, 24 September 2015 15:02:39 UTC-7, Volker Braun wrote:
>>
>> On Thursday, September 24, 2015 at 11:18:58 PM UTC+2, Dima Pasechnik
>> wrote:
>>>
>>> IMHO abbreviations are OK when they are known to basically
On Thursday, 24 September 2015 15:02:39 UTC-7, Volker Braun wrote:
>
> On Thursday, September 24, 2015 at 11:18:58 PM UTC+2, Dima Pasechnik wrote:
>>
>> IMHO abbreviations are OK when they are known to basically every
>>> mathematician, e.g. ZZ. Which translates to about undergrad level. Just as
On Thursday, September 24, 2015 at 11:18:58 PM UTC+2, Dima Pasechnik wrote:
>
> IMHO abbreviations are OK when they are known to basically every
>> mathematician, e.g. ZZ. Which translates to about undergrad level. Just ask
>> a undergraduate student what a T2starGQ graph is and you'll have your
On Thursday, 24 September 2015 14:18:58 UTC-7, Dima Pasechnik wrote:
>
>
>
> On Thursday, 24 September 2015 13:28:45 UTC-7, Volker Braun wrote:
>>
>> On Thursday, September 24, 2015 at 8:08:36 PM UTC+2, Dima Pasechnik wrote:
>>>
>>> We have dozens of examples in Sage where well-established abbrev
On Thursday, 24 September 2015 13:28:45 UTC-7, Volker Braun wrote:
>
> On Thursday, September 24, 2015 at 8:08:36 PM UTC+2, Dima Pasechnik wrote:
>>
>> We have dozens of examples in Sage where well-established abbreviations
>> are used, without aliases.
>> E.g. matrices have LU() and LLL() metho
On Thursday, September 24, 2015 at 8:08:36 PM UTC+2, Dima Pasechnik wrote:
>
> We have dozens of examples in Sage where well-established abbreviations
> are used, without aliases.
> E.g. matrices have LU() and LLL() methods, or e.g. groups.matrix.GL
> groups.matrix.GO groups.matrix.GU
>
IMHO a
On Thu, 24 Sep 2015, Dima Pasechnik wrote:
We have dozens of examples in Sage where well-established abbreviations are
used, without aliases.
E.g. matrices have LU() and LLL() methods, or e.g. groups.matrix.GL
groups.matrix.GO groups.matrix.GU
LLL is mentioned in the developer's guide: "Use a
What answer should be expected when it is not possible to show that an
expression is zero? Would you expect that
ex.is_zero() = not(ex.is_nonzero()) ?
I suppose that I should expect True or False from
bool(ex=0)
and False in the case that it cannot be shown to be true. But I am not
so sur
On Thursday, 24 September 2015 10:11:24 UTC-7, Nathann Cohen wrote:
>
> > You are invited to open a ticket demanding that the function
> > rshcd_from_close_prime_powers()
> > be called
> >
> regular_symmetric_hadamard_matrix_with_constant_diagonal_from_close_prime_powers()
>
>
>
> I hope th
On 24 September 2015 at 03:49, Johan S. R. Nielsen wrote:
>> rings.integral_domains.DVR()
>> instead of
>> rings.integral_domains.DiscreteValuationRing()
>
> I would definitely prefer DiscreteValuationRing() here.
>
> Mathematics is pretty verbosely written, and I think Sage should reflect
> how m
> You are invited to open a ticket demanding that the function
> rshcd_from_close_prime_powers()
> be called
> regular_symmetric_hadamard_matrix_with_constant_diagonal_from_close_prime_powers()
I hope that you will not blame me for shortening this function, as
indeed its full name is (precisely) 8
I do have quicklisp setup, and I have never seen any problems with it.
Could it be that it's ECL that is guilty,
not Maxima...
e.g. can you run
sage --ecl
at the command prompt?
On Thursday, 24 September 2015 07:40:43 UTC-7, Bill Janssen wrote:
>
> I'll see if I can figure that out. Th
You are invited to open a ticket demanding that the function
rshcd_from_close_prime_powers()
in
https://github.com/sagemath/sage/blob/develop/src/sage/combinat/matrices/hadamard_matrix.py
(already merged in 6.9.beta*)
be called regular_symmetric_hadamard_matrix_with_constant_diagonal
_from_c
On Thursday, September 24, 2015 at 3:02:05 PM UTC+2, vdelecroix wrote:
>
> def is_zero(self):
> return not self
>
This is the same as return not bool(self) which calls self.__nonzero__().
this works
>
> sage: matrix([x==3])
> [x == 3]
>
> Should it?
>
That seems no longer relevant (I
I'll see if I can figure that out. The Lisp is ECL, which I'm not very
familiar with.
Bill
On Wednesday, September 23, 2015 at 11:57:38 PM UTC-7, François wrote:
>
>
> > On 24/09/2015, at 16:51, Bill Janssen >
> wrote:
> >
> > Compiling Sage from scratch (6.8 sources) fails because the maxim
On 24/09/15 03:47, Ralf Stephan wrote:
ex.is_zero(simplify=False)
ex.is_zero(simplify=True)
This fits if ex is an equality. But what about: if x>0 ?
Two functions are necessary for inequalities because (x>0).__nonzero__
is called by (x>0)._cmp_ in case of eg. uniq(list of exes) and
here
> rings.integral_domains.DVR()
> instead of
> rings.integral_domains.DiscreteValuationRing()
I would definitely prefer DiscreteValuationRing() here.
Mathematics is pretty verbosely written, and I think Sage should reflect
how most mathematics is written. I'm in a research field with strong
inter
27 matches
Mail list logo
