-
I have not yet written unit tests for the TCP FSM. We need these especially if we are going to make changes to the FSM so we don't introduce bugs. What would these tests look like? These states make s…
-
This is a continuation of the work started in tickets #30400, #30447. It is expected to add methods about computing homology groups of h-regular spaces. Also, the computation of homologically admiss…
-
Played a game today where one player was requesting a rollback and the other was denying it, continuously, for ages. Neither player would change their mind and then there's just me who has to click ev…
-
We have
```
sage: F.=GF(9)
sage: R.=F[]
sage: a*x+1
(a)*x + 1
```
There, clearly the parentheses around `a` are unnecessary. In the univariate case, the phenomenon does not appear:
```
sage: S.=F[…
-
Given the following automaton
```
aut = Automaton({'p':[('p','b'),('q','a')], 'q':[('r','a'), ('r','b')], 'r':[('p','a'),('p','b')]}, initial_states=['p'], final_states=['r'])
```
and its kleene st…
-
Attempt to compute `discrete_log(M,M)` for a matrix `M` over a finite field results in one of two errors:
> ValueError: No discrete log of ... found to base ...
or
> TypeError: mutable matrices a…
-
This is inspired by sympy where usually every assumption maps to a query method
```
>>> x = Symbol('x',positive=True)
>>> assumptions(x + I)
{'commutative': True, 'complex': True, 'composite': Fa…
-
On my laptop, it takes almost 1 second to create a polynomial of degree 10000 over F_125:
```
sage: k = GF(5^3)
sage: S. = k[]
sage: L = [ k.random_element() for _ in range(10000) ]
…
-
One would expect the performance of casting the usual way (as in test 1 below) to be at least not much worse than test 2:
```
sage: QQX=QQ['x']
sage: QP=Qp(3,30);
sage: R=QP.residue_field();
sage: …
-
I'm submitting a bug probably. I am maybe wrong, but I tried using the fine state machine in my project and I got a bug where the walk animation wouldn't play if you held down walk keys before attack …