ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be the set of planar bipartite graphs embedded in a disk satisfying the following conditions: there are nn 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 33 and is called negative; every other interior vertex has degree at least 33 and is called positive; the number of positive interior vertices minus the number of negative interior vertices is exactly kk; and there are no cycles of length less than 66. Let S(k,k,k,1n−3k)S^{(k,k,k,1^{n-3k})} denote the corresponding Specht module. The planar bipartite graph basis conjecture. The cardinality of AA equals the dimension of S(k,k,k,1n−3k)S^{(k,k,k,1^{n-3k})}:

∣A∣=dim⁡S(k,k,k,1n−3k).|A|=\dim S^{(k,k,k,1^{n-3k})}.

This proposes a combinatorial model, analogous to the A2A_2-web basis for S(k,k,k)S^{(k,k,k)}, 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 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.