ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 2. 4. (H.T. Hall) Suppose that a stream has 2 n bridges across it. A classical

meander is (the homotopy class of) a closed path which crosses each bridge once without intersecting itself. On each side of the stream, the meander is given by a noncrossing pairing of the set [2 n]:= {1, 2,..., 2n}. Noncrossing pairings are naturally in bijection with type A

noncrossing partitions of the set [ n]. Every ordered pair of noncrossing partitions defines a path (with possibly multiple components) which crosses each bridge exactly once. There is a bijection which says that the meanders (the paths with only one connected component) correspond exactly to pairs of noncrossing partitions that are maximally separated in the Hasse diagram of N C An−1 (they are diameters in the graph theoretical sense). Does this bijection suggest a new way to count meanders? One may also use this bijection to define meanders of type W (they are the ordered diameters of the Hasse diagram of N C W ). Is there some combinatorial object that this corresponds to? Is there a type B meander?

Record

Added
Links

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.