Related papers: Fast Computation of Generalized Dedekind Sums
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
Dedekind sums are well-studied arithmetic sums, with values uniformly distributed on the unit interval. Based on their relation to certain modular forms, Dedekind sums may be defined as functions on the cusp set of $SL(2,\mathbb{Z})$. We…
The classical Dedekind sums appear in the transformation behavior of the logarithm of the Dedekind eta-function under substitutions from the modular group. The Dedekind sums and their generalizations are defined in terms of Bernoulli…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
The main purpose of this article is using the analytic mathods and the quadratic residual transformation technique, and properties of Dedekind sums to study the calculating problem of two kinds hybrid power mean involving the two-term…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
We propose a scheme or procedure for doing practical calculations with generalized seniority. It reduces the total computing time by calculating and storing in advance a set of intermediate quantities, taking advantage of the memory…
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We present new, faster pseudopolynomial time algorithms for the $k$-Subset Sum problem, defined as follows: given a set $Z$ of $n$ positive integers and $k$ targets $t_1, \ldots, t_k$, determine whether there exist $k$ disjoint subsets…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
Compression algorithms are important for data oriented tasks, especially in the era of Big Data. Modern processors equipped with powerful SIMD instruction sets, provide us an opportunity for achieving better compression performance.…
We introduce the inversion polynomial for Dedekind sums $f_b(x)=\sum x^{\operatorname{inv}(a,b)}$ to study the number of $s(a,b)$ which have the same value for given $b$. We prove several properties of this polynomial and present some…
The ramification method in Implicit Computational Complexity has been associated with functional programming, but adapting it to generic imperative programming is highly desirable, given the wider algorithmic applicability of imperative…
For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…