The generalized lock inequality for positive words
Statement
Let be a positive word of the form
Suppose that , where is reduced. Generalized lock inequality. Then
For the linear representation with and , one has ; thus the conjecture asserts that extremal representations become closer to the linear representation as the denominator of increases. It generalizes the lock inequality and is supported by experimental evidence.
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.