ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G1=(V1,E1),…,Gq=(Vq,Eq)G_1=(V_1,E_1),\ldots,G_q=(V_q,E_q) be graphs on n1,…,nqn_1,\ldots,n_q vertices, respectively, where each GiG_i is either a complete graph or a tree. Form GG by bridge summing G1G_1 with G2G_2, G2G_2 with G3G_3, and so on, at arbitrary vertices. Let V′=V1∪⋯∪VqV'=V_1\cup\cdots\cup V_q and let N=∣V′∣N=|V'|. Iterated bridge-sum orbit-length conjecture. For all such GG, the orbit length of toric promotion on GG is N(N−1)N(N-1). This is known when all the summands are trees, but remains open for arbitrary mixtures of trees and complete graphs.

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.