(The conjecture is a homological algebra question, but question 2 is a pure combinatorics question given that the conjecture is true)
A Dyck path of length n is a list of positive integers [c1,c2,...,cn] with ci−1≤ci+1 for all i and ci≥2 for i≠n and cn=1. (One can show that those sequences really correspond to the classical Dyck paths via the area sequence and the number of Dyck paths of length n is Cn−1 when Cn denotes the Catalan numbers). Dyck paths can get naturally identified with the Nakayama algebra AD with a linear quiver having Kupisch series [c1,c2,...,cn], see for example https://arxiv.org/abs/1811.05846 .
Let D=[c1,c2,...,cn] be a Dyck path of length n. We define the Cartan matrix CD of D as the n×n upper triangular matrix with entries 0 or 1 as follows: In the i-th row CD has entries equal to one in position (i,i), (i,i+1),...,(i,i+ci−1) and all other entries are zero. Define the Coxeter matrix ϕD as −C−1DCTD and the coxeter polynomial pD as the characteristic polynomial of this matrix.
We say that a Dyck path is of Dynkin type Q in case the corresponding Nakayama algebra AD is derived equivalent to KQ.
Conjecture: A Dyck path D is of Dynkin type Q if and only if the algebra AD has coxeter polynomial pQ.
This is true for type An as was proven in What are the periodic Dyck paths? by Gjergji Zaimi (together with the fact that bouncing Nakayama algebras are exactly those of Dynkin type An, which can be proved by using special tilting modules). With the help of a computer it is also true for all exceptional types E6,E7 and E8 and true for Di for i=4,5,6,7,8,9 (which is why I made it a conjecture now), but maybe there is a nice uniform proof that works for all types.
In the theorem of page 23 in http://prospero.dmat.usherbrooke.ca/ibrahim/publications/Alg%C3%A8bres_pr%C3%A9inclin%C3%A9es_et_cat%C3%A9gories_d%C3%A9riv%C3%A9es.pdf one can find a homological characterisation when a (Nakayama) algebra/Dyck path is of Dynkin type Dn.
We have for the Dynkin types: pAn=xn+xn−1+xn−2+....+x2+x+1, pDn=xn+xn−1+x+1, pE6=x61+x51−x31+x1+1, pE7=x71+x61−x41−x31+x1+1, pE8=x81+x71−x51−x41−x31+x1+1. See for example Table 1.1. in the book "Notes on Coxeter Transformations and the McKay Correspondence" by Rafael Stekolshchik.
The bouncing Dyck paths are exactly the Dyck paths of Dynkin type An and there are 2n−2 many. A classification/enumeration seems not so easy in type Dn, which leads to the following question:
Question 2: How many Dyck paths are there for a given n with Coxeter polynomial equal to pDn (call this sequence an)? How many Dyck paths are there for a given n that are of Dynkin type Dn (call this sequence bn)?
Note that in case the conjecture is true, we have an=bn and calculating an is a purely elementary problem. The sequence an starts for n=4,5,6,7,8 with 1,6,13,29,65 and does not appear in the oeis. Here are the Dyck paths with Coxeter polynomial equal to pDn for n=4,5,6,7. Maybe someone sees a pattern what they might be:
D4:
[ [ 3, 3, 2, 1 ] ]
D5:
[ [ 3, 3, 2, 2, 1 ],
[ 2, 3, 3, 2, 1 ],
[ 3, 3, 3, 2, 1 ],
[ 4, 3, 3, 2, 1 ],
[ 3, 4, 3, 2, 1 ],
[ 4, 4, 3, 2, 1 ] ]
D6:
[ [ 3, 3, 2, 2, 2, 1 ],
[ 3, 3, 3, 2, 2, 1 ],
[ 3, 4, 3, 2, 2, 1 ],
[ 3, 3, 2, 3, 2, 1 ],
[ 2, 2, 3, 3, 2, 1 ],
[ 3, 2, 3, 3, 2, 1 ],
[ 2, 3, 3, 3, 2, 1 ],
[ 4, 3, 3, 3, 2, 1 ],
[ 2, 4, 3, 3, 2, 1 ],
[ 5, 4, 3, 3, 2, 1 ],
[ 3, 3, 4, 3, 2, 1 ],
[ 3, 5, 4, 3, 2, 1 ],
[ 5, 5, 4, 3, 2, 1 ] ]
D7:
[ [ 3, 3, 2, 2, 2, 2, 1 ],
[ 3, 3, 3, 2, 2, 2, 1 ],
[ 3, 4, 3, 2, 2, 2, 1 ],
[ 3, 3, 2, 3, 2, 2, 1 ],
[ 2, 3, 3, 3, 2, 2, 1 ],
[ 4, 3, 3, 3, 2, 2, 1 ],
[ 3, 3, 4, 3, 2, 2, 1 ],
[ 3, 5, 4, 3, 2, 2, 1 ],
[ 3, 3, 2, 2, 3, 2, 1 ],
[ 3, 3, 3, 2, 3, 2, 1 ],
[ 3, 4, 3, 2, 3, 2, 1 ],
[ 2, 2, 2, 3, 3, 2, 1 ],
[ 3, 2, 2, 3, 3, 2, 1 ],
[ 2, 3, 2, 3, 3, 2, 1 ],
[ 4, 3, 2, 3, 3, 2, 1 ],
[ 2, 2, 3, 3, 3, 2, 1 ],
[ 3, 2, 3, 3, 3, 2, 1 ],
[ 2, 4, 3, 3, 3, 2, 1 ],
[ 5, 4, 3, 3, 3, 2, 1 ],
[ 2, 2, 4, 3, 3, 2, 1 ],
[ 3, 2, 4, 3, 3, 2, 1 ],
[ 2, 5, 4, 3, 3, 2, 1 ],
[ 6, 5, 4, 3, 3, 2, 1 ],
[ 3, 3, 2, 4, 3, 2, 1 ],
[ 2, 3, 3, 4, 3, 2, 1 ],
[ 4, 3, 3, 4, 3, 2, 1 ],
[ 3, 3, 5, 4, 3, 2, 1 ],
[ 3, 6, 5, 4, 3, 2, 1 ],
[ 6, 6, 5, 4, 3, 2, 1 ] ]
Here are the Dyck paths of Dynkin type E6:
[ [ 2, 3, 3, 2, 2, 1 ],
[ 4, 3, 3, 2, 2, 1 ],
[ 4, 4, 3, 2, 2, 1 ],
[ 3, 3, 3, 3, 2, 1 ],
[ 4, 4, 3, 3, 2, 1 ],
[ 2, 3, 4, 3, 2, 1 ],
[ 4, 3, 4, 3, 2, 1 ],
[ 2, 4, 4, 3, 2, 1 ],
[ 3, 4, 4, 3, 2, 1 ],
[ 4, 4, 4, 3, 2, 1 ],
[ 5, 4, 4, 3, 2, 1 ],
[ 4, 5, 4, 3, 2, 1 ] ]
(there are 12 Dyck paths with Coxeter polynomial pE6, 54 with Coxeter polynomial pE7 and 133 with Coxeter polynomial pE8.)
Note that it is in general not true that having the same Coxeter polynomial as KQ implies that a finite dimensional algebra is derived to KQ( there even non-derived equivalent examples with the same Cartan matrix), so the conjecture might be special to Nakayama algebras in case it is true.