1 citations · 1 across the 5 of their papers we have counts for
6 papers
Interpolation by decomposable univariate polynomials
Joachim von zur Gathen, Guillermo Matera
The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is…
Counting invariant subspaces and decompositions of additive polynomials
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f…
Shifted varieties and discrete neighborhoods around varieties
Joachim von zur Gathen, Guillermo Matera
In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices i…
Iteration entropy
Joachim von zur Gathen
We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asy…
Sidon sets and statistics of the ElGamal function
Lucas Boppré Niehues, Joachim von zur Gathen, Lucas Pandolfo Perin +1
In the ElGamal signature and encryption schemes, an element of the underlying group for a prime is also considered as an exp…
Counting decomposable multivariate polynomials
Joachim von zur Gathen
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of th…