The planar bipartite graph basis conjecture for S^(k,k,k,1^n-3k)
Statement
Let be the set of planar bipartite graphs embedded in a disk satisfying the following conditions: there are boundary vertices, all in the same part of a bipartition; every interior vertex is connected to a boundary vertex; every interior vertex in the same bipartition part as the boundary vertices has degree and is called negative; every other interior vertex has degree at least and is called positive; the number of positive interior vertices minus the number of negative interior vertices is exactly ; and there are no cycles of length less than . Let denote the corresponding Specht module. The planar bipartite graph basis conjecture. The cardinality of equals the dimension of :
This proposes a combinatorial model, analogous to the -web basis for , for a basis of the indicated Specht module. The statement is presented as a potential candidate rather than an established result, and its resolution is not given in the source.
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.