Related papers: Computing discrete logarithms in subfields of resi…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
We introduce and study a derived version $\mathbf L\mathrm{Bin}$ of the binomial monad on the unbounded derived category $\mathscr D(\mathbb Z)$ of $\mathbb Z$-modules. This monad acts naturally on singular cohomology of any topological…
We introduce excess logarithmic residues for one-dimensional holomorphic foliations tangent to a divisor. They arise from the comparison between the logarithmic normal sheaf and the ordinary normal sheaf of the foliation, and measure the…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
We investigate the first order implicit linear difference equation over residue class rings modulo m. We prove an existence criterion and establish the amount of solutions for this equation. We obtain analogous results for the initial…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.
The ring $\text{Diff}_{\mathbf{h}}(n)$ of $\mathbf{h}$-deformed differential operators appears in the theory of reduction algebras. In this thesis, we construct the rings of generalized differential operators on the $\mathbf{h}$-deformed…
This paper develops a systematic approach to infinitesimal variations of Hodge structure for singular and equisingular families by means of logarithmic geometry and residue theory. The central idea is that logarithmic vector fields encode…
Regev recently introduced a quantum factoring algorithm that may be perceived as a $d$-dimensional variation of Shor's factoring algorithm. In this work, we extend Regev's factoring algorithm to an algorithm for computing discrete…
This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…
We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
Motivated by some algorithmic problems, we give lower bounds on the size of the multiplicative groups containing rational function images of low-dimensional affine subspaces of a finite field~$\mathbb{F}_{q^n}$ considered as a linear space…
An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know,…
We formulate the Root Extraction problem in finite Abelian $p$-groups and then extend it to generic finite Abelian groups. We provide algorithms to solve them. We also give the bounds on the number of group operations required for these…