With the same lattice and S-oval notation, how many distinct configurations J(r,P), up to translation by an integer vector, have weight N(r,P)=n (call this number K(n)), or…
Statement
With the same lattice and S-oval notation, how many distinct configurations J(r,P), up to translation by an integer vector, have weight N(r,P)=n (call this number K(n)), or have weight N(r,P)≤N (call this number M(N))?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.