Results 61 to 70 of about 6,964 (137)

On the value of the Dedekind sum

open access: yesProceedings of the Japan Academy, Series A, Mathematical Sciences, 1987
This paper studies the nth Dedekind sum (which involves powers of the greatest integer function). For \(n=2,3\), the author gives, by elementary methods, recursive formulas which could be used to evaluate these sums.
openaire   +2 more sources

On the values of the Dedekind sum

open access: yesMathematische Zeitschrift, 1985
Let \(S(h,k)\) be the Dedekind sum. We define \(t(h,k)=6k\, s(h,k)\). It is known that \(t(h,k)\) is an integer for all \(h\) and \(k\). The problem we address is that of characterizing, for a given integer \(t\), all pairs \((h,k)\) such that \(t(h,k)=t\).
openaire   +1 more source

p-adic vertex operator algebras. [PDF]

open access: yesRes Number Theory, 2023
Franc C, Mason G.
europepmc   +1 more source

On generalized Dedekind sums

open access: yesJournal of Number Theory, 1979
The sums in question were introduced by \textit{L. Carlitz} [Math. Z. 85, 83--90 (1964; Zbl 0122.05104)] and are defined by \[ s_r(a,b\mid x,y) = \sum_{j=0}^{\vert b\vert - 1} P_r\left(\frac{a(j+y)}{b} + x\right) P_1\left(\frac{j+y}{b}\right) \] where \(r, a, b\) are integers, \(r\ge 0\), \(b\ne 0\), and \(x, y\) are real.
openaire   +2 more sources

Process and Time. [PDF]

open access: yesEntropy (Basel), 2023
Sulis W.
europepmc   +1 more source

Fast computation of generalized dedekind sums

open access: yesInternational Journal of Number Theory
We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.
Preston Tranbarger, Jessica Wang
openaire   +3 more sources

Home - About - Disclaimer - Privacy