… If there are no short cycles we show that there exist only finitely many … that mod A contains
no short cycle, then A is of finite representation type. This … Thus we get a short cycle in mod A. …

… in ind A passing through M is finite. Obviously, every nondirecting indecomposable
module over an algebra of finite representation type is cycle-finite. Examples of cycle-finite …

… shifts of finite type analogous to … cycles of length at least N the “large cycles”. Call the
resulting graph G. (See Figure 1.) Every cycle shares a vertex with either the N-cycle or the k-cycle, …

… cycle times. Then, we present a sequential approach to compute the minimum cycle times of
finite … , initial states, unrealizable transitions, multiple cycle false paths, and periodicity of the …

… finite list of periodically forbidden words. We show that the class of PFT shifts properly contains
all finite-type (FT) shifts, and the class of almost finite-type … a finite number of cycling paths …

… types of algebras A (finite type, domestic, polynomial growth, tame, wild) by properties of
cycles in … But often the short cycles containing modules from stable tubes are finite. We shall …

This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main
result is the complete classification of the cluster algebras of finite type, ie, those with finitely …

… whose Tanner graphs contain short cycles do not perform … distribution (or number) of short
cycles in its Tanner graph. It … ) the structure of short cycles; 3) the number of short cycles that a …

… a k-cycle can be embedded in any affine plane of order q. We also prove a similar result for
finite … A new approach for establishing hamiltonicity and the existence of shorter cycles came …

… precision, dynamical degradation and inevitable periodic cycles occur after … short cycles
obtained under finite precision. Following studies mainly focused on eliminating this short cycle …