1. Introduction
Let  be a discrete dynamical system, where X is a topological space and  is a continuous map. A point  is said to be periodic with period  if . Moreover, if  for any , then x has least period n.
The orbit of a point x is the set . The orbit is finite with size n if and only if x is periodic with least period n. Such orbit is called a (prime) closed or periodic orbit. We denote  as a closed orbit of size .
Closed orbits have been a subject of research in the field of dynamical systems, especially in ergodic theory. One aspect to be studied is the growth of closed orbits in a system. The growth can be described through the following counting functions: for ,
- (i)
- prime orbit counting function
           - 
          which specifies the cumulative number of closed orbits based on the period; 
- (ii)
- Mertens’ orbit counting functions
           - 
          where  h-  is the topological entropy of the system (with assumption that  - ). 
These counting functions were introduced as the dynamical analogues of the counting functions for primes in number theory [
1]. Specifically, Prime Number Theorem and Mertens’ Theorem provide the asymptotic results for the following counting functions: for 
,
      
      where 
 and 
M are Euler–Mascheroni constant and Meissel–Mertens constant, respectively, and 
p runs through primes. Inspired by these results, the aim here is to obtain analogous asymptotic behaviours for the orbit counting functions for a given system. We refer these behaviours as the (asymptotic) orbit growth of the system.
The earlist works on this research problem were actually done for dynamical flows (see [
2] for a brief history on this topic). These include the works by Parry and Pollicott [
3,
4] and Sharp [
5] on suspension flows and Axiom A flows, respectively. From both works, similar results can be deduced for a mixing shift of finite type with topological entropy 
, which are
      
      for some positive constants 
 and 
C (which can be specified in Theorem 1). The results above are obtained through its Artin–Mazur zeta function.
For a discrete dynamical system, its Artin–Mazur zeta function [
6] is the generating function
      
      where 
 is the number of periodic points of period 
n. If the zeta function has a non-vanishing meromorphic extension beyond its radius of convergence, then the asymptotic behaviours of the counting functions can be obtained as follows.
Theorem 1  ([
7])
. Let  be a discrete dynamical system with topological entropy  and Artin–Mazur zeta function . Suppose that there exists a function  such that it is analytic and non-zero for  for some , andfor  for some . Then, - (a) 
- (b) 
- (Mertens’ Orbit Theorem)where γ is Euler–Mascheroni constant and C is a positive constant that can be specified as 
 Equation (
6) is equivalent to saying that
- (i)
-  is a meromorphic function for , and 
- (ii)
- there are exactly p poles inside this region. Each pole is located on the radius , has order m and of the form  for , where  is the principal pth root of unity. 
In recent years, the above approach had been demonstrated to obtain the orbit growth of periodic-finite-type shifts [
7], and also Dyck and Motzkin shifts [
8]. However, the tools used to analyse their respective zeta function are different for each case. These involve some theories on graphs and matrices for the periodic-finite-type shifts, and basic complex analysis for the Dyck and Motzkin shifts. For the Motzkin shift 
 (see 
Section 2 for notation), it was found that
      
	  The results for the Dyck shift 
 can be deduced by setting 
. These results are more precise than the previous results obtained via the estimation of number of periodic points in [
9,
10]. Akhatkulov et al. [
11] later found sharper results for Dyck shifts, but it did not include similar results for Motzkin shifts.
There are other systems which use the approach via zeta function to obtain their orbit growth, such as ergodic toral automorphisms [
12,
13]. In fact, certain types of shift spaces in the literature have been shown to have a non-vanishing meromorphic extension of their respective zeta function, and this implies the orbit growth as in Theorem 1. However, those results on orbit growth are not stated therein. Examples are shifts of quasi-finite type [
14], beta shifts [
15] and negative beta shifts [
16].
On related notes, there are other approaches to determine the orbit growth of a system, such as using orbit monoids in [
17] and orbit Dirichlet series in [
18]. The choice of such approach depends on the nature of the system in question. However, our machinery here is the approach via zeta function. For a detailed exposure on the topic of orbit growth, we encourage the interested readers to refer to our survey paper in [
19]. We shall also mention that there is a similar research problem of counting finite orbits for group actions, and some asymptotic results have been obtained for finitely-generated torsion-free nilpotent group shifts [
20], algebraic flip systems [
21] and flip systems of shifts of finite type [
22].
Now, we focus our attention to shift dynamical systems. In fact, many results mentioned above are regarding certain types of shift spaces. Over the years, new types of shift spaces have been introduced together with their zeta functions, but their orbit growth is left undetermined. Krieger and Matsumoto [
23] constructed a type of shift spaces called Markov-Dyck shifts by using inverse graph semigroups. Later, Inoue and Krieger [
24] introduced another type of shift spaces constructed as a combination of sofic shifts and Dyck shifts. Both types of shift spaces are examples of sofic-Dyck shifts [
25]. The zeta functions for these shift spaces had been found, though expressed implicitly and very sophisticated to be studied.
Inoue and Krieger [
24] also provided an example of shift spaces constructed from directed bouquet graphs and Dyck shifts. We call these as bouquet-Dyck shifts. These shift spaces include Dyck and Motzkin shifts, and a class of shift subspaces from Dyck shifts in [
26]. Their respective zeta function is available in explicit form, thus is simpler and easier to be studied for its meromorphic extension. However, the zeta function involves square roots of certain polynomials, and the meromorphic extension is still difficult to be determined.
Hence, the aim of our paper is to obtain the orbit growth of the bouquet-Dyck shifts via their respective zeta function. We will determine the meromorphic extension in the form of (
6) and then apply Theorem 1. Regarding the meromorphic extension, we will utilise some theories in complex analysis, especially on zeros of complex polynomials, to obtain bounds for the zeros and singularities of the zeta function. This idea includes the well-known Eneström–Kakeya Theorem in the field of complex analysis.
In 
Section 2, we define the bouquet-Dyck shifts and state their zeta function and topological entropy. Later in 
Section 3, we find the meromorphic extension of the zeta function, and then deduce the orbit growth in Theorem 4. We also demonstrate these results on the shift spaces found in [
26] as an example.
  2. Bouquet-Dyck Shifts
In this section, we introduce the bouquet-Dyck shifts as a type of shift spaces. More details on general shift spaces can be found in [
27].
For an integer 
, define the set
      
We generate a monoid  with identity  and zero  from  through the following operation:
- (i)
- (ii)
-  for any ; 
- (iii)
-  for any . 
This is called a Dyck monoid. The condition  is necessary to generate 0 in the monoid. In fact, we can see later that if , then the constructed shift space is a shift of finite type (which is trivial).
Let P and Q be non-negative integers such that both are either zero or non-zero simultaneously. Define a directed bouquet graph G as follows:
- (i)
- (ii)
- the set of edges is
           - 
          where  -  for any  i- . 
We can see that if , then G is simply the vertex . Nevertheless, we then form a new graph  from G by attaching  loops on vertex , and each loop is assigned uniquely with a label from . We also denote  as the set of finite paths in .
Now, let  be equipped with the discrete topology. Its product  is equipped with the product topology. Let . For  and  of length , we denote  if there exists  such that .
Define a map 
 as
      
      and another map 
 as
      
      for any 
. The 
bouquet-Dyck shift is the set
      
      equipped with the shift map 
 where
      
In graph terminology,  consists of all bi-infinite paths such that every subpath is not reduced to  under the Dyck monoid operation. Notice that the  loops on vertex  produce a Dyck shift, while the bouquet graph G produces a shift of finite type (which is a sofic shift). So,  is constructed through the combination of both types of shift spaces. Examples of  are the Motzkin shift  with , and the Dyck shift  with .
In [
24], the Artin–Mazur zeta function of 
 is given as
      
      and its topological entropy is
      
      where 
 is the unique positive solution of the polynomial equation
      
	  The equation above arises from solving the denominator of 
 for its roots. Note also that the numerator of 
 is non-zero on the whole complex plane.
  3. Orbit Growth of Bouquet-Dyck Shifts
Throughout this section, we consider a bouquet-Dyck shift 
 with the value of 
 in (
20). Our plan is to construct the function 
 as in Theorem 1. Based on (
6), we can expect that our zeta function 
 in (
19) is a meromorphic function for 
, where 
R is to be found. Furthermore, it shall have only one pole, which is 
, in this region. Therefore, we need to prove the existence of such pole, and find the suitable value of 
R.
Note that if the denominator of  is analytic at , then  is a pole of  if and only if it is a zero of the denominator. So, it is sufficient to consider  as a possible zero of the denominator. However, the denominator contains the expression  which may not be analytic in certain region, or even at . Hence, we need to solve the following tasks:
- (i)
- To find the region of analyticity of , and thus the denominator; 
- (ii)
- To show that  is a zero, and it is the closest to the origin among the zeros of the denominator. This will help us to determine the suitable value of R. 
We will see that both tasks involve finding the roots of polynomials. Except quadratic polynomials, it may be impossible to determine the roots in exact for the polynomials of higher degree. Due to that, we will estimate the roots by using certain bounds. The following two theorems will be helpful for this purpose. Here, the notation “gcd” refers to the greatest common divisor.
Theorem 2  ([
28])
. Let  be a complex trinomial in the formwhere  with , 
 and , 
and  with . Define the following complex trinomials:Then, - (a) 
- andhave unique positive rootsand, respectively, where, and 
- (b) 
- if μ is a root of, then. 
Theorem 3  (Eneström–Kakeya Theorem [
29])
. Let  be a complex polynomial with degree  and positive coefficients  in the formDefineBy setting  and , define alsoThen, for any root μ of ,- (a) 
- , and 
- (b) 
- if , then , and if , then . 
 We begin with finding the region of analyticity for the denominator of .
Proposition 1. If μ is a root of the polynomial , then .
 Proof.  The cases for 
 and 
 are straightforward because we can obtain the exact values of 
 and the roots 
. For 
, observe that
        
		Denote 
 and 
 as the first and second trinomials, respectively, in the factorization above. It is easy to check that 
 and 
 have unique positive roots 
 and 
, respectively.
For 
, we solve the relevant quadratic equations to obtain that
        
Consider the function
        
        for 
. We can check that 
 for 
, so 
 is strictly decreasing on 
. Since 
 for 
, we obtain that 
, and consequently, 
.
Now, suppose that 
. By using substitution 
, the trinomials 
 and 
 are transformed into trinomials
        
		Based on Theorem 2, 
 and 
 have unique positive roots 
 and 
, respectively. Furthermore, if 
 is a root of 
 or 
, then 
. By re-substitution, we obtain that 
 for any root 
 of the polynomial 
.
It remains to compare  and . Since  for , it is easy to deduce that . □
 Proposition 2. The function  is analytic for , withwhere μ runs through the zeros of the polynomial .  Proof.  We consider the cases for 
 first. The polynomial 
 can be factored as
        
        where 
 runs through the real roots, and 
 and 
 run through the conjugate pairs of non-real roots of the polynomial. Therefore, it is sufficient to check for the analyticity of the square root of each factor for 
. Since the function 
 is analytic anywhere except for non-positive real values of 
z, it remains to check that each factor does not result in those values for 
.
Suppose that there exists a negative root . Its factor  produces a non-positive real value only if z is real with , and consequently, . By contrapositive, if , then  cannot be a non-positive real value.
For other real roots, recall above that there are exactly two positive roots 
 and 
. Consider the product 
. Suppose that for some 
, the product produces a non-positive real value, i.e.,
        
        for some 
. By expressing 
 where 
 and comparing real and imaginary parts, we obtain
        
		The second equation implies the following solutions:
        
- (i)
- . This implies further that  -  from the first equation. If  - , then there is no solution for  z- . Otherwise,
             - 
            and thus,  - ; 
- (ii)
- . This implies further that  from the first equation. Thus, . Overall, we deduce that if  produces a non-positive real value, then . By contrapositive, if , then  cannot be a non-positive real value. 
On the other hand, suppose that there exists a conjugate pair  and  of non-real compls. We can use similar argument above to show that if , then its corresponding quadratic factor cannot be a non-positive real value.
Since  for any root , we reach our conclusion. The cases for  and  are done similarly by applying the argument above on the quadratic polynomial  directly. □
 The previous proposition implies that both numerator and denominator of  are analytic for . Since  is a zero of the denominator, it is indeed a pole of . It remains to find its order.
Proposition 3. For the polynomial , the root λ is simple, and if μ is another root of the polynomial, then .
 Proof.  The cases for 
 and 
 are straightforward since the polynomial is linear. Now, suppose that 
. Since 
 is a root, the polynomial 
 can be factored as
        
		Denote the last polynomial in the factorization above as 
. We will apply Theorem 3 on 
. Based on the coefficients, it is easy to check that 
 and 
. Hence, for any root 
 of 
, we obtain that 
. This implies that 
 is not a root of 
. So, 
 is a simple root of 
. Since the remaining roots of 
 are the roots of 
, we obtain the desired inequality. □
 The previous proposition implies that  is a pole of  of order 2, since the denominator has power 2. Furthermore, it is the closest to the origin among the poles of .
Now, set
      
      where 
 runs through the roots of 
 except 
 itself. Set further 
 and consider the region where 
. Observe that 
 is the only pole of 
 inside this region. Furthermore, since the numerator and denominator are analytic for 
, now we know that 
 is a meromorphic function for 
. In other word, there exists an analytic function 
 for 
 such that
      
      and 
. Finally, we set 
 and apply Theorem 1 to deduce the orbit growth of the bouquet-Dyck shifts.
Theorem 4. For bouquet-Dyck shift  with Artin–Mazur zeta function  and topological entropy h,where γ is the Euler–Mascheroni constant, φ is a positive constant defined byand C is another positive constant as in (9).  As a corollary, the orbit growths of Dyck and Motzkin shifts can be deduced by setting 
 and 
, respectively, and calculating the exact value of 
 based on Theorem 4. These results agree with [
8].
Example 1. We demonstrate the result of Theorem 4 on the shift subspaces of Dyck shifts in [26]. These shift spaces were originally constructed from Dyck languages, but here, we provide an alternative definition. Let  be the Dyck shift over . For , define the shift subspace  as follows:  if and only if for  with , we have  if and only if  for . In other word,  can only appear together in x for .
Note that  is the Dyck shift . Moreover, it is easy to check that  and  are shifts of finite type. For ,  is the bouquet-Dyck shifts  with the graph  as follows:
- (i) 
- each of the  loops at the vertex  is assigned uniquely with a label from ; 
- (ii) 
- for , the edges  and  are assigned with the labels  and , respectively. 
In this case, its topological entropy can be calculated in exact, which is Hence, the orbit growth of  is given as in Theorem 4.
   4. Conclusions
In this paper, we have determined the orbit growth of a bouquet-Dyck shift via its Artin–Mazur zeta function in Theorem 4. The results include the cases for Dyck shifts, Motzkin shifts and a certain class of shift subspaces from Dyck shifts. Although the approach via zeta function is straightforward due to Theorem 1, the difficulty arises due to the form of its zeta function in (
19). Since the zeta function contains square roots of polynomials, some tools in complex analysis are needed to determine the meromorphic extension in (
6).
In general setting, this approach is applicable to any discrete dynamical system, as long as its zeta function satisfies the conditions in Theorem 1. However, the meromorphic extension may be difficult to be obtained and some advanced theories in other mathematical fields may be required for this purpose.
Bouquet-Dyck shifts are a small class of sofic-Dyck shifts [
25]. The next aim is to obtain the orbit growth of the sofic-Dyck shifts, or if not, their shift subspaces such as Markov-Dyck shifts [
23] and shift spaces introduced in [
24]. However, their zeta functions are a lot more sophisticated than for bouquet-Dyck shifts. We hope that our work here provides a new interest, insight and idea to the readers to tackle the research problem on the orbit growth of those shift spaces.