Beating LLL
Statement
Consider a matrix where both columns are rows are t-sparse. LLL gives a discrepancy bound of here. If we assume the stronger property that every pair of rows intersect in at most one element, can we get a ?
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.