Enumeration Class of Polyominoes Inscribed in James Abacus and Related ECO Authors: Eman F. Mohommed, jalal Abd Jassim, Alina Alb Lupas, Ali A. Aubad, Eman Mohommed, Hayder R. Hashim, Hayder R. Hashim, Eman Mohommed, Ayesha Qureshi Published: 2026 ABSTRACT This paper studies a class of polyominoes. The new class is defined through a representation on the James abacus through nested chain which denoted Ω -nested Abacus. Depended on partition, beta number, nested chain we defined the structural condition this class. A local transformations, called SSPT-transformation and MSPT-transformation are formulated on the even chains. Then, we drive explicit formulas for the number of position in each chain, number of even chain and the total number of all chains. The structure of new class lead to enumeration formulas for the objects produced after application new transformation. To enhance further, based on these classes, generating functions are also being formulated by employing enumeration of combinatorial objects (ECO). In ECO method, each object is obtained from smaller object by making some local expansions. These local expansions are described in a simple way by a succession rule which can be translated into a function equation for the generating function. Introduction Polyominoes are finite configurations composed of unit squares, known as ominoes, that are joined edge to edge to form a connected interior, as illustrated in Figure 1. 22-polyominoes (polyominoes with 22 connected ominoes). An n -polyomino (a polyomino consisting of n ominoes) is defined up to translation, and the concept is commonly attributed to Golomb. 1 In contemporary research, n-polyominoes have attracted significant attention from computer scientists, physicists, mathematicians, and biologists. Despite extensive studies, enumerating n-polyominoes remains a challenging and unresolved problem in combinatorial geometry, representing one of its most fundamental open questions. 2– 5 There is no closed-form equation for n-polyominoes, and the problem has been solved up to n < 56. 3 No closed-form expression for the enumeration of n -polyominoes is currently known. Due to the complexity of this problem, several simpler subclasses of n -polyominoes have been formulated and extensively examined in the literature. 6– 8 E.F. provide a new representation of n-polyominoes (Plyominoes with n ominoe) using one of the graphical representations of partition (James-diagram) called nested chain abacus (N.C.A.) with b -columns and d -rows. 9 The Nested Chain Abacus (N.C.A.) offers a novel framework for representing any n connected omino, including empty ones (holes), through the use of a beta number. In this new representation, n -polyominoes are organised into a series of nested chains. 10 A Nested Chain Abacus (N.C.A.) is an n -polyomino inscribed within a James diagram, consisting of both outer and inner chains. The inner chains are numbered from 1 to n , where n is a positive integer, and chain 1 is the innermost chain. No intersections occur among any of the chains. Through this new representation, and for the first time, each n-polyomino has been systematically associated with a unique code. Next Figure 2 illustrates an example of an N.C.A. with six columns, five rows, and three chains. Nested chain abacus with 6 columns, 5 rows and 3 chains. Although the nested chain abacus provides a general representation pf polyominoes using the James Abacus provides a general representation of polyominoes using the James Abacus, its general structure is not specifically designed for systematic combination enumeration through local transformation. In particular, the absence of structural restriction on the arrangement of chains makes it difficult to derive explicit counting formulas and generating function. This limitation properties required for transformation-based enumeration. To address this issue, we introduce the Ω-nested Abacus, a restricted family of Nested chain Abacus representations characterized by specific conditions imposed on the odd and even chains. These conditions enable the definition of local transformation and provide a convenient framework for deriving explicit enumeration formulas using ECO methodology. Terminologies and definition This section introduced some importuned definitions: Definition 1. 13 A partition of a positive integer, k , is a sequence of integers λ1,λ2,…,λn such that λ1≥λ2≥…≥λn and ∑i=1nλi=k . Example 1. λ=(6,6,3,2,1,1) is a partition of 19 Definition 2. 13 Let λ=(λ1,λ2,…,λn) be a partition of a positive integer ( k) where ( n) denotes the number of parts of the partition. The corresponding beta number sequence is defined by βi=λi+n−i where 1≤i≤n . The sequence { β1,β2,…,βn} is called the beta-number sequence. Example 2. 14 Consider of Example 1, λ=(6,6,3,2,1,1) then beta number of λ is βi=λi+n−i,wherei=1,2,3,4,5,6andn=6 And hence β1=11,β2=10,β3=6,β4=4,β5=2,β6=1 Thus beta number sequence is {11,10,6,4,2,1}. Definition 3. 14 Let b≥2 denote the number of columns (runners) , and let λ be a partition with beta number sequence {β1,β2,…,βn} . The James Abacus with b columns is a graphical representation of λ obtained by arranging the non negative integers 0,1, … from left to right and row by row.A bead is placed at each position whose label belongs to the beta- number sequence of, all remaining position are left vacant.Consider Example 1, the James Abacus with 1,2,3,4,6,7,10,11 beta position as show in next Figure 3. Definintion 4. 9 The nested chain Abaus (N.C.A) treads the abacus A as the two dimensional grid of d rows and b columns. Where this N.C.A structure is utilized to represent various polyominoes configurations.Each position on the abacus is determined by its coordinates (m,j), where 1≤m≤d, represent the row index, and 1≤j≤b represent the column index. The beta-number β corresponding to the coordinate (m,j) is given by the mapping β=(m−1)b+(j−1) . The N.C.A structurally partitioned into finite sequence of concentric, non-over lapping, and clouded boundary path called chain denoted by C1,C2,…,Cr where r is the number of chains such that ⋂i=1rCi =∅ and ⋃i=1rCr=A . Not. For the formal construction, geometric properties ⋂r=1εCr s and coding algorithm of the N.C.A the reader referred to Reference 9.Next Figure 4 gives an example of N.C.A. with 3 chains represented of 94, where the beta number sequence is {0,5,6,7,8,9,10,11,14,15,16,19,20,21,24}. 13 A partition of a positive integer, k , is a sequence of integers λ1,λ2,…,λn such that λ1≥λ2≥…≥λn and ∑i=1nλi=k . λ=(6,6,3,2,1,1) is a partition of 19 13 Let λ=(λ1,λ2,…,λn) be a partition of a positive integer ( k) where ( n) denotes the number of parts of the partition. The corresponding beta number sequence is defined by βi=λi+n−i where 1≤i≤n . The sequence { β1,β2,…,βn} is called the beta-number sequence. 14 Consider of Example 1, λ=(6,6,3,2,1,1) then beta number of λ is βi=λi+n−i,wherei=1,2,3,4,5,6andn=6 And hence β1=11,β2=10,β3=6,β4=4,β5=2,β6=1 Thus beta number sequence is {11,10,6,4,2,1}. 14 Let b≥2 denote the number of columns (runners) , and let λ be a partition with beta number sequence {β1,β2,…,βn} . The James Abacus with b columns is a graphical representation of λ obtained by arranging the non negative integers 0,1, … from left to right and row by row. A bead is placed at each position whose label belongs to the beta- number sequence of, all remaining position are left vacant. Consider Example 1, the James Abacus with 1,2,3,4,6,7,10,11 beta position as show in next Figure 3. 9 The nested chain Abaus (N.C.A) treads the abacus A as the two dimensional grid of d rows and b columns. Where this N.C.A structure is utilized to represent various polyominoes configurations. Each position on the abacus is determined by its coordinates (m,j), where 1≤m≤d, represent the row index, and 1≤j≤b represent the column index. The beta-number β corresponding to the coordinate (m,j) is given by the mapping β=(m−1)b+(j−1) . The N.C.A structurally partitioned into finite sequence of concentric, non-over lapping, and clouded boundary path called chain denoted by C1,C2,…,Cr where r is the number of chains such that ⋂i=1rCi =∅ and ⋃i=1rCr=A . Not. For the formal construction, geometric properties ⋂r=1εCr s and coding algorithm of the N.C.A the reader referred to Reference 9. Next Figure 4 gives an example of N.C.A. with 3 chains represented of 94, where the beta number sequence is {0,5,6,7,8,9,10,11,14,15,16,19,20,21,24}. James’s Abacus with 3 columns, 4 rows and 6 beta. N.C.A. consisting of 5-columns and 5-rows decomposed into three nested chain ( C 1, C 2, C 3) representing the partition of 94. The corresponding beta-number sequence is {0,5,6,7,8,9,10,11,14,15,16,19,20,21,24}. Grey cells denoted beta position whereas white cells denote the Vance positions. Definition 5.A chain C r is said to be connected chain if every position ( m, j) in C r is a beta-position. Equivalenty contain no empty position. Next Figure 5 gives an example of N.C.A. represented by a beta sequence {0,1,2,3,4,5,7,8,9,10,12,14,15,19,20,21,22,23,24} with one connected chain (chain 1). Figure 5. Example of N.C.A illustrating a connected third chain as defined in Definition 5. Definition 6.Two beta numbers βiandβj represented on Nested Chain Abacus with b-columns and d-rows are said to be connected iff either of the following condition is satisfied. 1- |βi−βj|=1 provided that βi,βj are Located in the same row.2- |βi−βj|=bprovidedthatβi,βjare Located in the same column . For example, the beta set {0,5,6,7,8,9,10,11,14,15,16,19,20,21,24}. From Figure 4 is a connected. Definition 7.Each nested chain abacus (N.C.A.) with b - columns and d- rows is called a polyamines if every two beta numbers are connected. Definition 8.Onsider a Nested Chain Abacus(A) consisting of b-columns and d-rows, with chains C 1, C 2, … , C r orders from innermost chain to the outermost chain where (b=d) and b is odd. The N.C.A is called Ω-nested Abacus if it satisfies the following structural condition. 1.If the unique position in C1 is occupied by a bead (beta position), then the second chain C2 contains at last five beta positions.2.If the unique position in C1 is vacant, then the second chain C2 contains at least one beta position.3.Every chain with an even index may contain both beta position and vacant position.4.Every chain with an odd index greater than one forms a connected chain. Any polyomino represented by Ω-nested Abacus is called Ω-nested Abacus polyomino.Novelty of the Ω-nested AbacusThe proposed Ω-nested Abacus should e regarded as a restricted subclass of the N.C.A, rather than as a replacement for the original representation. While th N.C.A provide a general framework for representing arbitrary polyomines on James Abacus, it dose not impose structural constraints that facilitate systematic enumeration through local transformation.The Ω-nested Abacus intrduses explicit condition on the parity and connectivity of the chains. In particular, every odd chain is required to remain connected, whereas every even chain is permitted to contain both occupied and empty beta positions. Remark 9. 1-For a N.C.A with (b=d) and b is odd, the innermost chain C1 consists of a unique central position (see Reference 9).2-The additional structural in Definition 8 distinguish the Ω -nested Abacus form the general N.C.A. These condition are imposed to ensure that the corresponding polyomino remain connected under the SSPT and MSPT transformation. A chain C r is said to be connected chain if every position ( m, j) in C r is a beta-position. Equivalenty contain no empty position. Next Figure 5 gives an example of N.C.A. represented by a beta sequence {0,1,2,3,4,5,7,8,9,10,12,14,15,19,20,21,22,23,24} with one connected chain (chain 1). Example of N.C.A illustrating a connected third chain as defined in Definition 5. Two beta numbers βiandβj represented on Nested Chain Abacus with b-columns and d-rows are said to be connected iff either of the following condition is satisfied. 1- |βi−βj|=1 provided that βi,βj are Located in the same row.2- |βi−βj|=bprovidedthatβi,βjare Located in the same column . 1- |βi−βj|=1 provided that βi,βj are Located in the same row. |βi−βj|=1 provided that βi,βj are Located in the same row. 2- |βi−βj|=bprovidedthatβi,βjare Located in the same column . |βi−βj|=bprovidedthatβi,βjare Located in the same column . For example, the beta set {0,5,6,7,8,9,10,11,14,15,16,19,20,21,24}. From Figure 4 is a connected. Each nested chain abacus (N.C.A.) with b - columns and d- rows is called a polyamines if every two beta numbers are connected. Onsider a Nested Chain Abacus(A) consisting of b-columns and d-rows, with chains C 1, C 2, … , C r orders from innermost chain to the outermost chain where (b=d) and b is odd. The N.C.A is called Ω-nested Abacus if it satisfies the following structural condition. 1.If the unique position in C1 is occupied by a bead (beta position), then the second chain C2 contains at last five beta positions.2.If the unique position in C1 is vacant, then the second chain C2 contains at least one beta position.3.Every chain with an even index may contain both beta position and vacant position.4.Every chain with an odd index greater than one forms a connected chain. 1.If the unique position in C1 is occupied by a bead (beta position), then the second chain C2 contains at last five beta positions. If the unique position in C1 is occupied by a bead (beta position), then the second chain C2 contains at last five beta positions. 2.If the unique position in C1 is vacant, then the second chain C2 contains at least one beta position. If the unique position in C1 is vacant, then the second chain C2 contains at least one beta position. 3.Every chain with an even index may contain both beta position and vacant position. Every chain with an even index may contain both beta position and vacant position. 4.Every chain with an odd index greater than one forms a connected chain. Every chain with an odd index greater than one forms a connected chain. Any polyomino represented by Ω-nested Abacus is called Ω-nested Abacus polyomino. Novelty of the Ω-nested Abacus The proposed Ω-nested Abacus should e regarded as a restricted subclass of the N.C.A, rather than as a replacement for the original representation. While th N.C.A provide a general framework for representing arbitrary polyomines on James Abacus, it dose not impose structural constraints that facilitate systematic enumeration through local transformation. The Ω-nested Abacus intrduses explicit condition on the parity and connectivity of the chains. In particular, every odd chain is required to remain connected, whereas every even chain is permitted to contain both occupied and empty beta positions. 1-For a N.C.A with (b=d) and b is odd, the innermost chain C1 consists of a unique central position (see Reference 9).2-The additional structural in Definition 8 distinguish the Ω -nested Abacus form the general N.C.A. These condition are imposed to ensure that the corresponding polyomino remain connected under the SSPT and MSPT transformation. 1-For a N.C.A with (b=d) and b is odd, the innermost chain C1 consists of a unique central position (see Reference 9). For a N.C.A with (b=d) and b is odd, the innermost chain C1 consists of a unique central position (see Reference 9). 2-The additional structural in Definition 8 distinguish the Ω -nested Abacus form the general N.C.A. These condition are imposed to ensure that the corresponding polyomino remain connected under the SSPT and MSPT transformation. The additional structural in Definition 8 distinguish the Ω -nested Abacus form the general N.C.A. These condition are imposed to ensure that the corresponding polyomino remain connected under the SSPT and MSPT transformation. Figure 6 gives an example of Ω -nested Abacus with four chains, where Not Every polyamines inscribed in a nested chain-abacus is Ω -nested Abacus. Figure 4 given an example of N.C.A. but not Ω -nested Abacus, while Figure 6 given an example of Ω -nested Abacus. Not. Throughout our result the underlying new family ( Ω -nested Abacus) assumed b=d where b is odd number. Since every odd chain is completely filled, so only even chain well be contribute to the generating process. The algorithm construct to generate classes of new family depended on the following transformation. Definition 9.Single – beta transformation (SPT)Let an Ω -nested Abacus with b column, d rows and Ci chains. Suppose that a beta number β=(m−1)b+(j−1) in chain Ci is located in row m and column j such that 1≤m≤d , 1≤j≤b and 1≤i≤r . A single beta transformation (SPT) in chain Ci is local transformation ( β→β` ) within the same chain where β`={(m−1)b+(j−2)ifi+1≤m≤(r−i+1),j=b−i+1mb+(j−1)ifi≤m≤(r−i),j=i(m−1)b+jifm=i,i+1 1) is equal to the number of positions in C i. Proof.Let C i be a chain consisting of N i positions. By Definition 9, a single Beta transformation acts locally on beta position and moves it to the next position within the same chain according to the prescribed transformation rule. Since every position in C i has a unique successor and every position can be selected exactly once as the starting point of a SSpt, each position determines one distinct SSPT. Therefore, the total number of distinct SSPT is equal to the number of position in C i, namely N i, consequently, after N i successive SSPT, every beta position returns to its original location, completing on full cycle of the chain. Hence, the maximal number of SSPT in C i is equal to the number of position in that chain. Single – beta transformation (SPT) Let an Ω -nested Abacus with b column, d rows and Ci chains. Suppose that a beta number β=(m−1)b+(j−1) in chain Ci is located in row m and column j such that 1≤m≤d , 1≤j≤b and 1≤i≤r . A single beta transformation (SPT) in chain Ci is local transformation ( β→β` ) within the same chain where β`={(m−1)b+(j−2)ifi+1≤m≤(r−i+1),j=b−i+1mb+(j−1)ifi≤m≤(r−i),j=i(m−1)b+jifm=i,i+1 1) is equal to the number of positions in C i. Let C i be a chain consisting of N i positions. By Definition 9, a single Beta transformation acts locally on beta position and moves it to the next position within the same chain according to the prescribed transformation rule. Since every position in C i has a unique successor and every position can be selected exactly once as the starting point of a SSpt, each position determines one distinct SSPT. Therefore, the total number of distinct SSPT is equal to the number of position in C i, namely N i, consequently, after N i successive SSPT, every beta position returns to its original location, completing on full cycle of the chain. Hence, the maximal number of SSPT in C i is equal to the number of position in that chain. Let C i (i>1) be a chain consisting of N i Figure 7 illustrates Single – beta transformation (SPT) Not. 1-SSpt is a SPT transformation in one chain.2-MSpt is a SPT transformation in all chains. 1-SSpt is a SPT transformation in one chain. SSpt is a SPT transformation in one chain. 2-MSpt is a SPT transformation in all chains. MSpt is a SPT transformation in all chains. Ω -nested Abacus with four chains. Illustrates Single – beta transformation (SPT) on Ω -nested Abacus. Enumeration of the Ω -nested Abacus class Next, the enumeration of Ω-nested Abacus with b columns and d rows is presented. Lemma 11.Let A be Ω -nested Abacus with b column, d rows and C 1, C 2, … , C n then, the number of position in any chains C i is |Ci|=8(n−1). Proof.Based on Remark 8 where d=b is odd, the innermost chain C1 colonists of a unique position. According to Definition 4, every chain Cn (n>1) is the closed boundary of the remaining sub-grid after removing the inner chain C 1, C 2, … , C n−1. The second chain ( C2 ) is formed by the eight boundary position surround the unique central position. Then |C2|=4+4=8 |C3|=|C2|+8=8.2=16 |C4|=|C3|+8=8.3=24………|Cn|=|Cn−1|+8=8(n−1) Corollary 12.Based on Remark 10 and Lemma 11, the number of (SSPT) transformation in chain Cn is equal to 8(n−1) . Lemma 13.Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d and b is odd. Then the total number of chain is b+12 . Proof.Based on Ω-nested Abacus structure is symmetric with respect to a central column (central chain Cn ) then for all i-th chains, the boundary columns must satisfy i≤b−i+1 , thus 2i≤b−1→i≤b+12 . Thus the number of even chain is b+12 chains. Proposition 14.Let Ω-nested Abacus be a polyomino intercept in NCA with b columns and d rows such that b=d and b is odd. Then the number of even chain is b−14 .Provided that b≡1(mod4). Proof. Based on Lemma 13 the number of chain in Ω-nested Abacus is t=b+12 . The even chains among 1,2,…,t are 2,4,…,⌊t2⌋ . Since t=b+12 is even then t2=b+122 is even since the first chain is odd and fixed. Then there are Since t=b+12 is even then t2=b+12−12=b−14 , then the number of even chain is b−14 .Next we found the number of Ω-nested Abacus if we apply SSPT-Transformation in chain i . Lemma 15:Let Ω-nested Abacus be a polyomino intercept in NCA with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ SSPT-Transformation exactly chain n is 8(n−1). Proof.By Lemma 11 the number of admissible positions in chains n is 8(n−1) . Since move each beta position yields a distinct Ω-nested Abacus under SSPT-transformation obtain in chain n with 8(n−1) position is 8(n−1) . Theorem 16:Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ SSPT-Transformation is ∑∀n(R(n−1)8) Where R=∑n⌊b+14⌋(n−1)8 , b≡1(mod4) Proof.Based on Lemma 10, the number of positions in chain n is (n−1)23 by Lemma 11 and Definition 8, there are b−14 chain with beta and empty beta position in Ω-nested Abacus. The maximal number of transformations in chain n is equal to ((n−1)8). Since each move generates a new Abacus (polyominoes), thus there are ((n−1)8) of Ω-nested Abacus generated by employing SSPt transformation. As a result of this, there are ∑∀n(R(n−1)8) Ω-nested Abacus. Theorem 17.Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ SSPT-Transformation exactly one even chain. ∑n=2⌊b+14⌋8(n−1). Where b≡1(mod4) Proof. Based on Lemma 11 the number of positions in chain n is 8( n−1), any position in the chain will be determines one distinct SSPT in that chain. Thus all even chain C2,C4,…, gives ∑n=2⌊b+14⌋8(n−1) . Theorem 18.Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ MSPT-Transformation exactly chain n is ∏∀n8(n−1) Where b≡1(mod4) and n=2,4,…..,b=14 Proof.Based on Lemma 11, the number of admissible beta and empty positions in chain C n is 8( n−1). Since all odd chains are connected and remain fixed, they do not participate in the transformation. By Lemma 15 the number of Ω-nested Abacus generating by employ SSPT-Transformation applying an SSPT to an even chain produces exactly 8( n−1) distinct Ω-nested Abacus. Furthermore, by Definition 4, the chains of a nested chain Abacus are pairwise disjoint. Hence, each SSPT acts locally within its own even chain and dose not affect the position of any other chain. Therefore, the transformations performed on different even chains are mutually independent and can be applied simultaneously. Consequently, an MSPT is obtained by applying an SSPT to every even chain at the same time. Since each even chain contributes independently 8(n-1) admissible transformations, the total number of Ω-nested Abacus generated after application SSPT-Transformation ∏2≤n≤b−12,neven8(n−1) Let A be Ω -nested Abacus with b column, d rows and C 1, C 2, … , C n then, the number of position in any chains C i is |Ci|=8(n−1). Based on Remark 8 where d=b is odd, the innermost chain C1 colonists of a unique position. According to Definition 4, every chain Cn (n>1) is the closed boundary of the remaining sub-grid after removing the inner chain C 1, C 2, … , C n−1. The second chain ( C2 ) is formed by the eight boundary position surround the unique central position. Then Based on Remark 10 and Lemma 11, the number of (SSPT) transformation in chain Cn is equal to 8(n−1) . Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d and b is odd. Then the total number of chain is b+12 . Based on Ω-nested Abacus structure is symmetric with respect to a central column (central chain Cn ) then for all i-th chains, the boundary columns must satisfy i≤b−i+1 , thus 2i≤b−1→i≤b+12 . Thus the number of even chain is b+12 chains. Let Ω-nested Abacus be a polyomino intercept in NCA with b columns and d rows such that b=d and b is odd. Then the number of even chain is b−14 . Provided that b≡1(mod4). Based on Lemma 13 the number of chain in Ω-nested Abacus is t=b+12 . The even chains among 1,2,…,t are 2,4,…,⌊t2⌋ . Since t=b+12 is even then t2=b+122 is even since the first chain is odd and fixed. Then there are Since t=b+12 is even then t2=b+12−12=b−14 , then the number of even chain is b−14 . Next we found the number of Ω-nested Abacus if we apply SSPT-Transformation in chain i . Let Ω-nested Abacus be a polyomino intercept in NCA with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ SSPT-Transformation exactly chain n is 8(n−1). By Lemma 11 the number of admissible positions in chains n is 8(n−1) . Since move each beta position yields a distinct Ω-nested Abacus under SSPT-transformation obtain in chain n with 8(n−1) position is 8(n−1) . Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ SSPT-Transformation is ∑∀n(R(n−1)8) Where R=∑n⌊b+14⌋(n−1)8 , b≡1(mod4) Based on Lemma 10, the number of positions in chain n is (n−1)23 by Lemma 11 and Definition 8, there are b−14 chain with beta and empty beta position in Ω-nested Abacus. The maximal number of transformations in chain n is equal to ((n−1)8). Since each move generates a new Abacus (polyominoes), thus there are ((n−1)8) of Ω-nested Abacus generated by employing SSPt transformation. As a result of this, there are ∑∀n(R(n−1)8) Ω-nested Abacus. Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ SSPT-Transformation exactly one even chain. ∑n=2⌊b+14⌋8(n−1). Where b≡1(mod4) Based on Lemma 11 the number of positions in chain n is 8( n−1), any position in the chain will be determines one distinct SSPT in that chain. Thus all even chain C2,C4,…, gives ∑n=2⌊b+14⌋8(n−1) . Let Ω-nested Abacus be a polyomino intercept in N.C.A. with b columns and d rows such that b=d , b is odd and let n be even number. Then the number of Ω-nested Abacus generating by employ MSPT-Transformation exactly chain n is ∏∀n8(n−1) Where b≡1(mod4) and n=2,4,…..,b=14 Based on Lemma 11, the number of admissible beta and empty positions in chain C n is 8( n−1). Since all odd chains are connected and remain fixed, they do not participate in the transformation. By Lemma 15 the number of Ω-nested Abacus generating by employ SSPT-Transformation applying an SSPT to an even chain produces exactly 8( n−1) distinct Ω-nested Abacus. Furthermore, by Definition 4, the chains of a nested chain Abacus are pairwise disjoint. Hence, each SSPT acts locally within its own even chain and dose not affect the position of any other chain. Therefore, the transformations performed on different even chains are mutually independent and can be applied simultaneously. Consequently, an MSPT is obtained by applying an SSPT to every even chain at the same time. Since each even chain contributes independently 8(n-1) admissible transformations, the total number of Ω-nested Abacus generated after application SSPT-Transformation ∏2≤n≤b−12,neven8(n−1) Generating function with respect to chains In this section, the method described in 11, 12 is employed to enumerate the Ω-nested Abacus class, representing polyominoes inscribed within a James diagram. The ECO (Enumerating Combinatorial Objects) method has previously been applied to the enumeration of various polyomino classes. 12 This approach is based on a succession rule. Generating Function (G.F.) Let C2k be even chain of Ω-nested Abacus, based on Lemma 11 the number of positions in any chain is Mk=⌈C2k⌉=8(n−1). We apply SSPT-Transformation inside the chains such that no previously select position may be chose again. Thus, in initial stage there are Mk choices ( Mk of Ω-nested Abacus), after one insertion we have only Mk−1 position ( Mk−1 of Ω-nested Abacus), after two distinct insertion there are only Mk−2 position ( Mk−2 of Ω-nested Abacus as shown in Figure 8), and so on. Thus, there are ank=Mk(Mk−1)(Mk−2)…(Mk−n+1),2≤n≤Mk First and second level of ϑ using Ω -nested Abacus class with 5 columns, 5 rows and 3 chain. Above process is encoded by a generating tree. The root labeled by Mk , each node produces j children, every one of j children product j−1 . Thus the local succession rule is ϑ={Mkj→(j−1)j.1≤j≤Mk Assume that an+1k denoted the number of nodes at level n ϑ yield the recurrence an+1k=(Mk−n)ank Where a0k=1,2≤n≤Mk . ank=Mk!(Mk−n)!. Using the ordinary level-generating polynomial of the even chain Ck(x)=∑n=2Mk(Mk)nxn Ck(x)=∑n=2MkMknn!xn Since (Mk)nn!=Mk!(Mk−n)!n!=(Mkn) then, Ck(x)=∑n=2Mk(Mkn)xn=(1+x)Mk Ck(x)=∑n=2Mk(Mkn)xn=(1+x)8(2k−1) Then the generating function Ck(z,x)=∑k=1mZk(1+x)16k−8 Ck(z,x)=(1+x)−8∑k=1mZk(1+x)16k Ck(z,x)=(1+x)−8∑k=1m(Z(1+x)16)k Letr=Z(1+x)16 Ck(z,x)=(1+x)−8∑k=1mrk using the closed form sum for a finite geometric progression ∑k=1mrk=r(1−rm)1−r Then Ck(z,x)=(1+x)−8r(1−rm)1−r Ck(z,x)=(1+x)−8Z(1+x)16(1−(Z(1+x)16)m)1−Z(1+x)16 Ck(z,x) is generating function to enumerated the number of Ω-nested Abacus. Conclusion This study examines a class of polyominoes known as the Ω-nested Abacus. Initially, we provide a characterization of a new class based on specific geometric constraints defined by rows, columns, and chains. A series of operations on polyominoes is then introduced using a partition-theoretic construct known as the beta number. Furthermore, a set of operations on polyominoes is developed using a partition-theoretic construct known as the beta number, allowing for localized transformation of the structure. Furthermore, A succession rule is formulated based on generating tree techniques to describe the growth of these object. Based on this framework a recursive method is established for the systematic generation of Ω-nested Abacus configuration of a given size through the use of generating trees. Ethical approval Ethical approval was not required for this study. The paper introduces and studies a new class of polyominoes defined by unique representations on the James abacus using nested chains, termed the Ω-nested Abacus. It establishes structural conditions for this class and develops local transformations to analyze and enumerate the resulting combinatorial objects. The results are new, correct and detailed. The paper is original and doesn’t contradict to ethical or policy issues, the question posed by authors is new and well defined, the methods used by authors are appropriate and well described, the data are sound and well controlled, the discussion and conclusions are well balanced, the title and abstract convey the obtained results, the writing is acceptable, the paper contains good scientific results. I recommend the paper to indexing. Is the work clearly and accurately presented and does it cite the current literature? Yes If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Is the study design appropriate and is the work technically sound? Yes Are the conclusions drawn adequately supported by the results? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes Reviewer Expertise: Mathematical analysis, complex analysis, topological algebra I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. The researchers aim to present a new class defined through a representation on the James abacus via a nested chain, which is denoted as the Ω-nested abacus. Several results are obtained within the manuscript. Despite the results obtained by the researchers, the manuscript needs to be carefully revised in its entirety, according to the comments attached below: 1- References 4 and 9 do not have the definitions they are cited to support. Use appropriate references. 2- Check all the symbols that you use in the manuscript. For example, in Definition 2, replace k with b . 3- Definitions 2, 3, and 4 are not clearly introduced. For example, Definition 3 does not specify the runner e , and the chain structures within the N.C.A. definition are unclear. 4- Figures 4 and 5 require further verification and additional detail. 5- The researchers relied on a single case study, namely the case where b=d is odd. The authors must extend their analysis to validate the generality of their findings. 6 - The authors are obliged to provide a mathematical proof for Remark 10. 7 - The proof of Lemma 11 is incomplete; it needs more details on how the final formula is obtained. The same holds for Theorem 16. 8 - The last sentence of the proof of Lemma 13 needs to be: “then the number of even chains is ( b-1)/ 4 , remove everything before that. 9 - In the proof of Theorem 18, the researchers state: 'Since the MSPT-transformation acts simultaneously on all even chains.' However, this claim requires further explanation. 10 - The researchers suggest a new family called 'Ω-nested Abacus', however, the definition of a nested abacus already exists. What improvement has been made in the researchers' definition? 11 - There is not enough information in the 'Generating function with respect to chains' section. The proof of the G.F. formula is requested, and more details on the ECO methods are needed as well. 12 - The authors should thoroughly review the entire manuscript for language and scientific formatting. Is the work clearly and accurately presented and does it cite the current literature? Partly If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Is the study design appropriate and is the work technically sound? Partly Are the conclusions drawn adequately supported by the results? Yes Are sufficient details of methods and analysis provided to allow replication by others? Partly Reviewer Expertise: Pure Mathematics (Algebraic Graph Theory) I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. We sincerely thank the reviewer for the careful reading of our manuscript and for the constructive comments. All remarks have been carefully considered, and the manuscript has been revised accordingly. A detailed response to each comment is provided below. Comment 1 References 4 and 9 do not contain the definitions cited by the authors. Response Thank you for pointing out this issue. The cited references have been carefully rechecked, and the corresponding citations have been corrected. In particular, the definitions related to the Nested Chain Abacus have been revised and now consistently refer to the appropriate source. The manuscript has also been updated to ensure that every definition is supported by the correct reference. Comment 2 The symbols should be checked. In Definition 2, the notation k should be replaced by b . Response The notation has been revised throughout the manuscript to ensure consistency. In particular, the parameter b is now used uniformly to denote the number of columns of the Nested Chain Abacus, while d denotes the number of rows. The notation has been checked throughout the manuscript to avoid ambiguity. Comment 3 Definitions 2, 3 and 4 require further clarification. Response Definitions 2, 3 and 4 have been substantially rewritten to improve clarity and mathematical precision. The structure of the Nested Chain Abacus is now explicitly defined in terms of rows, columns, chains, and beta positions. Additional explanations have been included to clarify the geometric interpretation and the role of each chain. Comment 4 Figures 4 and 5 require further verification and additional detail. Response The captions of Figures 4 and 5 have been revised to provide additional structural information. Figure 4 now explicitly describes the corresponding Nested Chain Abacus together with the associated beta-number sequence. Figure 5 has been presented as an independent example illustrating the notion of a connected chain, thereby supporting Definition 6 and improving the interpretation of the subsequent transformations. Comment 5 The researchers relied on a single case study, namely the case where b=db=db=d is odd. The authors must extend their analysis to validate the generality of their findings. Response The manuscript has been revised to clarify the scope of the proposed model. Rather than treating the case b=d= odd as a single example, this condition is now incorporated directly into the definition of the Ω-nested Abacus. A separate remark has also been added explaining that an odd number of rows and columns guarantees the existence of a unique central position, which is an essential structural requirement for the proposed class. Consequently, all subsequent lemmas and theorems are formulated for the entire family of Ω-nested Abaci satisfying this condition, rather than for a single illustrative example. Comment 6 The authors are obliged to provide a mathematical proof for Remark 10. Response A complete mathematical justification has been added. The revised proof explicitly shows that each admissible position in a chain produces exactly one SSPT-transformation and that every position is transformed at most once. Consequently, the maximal number of SSPT-transformations is equal to the number of positions in the chain. Comment 7 The proof of Lemma 11 is incomplete; it needs more details on how the final formula is obtained. The same holds for Theorem 16. Response The proof of Lemma 11 has been expanded by explicitly explaining the geometric growth of successive chains. The derivation now shows why the second chain contains exactly eight positions and how each additional chain increases the boundary by eight positions, leading to the formula ∣C n∣=8(n−1) Similarly, the proof of Theorem 16 has been rewritten to provide the missing intermediate arguments and improve the logical flow. Comment 8 The last sentence of the proof of Lemma 13 needs to be revised. Response The proof has been simplified according to the reviewer's suggestion. The unnecessary sentence has been removed, and the proof now concludes directly with the statement that the number of even chains is ​, which follows immediately from the chain indexing. Comment 9 The statement "Since the MSPT-transformation acts simultaneously on all even chains" requires further explanation. Response Additional justification has been incorporated into the proof of Theorem 18. The revised proof now explains that the chains of the Nested Chain Abacus are pairwise disjoint; therefore, each SSPT acts locally within its own even chain and does not affect any other chain. Consequently, the admissible transformations in different even chains are independent, allowing the MSPT-transformation to be interpreted as the simultaneous application of SSPTs to all even chains. The final counting formula follows directly from the multiplication principle. Comment 10 There is not enough information in the "Generating function with respect to chains" section. The proof of the generating function and more details on the ECO method are required. Response This section has been substantially expanded. Additional material describing the ECO methodology, the generating tree, and the succession rule has been included. The recurrence relation has been derived explicitly, followed by a detailed derivation of the generating polynomial using the binomial theorem. Furthermore, the derivation of the bivariate generating function has been expanded by including the omitted intermediate algebraic steps and the application of the finite geometric-series identity. These revisions provide a complete mathematical justification of the generating function while preserving the original enumeration results. Final Remark We are grateful to the reviewer for the valuable comments and suggestions. We believe that the revisions have significantly improved the mathematical rigor, clarity, and presentation of the manuscript, and we hope that the revised version satisfactorily addresses all concerns raised during the review process. The authors have revised the manuscript in accordance with my comments. My only remaining suggestion to the authors is to carefully polish the language. Otherwise, I recommend acceptance for indexing. Is the work clearly and accurately presented and does it cite the current literature? Yes If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Is the study design appropriate and is the work technically sound? Partly Are the conclusions drawn adequately supported by the results? Yes Are sufficient details of methods and analysis provided to allow replication by others? No Reviewer Expertise: Number Theory and cryptography I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. The manuscript proposes a new class of polyominoes defined by a graphical representation referred to as the James Abacus or Nested Chain Abacus and attempts to enumerate this class using combinatorial transformations and the ECO method. Since the results in the paper are interesting in number theory, I suggest accepting the paper after revising it according to the following remarks as the paper would benefit from improvements in clarity, organization, and presentation. 1. Lemma 11 and Theorem 12 refer to external theorems without clearly stating assumptions or applicability. 2. Corollary 13 and Theorem 14 contain inconsistent notation such as mixing b,p,r,e,d and unclear counting logic. 3. Polish the language carefully. 4. Every lemma and theorem must include a complete, self-contained proof. 5. All variables must be clearly defined and used consistently. 6. If results rely on previous publications, the exact statements must be cited and restated. 7. Try to reconstruct in more details the ECO method application properly. 8. Redo or rewrite the derivation of the generating function theorem from first principles, with a more clear form. Is the work clearly and accurately presented and does it cite the current literature? Yes If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Is the study design appropriate and is the work technically sound? Partly Are the conclusions drawn adequately supported by the results? Yes Are sufficient details of methods and analysis provided to allow replication by others? No Reviewer Expertise: Number Theory I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. We thank the reviewer for his comments Comment 1: Lemma 11 and theorem 12 refer to external theorems without clearly stating assumptions of applicability Response: in the revised version, we have explicitly stated all required assumptions and clarified the applicability of the referenced result. In addition, we have added several lemmas and theorems related with lemma 11 and theorem 12 to ensure that lemma 11 and theorem 12 are fully self-contained and mathematically precise. Comment 2: Corollary 13 and Theorem 14 contain inconsistent notation, such as mixing b, p, r, e, d, and unclear counting logic Response: we appreciate this observation. The notation has been carefully revised and unified throughout the paper. All variables are now clearly defined and used consistently. Comment 3: Polish the language carefully Response: all manuscripts have been proofread and language has been improved. Comment 4: Every lemma and theorem must include a complete, self-contained proof. Response: In the new version, all lemmas and theorems now include complete proof. Additional explanations have been added where necessary. Comment 5: All variables must be clearly defined and used consistently. Response: All variables have been systematically reviewed and defined at their first occurrence and then has been standardized across the paper to ensure consistency. Comment 6: If results rely on previous publications, the exact statements must be cited and restated Response: we revised all relevant sections to explicitly cite the original source. Comment 7,8: Try to reconstruct in more detail the proper application of the ECO method. Redo or rewrite the derivation of the generating function theorem from first. Response: following the reviewer's suggestion, we have completely rewritten the derivation of the generating function. This paper introduces a class of polyominoes defined via a nested chain abacus representation and aims to enumerate this class using transformations and the ECO method. While the topic may be of interest, the manuscript in its current form lacks sufficient mathematical clarity and rigor. Several definitions are unclear or inconsistent, and many results are stated without complete or verifiable proofs. In particular, the use of the ECO method and the derivation of the generating function require a more precise and rigorous formulation. Additionally, the presentation and language need substantial improvement. A major revision addressing these issues would be necessary before the conclusions can be considered supported by the results. Is the work clearly and accurately presented and does it cite the current literature? Partly If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Is the study design appropriate and is the work technically sound? Partly Are the conclusions drawn adequately supported by the results? No Are sufficient details of methods and analysis provided to allow replication by others? No Reviewer Expertise: Algebra I confirm that I have read this submission and believe that I have an appropriate level of expertise to state that I do not consider it to be of an acceptable scientific standard, for reasons outlined above.