Related papers: Fast Computation of Generalized Dedekind Sums

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…

We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized…

We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…

In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…

A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…

We review the cumulant decomposition (a way of decomposing the expectation of a product of random variables (e.g. $\mathbb{E}[XYZ]$) into a sum of terms corresponding to partitions of these variables.) and the Wick decomposition (a way of…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

The main objective of this paper is to introduce an algorithm for solving fractional and classical differential equations based on a new generalized fractional power series. The algorithm relies on expanding the solution of an FDE or an ODE…

We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…

In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…

We present a new strongly polynomial algorithm for generalized flow maximization that is significantly simpler and faster than the previous strongly polynomial algorithm [V\'egh16]. For the uncapacitated problem formulation, the complexity…

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…

The problem of writing a totally positive element as a sum of squares has a long history in mathematics, going back to Bachet and Lagrange. While for some specific rings (like integers or polynomials over the rationals), there are known…

An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…