ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an odd prime pp, let per⁡\operatorname{per} denote the permanent. For a prime p>3p>3 and an integer a≢0(modp)a\not\equiv0\pmod p, consider permutations τ∈Sp\tau\in S_p such that pp divides none of the integers aj+τ(j)aj+\tau(j). The permanent congruence conjecture.

(i) For every odd prime pp,

per⁡[∣j−k∣]1⩽j,k⩽p≡−12(modp)\operatorname{per}[|j-k|]_{1\leqslant j,k\leqslant p}\equiv-\frac12\pmod p

and

per⁡[∣j−k+1∣]1⩽j,k⩽p≡12(modp).\operatorname{per}[|j-k+1|]_{1\leqslant j,k\leqslant p}\equiv\frac12\pmod p.

(ii) For every prime p>3p>3 and integer a≢0(modp)a\not\equiv0\pmod p,

∑τ∈Spp∣(aj+τ(j)) for no⁡ j∏j=1p1aj+τ(j)≡0(modp2).\sum_{\substack{\tau\in S_p\\p\mid(aj+\tau(j))\ \operatorname{for\ no}\ j}}\prod_{j=1}^p\frac1{aj+\tau(j)}\equiv0\pmod{p^2}.

The two permanent congruences were verified in the paper for all odd primes p⩽23p\leqslant23, while the general assertions remain open in the supplied text.

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.