Related papers: Fast Computation of Generalized Dedekind Sums
We solve an open problem proposed in the book ``Computing the continuous discretely" written by Matthias Beck and Sinai Robins. That is, we proposed a polynomial time algorithm for calculating Fourier-Dedekind sums. The algorithm is simple…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
We study a generalization of the classical Dedekind sum that incorporates two Dirichlet characters and develop properties that generalize those of the classical Dedekind sum. By calculating the Fourier transform of this generalized Dedekind…
Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This…
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…
Classical Dedekind sums are connected to the modular group through the construction of a (Dedekind) symbol on the cusp set of the modular group. In this paper we study generalizations of Dedekind symbols and sums that can be associated to…
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
Building upon the work of Stucker, Vennos, and Young we derive generalized Dedekind sums arising from period integrals applied to holomorphic Eisenstein series attached to pairs of primitive non-trivial Dirichlet characters. Furthermore, we…
In this short paper we present an algorithm for finding a solution to a generalized Sudoku.
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
The literature on Dedekind sums is vast. In this expository paper we show that there is a common thread to many generalizations of Dedekind sums, namely through the study of lattice point enumeration of rational polytopes. In particular,…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable…
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
In this paper, we give a refinement of a generalized Dedekind's theorem. In addition, we show that all possible values of integer group determinants of any group are also possible values of integer group determinants of its any abelian…
Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
Let $p_1,p_2,\dots,p_n, a_1,a_2,\dots,a_n \in \N$, $x_1,x_2,\dots,x_n \in \R$, and denote the $k$th periodized Bernoulli polynomial by $\B_k(x)$. We study expressions of the form \[ \sum_{h \bmod{a_k}} \ \prod_{\substack{i=1\\ i\not=k}}^{n}…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
Dedekind sums occur in the transformation behaviour of the logarithm of the Dedekind eta-function under substitutions from the modular group. In 1892, Dedekind showed a reciprocity relation for the Dedekind sums. Apostol generalized…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
Recent advances in optimization theory have shown that smooth strongly convex finite sums can be minimized faster than by treating them as a black box "batch" problem. In this work we introduce a new method in this class with a theoretical…