Existence of symmetric maximal noncrossing collections of k-element sets

For \(n\in {\mathbb N}\) write \([n]=\{1,\ldots,n\}\) and consider \(\pmod{n}\) addition \(+^n\) in \([n]\), that is, for \(a,b\in [n]\), \(a+^nb=a+b\) if \(a+n\in [n]\) and \(a+^nb=a+b-n\) otherwise. Assume that \([n]\) has the cyclic order \(S_{[n]}:[n]\rightarrow [n]\) given by \(S_{[n]}(x)=x+^n1\) with corresponding order \(a<_{\circ}b\) iff \(S_{[n]}(a)=b\). For \(0<k\leq n\) and for a collection \({\mathcal C}\) of subsets of \([n]\) let \({\mathcal C}+^nk\) denote the collection of subsets \(I+^nk=\{x+^nk:x\in I\}\) for \(I\in {\mathcal C}\). A collection \({\mathcal C}\) of size \(k\) subsets of \([n]\) is \textit{symmetric} if \({\mathcal C}={\mathcal C}+^nk\) and the collection \({\mathcal C}\) is said to be a \((k,n)\)-\textit{non-crossing collection} if \(I\) and \(J\) are non-crossing for all \(I,J\in {\mathcal C}\), that is, there are no cyclically ordered elements \(a<_{\circ}b<_{\circ}c<_{\circ}d\) in \([n]\) such that \(a,c\in I\setminus J\) and \(b,d\in J\setminus I\). \textit{A. Pasquali} in [Algebr. Represent. Theory 23, No. 3, 1197--1235 (2020; Zbl 1458.16016)] showed that for a pair \((k,n)\), any maximal symmetric \((k,n)\)-non-crossing collection gives rise to a self-injective Jacobian algebra. This leads to the question for which pairs \((k,n)\) does there exist a maximal symmetric \((k,n)\)-non-crossing collection. The main result of the paper under review is that such maximal symmetric \((k,n)\)-non-crossing collection exists if and only if \(k\equiv 0,1,-1\pmod{n/\gcd(k,n)}\). To prove the result, the authors use a characterization of \textit{O. Suho} et al.[Proc. Lond. Math. Soc. (3) 110, No. 3, 721--754 (2015; Zbl 1309.05182] that a non-crossing \((k,n)\)-collection \({\mathcal C}\) is maximal if and only if \(|{\mathcal C}|=k(n-k)+1\). Hence, the question becomes: for which pairs \((k,n)\) does there exist a symmetric non-crossing collection \({\mathcal C}\) of cardinality \(k(n-k)+1\). Thus, the strategy of the proof is to construct collections of non-crossing \((k,n)\) sets and prove that they have the required cardinality. In the last section of the article the authors give some representation-theoretic consequences of their main combinatorial theorem. The main idea is that by embedding a maximal \((k,n)\)-non-crossing collection into the plane \({\mathbb R}^2\) one obtains a quiver with potential and associated to it there is a corresponding Jacobian algebra. One interesting consequence of the main combinatorial theorem is the existence of infinitely many self-injective Jacobian algebras and a second corollary is the existence of infinitely many such algebras with a Nakayama automorphism of any given order.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Existence of symmetric maximal noncrossing collections of \(k\)-element sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196482)