Neven Sajko

`in(::Missing, ::Any)` inconsistency

1

```julia-repl julia> missing ∈ () false julia> missing ∈ (7,) missing julia> missing ∈ Set(7) false julia> missing ∈ [] false julia> missing ∈ [7] missing julia> missing ∈ Int[]...

add a `Base.tail` method for nonempty tuples

8

I have some code that sorts tuples using recursion. When the tuple length gets big (over around 65), suddenly I get lots of allocations in my code, when there should...

exponent vector overflow, restarting

8

While trying to find a Groebner basis, a message like this is output: ``` Info: Possible overflow of exponent vector detected. Restarting with at least 32 bits per exponent. ```...

Huge amount of dynamic dispatch

2

```julia-repl julia> using JET, Groebner, AbstractAlgebra julia> _, x = QQ["x"] (Univariate polynomial ring in x over rationals, x) julia> @report_opt groebner([x^3-x^2-1]) ``` The `@report_opt` command prints so many entries...

Performance improvements

4

Prevents run-time dispatch in the most basic `PolynomialRoots.roots` method.

Support for Microsoft's Code editing environment (vscode)

1

It seems there's currently no way to have the tree displayed graphically in the Code editor?

How to convert an univariate polynomial to a multivariate polynomial?

2

Basically the opposite of #220. I've got a univariate polynomial over a multivariate polynomial ring, and I'd like to convert it into a multivariate polynomial ring with one more variable....

Smith normal form seems broken for matrices of rational numbers

3

The same works with Nemo: ```julia-repl julia> using AbstractAlgebra julia> const nums = -10:10 -10:10 julia> const dens = ((-5:-1)..., (1:5)...) (-5, -4, -3, -2, -1, 1, 2, 3, 4,...

This AbstractAlgebra behavior is unexpected, it would be great if this was supported: ``` julia> using LinearAlgebra, AbstractAlgebra julia> [1 0; 0 1] == I true julia> ZZ[1 0; 0...