***************************************************************************** * www.FindStat.org - The Combinatorial Statistic Finder * * * * Copyright (C) 2019 The FindStatCrew * * * * This information is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. * ***************************************************************************** ----------------------------------------------------------------------------- Statistic identifier: St000689 ----------------------------------------------------------------------------- Collection: Dyck paths ----------------------------------------------------------------------------- Description: The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. The correspondence between LNakayama algebras and Dyck paths is explained in [[St000684]]. A module $M$ is $n$-rigid, if $\operatorname{Ext}^i(M,M)=0$ for $1\leq i\leq n$. This statistic gives the maximal $n$ such that the minimal generator-cogenerator module $A \oplus D(A)$ of the LNakayama algebra $A$ corresponding to a Dyck path is $n$-rigid. An application is to check for maximal $n$-orthogonal objects in the module category in the sense of [2]. ----------------------------------------------------------------------------- References: [1] Marczinzik, R. Upper bounds for the dominant dimension of Nakayama and related algebras [[arXiv:1605.09634]] [2] Iyama, O. Higher-dimensional Auslander-Reiten theory on maximal orthogonal subcategories [[MathSciNet:2298819]] [[arXiv:math/0407052]] ----------------------------------------------------------------------------- Code: ----------------------------------------------------------------------------- Statistic values: [1,0] => 0 [1,0,1,0] => 1 [1,1,0,0] => 0 [1,0,1,0,1,0] => 2 [1,0,1,1,0,0] => 0 [1,1,0,0,1,0] => 0 [1,1,0,1,0,0] => 1 [1,1,1,0,0,0] => 0 [1,0,1,0,1,0,1,0] => 3 [1,0,1,0,1,1,0,0] => 0 [1,0,1,1,0,0,1,0] => 0 [1,0,1,1,0,1,0,0] => 1 [1,0,1,1,1,0,0,0] => 0 [1,1,0,0,1,0,1,0] => 0 [1,1,0,0,1,1,0,0] => 0 [1,1,0,1,0,0,1,0] => 1 [1,1,0,1,0,1,0,0] => 1 [1,1,0,1,1,0,0,0] => 0 [1,1,1,0,0,0,1,0] => 0 [1,1,1,0,0,1,0,0] => 0 [1,1,1,0,1,0,0,0] => 1 [1,1,1,1,0,0,0,0] => 0 [1,0,1,0,1,0,1,0,1,0] => 4 [1,0,1,0,1,0,1,1,0,0] => 0 [1,0,1,0,1,1,0,0,1,0] => 0 [1,0,1,0,1,1,0,1,0,0] => 1 [1,0,1,0,1,1,1,0,0,0] => 0 [1,0,1,1,0,0,1,0,1,0] => 0 [1,0,1,1,0,0,1,1,0,0] => 0 [1,0,1,1,0,1,0,0,1,0] => 2 [1,0,1,1,0,1,0,1,0,0] => 1 [1,0,1,1,0,1,1,0,0,0] => 0 [1,0,1,1,1,0,0,0,1,0] => 0 [1,0,1,1,1,0,0,1,0,0] => 0 [1,0,1,1,1,0,1,0,0,0] => 1 [1,0,1,1,1,1,0,0,0,0] => 0 [1,1,0,0,1,0,1,0,1,0] => 0 [1,1,0,0,1,0,1,1,0,0] => 0 [1,1,0,0,1,1,0,0,1,0] => 0 [1,1,0,0,1,1,0,1,0,0] => 0 [1,1,0,0,1,1,1,0,0,0] => 0 [1,1,0,1,0,0,1,0,1,0] => 1 [1,1,0,1,0,0,1,1,0,0] => 0 [1,1,0,1,0,1,0,0,1,0] => 1 [1,1,0,1,0,1,0,1,0,0] => 2 [1,1,0,1,0,1,1,0,0,0] => 0 [1,1,0,1,1,0,0,0,1,0] => 0 [1,1,0,1,1,0,0,1,0,0] => 0 [1,1,0,1,1,0,1,0,0,0] => 1 [1,1,0,1,1,1,0,0,0,0] => 0 [1,1,1,0,0,0,1,0,1,0] => 0 [1,1,1,0,0,0,1,1,0,0] => 0 [1,1,1,0,0,1,0,0,1,0] => 0 [1,1,1,0,0,1,0,1,0,0] => 0 [1,1,1,0,0,1,1,0,0,0] => 0 [1,1,1,0,1,0,0,0,1,0] => 1 [1,1,1,0,1,0,0,1,0,0] => 1 [1,1,1,0,1,0,1,0,0,0] => 1 [1,1,1,0,1,1,0,0,0,0] => 0 [1,1,1,1,0,0,0,0,1,0] => 0 [1,1,1,1,0,0,0,1,0,0] => 0 [1,1,1,1,0,0,1,0,0,0] => 0 [1,1,1,1,0,1,0,0,0,0] => 1 [1,1,1,1,1,0,0,0,0,0] => 0 ----------------------------------------------------------------------------- Created: Jan 18, 2017 at 00:26 by Rene Marczinzik ----------------------------------------------------------------------------- Last Updated: Jan 18, 2017 at 16:34 by Martin Rubey