ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S(a,b)S(a,b) be the normalized Dedekind sum, and write a value in lowest terms as S(a,b)=k/qS(a,b)=k/q, where q≥2q\geq 2 and gcd⁡(k,q)=1\gcd(k,q)=1. Girstmair's necessary conditions are that 3∣k3\mid k when 3∤q3\nmid q, and, when 2∤q2\nmid q, that

k≡{2(mod4)q≡3(mod4),0(mod8)q is a square,0(mod4)otherwise.k\equiv\begin{cases}2\pmod{4} & q\equiv 3\pmod{4},\\\\0\pmod{8} & q\text{ is a square},\\\\0\pmod{4} & \text{otherwise.}\end{cases}

Girstmair's conjecture. For integers k,qk,q with q≥2q\geq 2 and gcd⁡(k,q)=1\gcd(k,q)=1, there exist coprime integers a,ba,b with b≥1b\geq 1 and S(a,b)=k/qS(a,b)=k/q if and only if these conditions hold. The conjecture describes exactly which rational numbers with prescribed denominator occur as normalized Dedekind sums; the paper verifies it for even qq, certain square denominators, and 2≤q≤2002\leq q\leq 200, but the general case remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.