In this paper, we study time-periodic perturbation of classical systems with two degrees of freedom. A transition chain is established, by passing through small neighborhood of double resonant point, to connect any two cohomology classes corresponding to resonant frequencies. Applying the result to nearly integrable Hamiltonian systems with three degrees of freedom, one obtains a transition chain along which one is able to construct diffusion orbits suggested by Arnold in [A66].

This paper studies a two-strain SIS epidemic model with a competing mechanism and a saturating incidence rate on complex networks. This type of incidence rate could be used to reflect the crowding effect of the infective individuals. We first obtain the associated reproduction numbers for each of the two strains which determine the existence of the boundary equilibria. Stability of the disease-free and boundary equilibria are further examined. Besides, we also show that the two competing strains can coexist under certain conditions. Interestingly, the saturating incidence rate can have specific effects on not only the stability of the boundary equilibria, but also the existence of the coexistence equilibrium. Numerical simulations are presented to support the theoretical results.

We develop a generic game platform that can be used to model various real-world systems with multiple intelligent cloud-computing pools and parallel-queues for resources-competing users. Inside the platform, the software structure is modelled as Blockchain. All the users are associated with Big Data arrival streams whose random dynamics is modelled by triply stochastic renewal reward processes (TSRRPs). Each user may be served simultaneously by multiple pools while each pool with parallel- servers may also serve multi-users at the same time via smart policies in the Blockchain, e.g. a Nash equilibrium point myopically at each fixed time to a game-theoretic scheduling problem. To illustrate the effectiveness of our game platform, we model the performance measures of its internal data flow dynamics (queue length and workload processes) as reflecting diffusion with regime-switchings (RDRSs) under our scheduling policies. By RDRS models, we can prove our myopic game-theoretic policy to be an asymptotic Pareto minimal-dual-cost Nash equilibrium one globally over the whole time horizon to a randomly evolving dynamic game problem. Iterative schemes for simulating our multi-dimensional RDRS models are also developed with the support of numerical comparisons.

We study the effective fronts of first order front propagations in two dimensions (n=2) in the periodic setting. Using PDE-based approaches, we show that for every α∈(0,1), the class of centrally symmetric polygons with rational vertices and nonempty interior is admissible as effective fronts for given front speeds in C^{1,α}(T^2,(0,∞)). This result can also be formulated in the language of stable norms corresponding to periodic metrics in T^2. Similar results were known long time ago when n≥3 for front speeds in C^∞(T^n,(0,∞)). Due to topological restrictions, the two dimensional case is much more subtle. In fact, the effective front is C^1, which cannot be a polygon, for given C^{1,1}(T^2,(0,∞)) front speeds. Our regularity requirements on front speeds are hence optimal. To the best of our knowledge, this is the first time that polygonal effective fronts have been constructed in two dimensions.

This investigation studies nonemptiness problems of plane edge coloring with three colors. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of p colors are arranged side by side such that the touching edges of the adjacent tiles have the same colors. Given a basic set B of Wang tiles, the nonemptiness problem is to determine whether or not Σ(B) 6= ∅, where Σ(B) is the set of all global patterns on Z2 that can be constructed from the Wang tiles in B. Wang’s conjecture is that for any B of Wang tiles, Σ(B) 6= ∅ if and only if P(B) 6= ∅, where P(B) is the set of all periodic patterns on Z2 that can be generated by the tiles in B. When p ≥ 5, Wang’s conjecture is known to be wrong. When p = 2, theconjecture is true. This study proves that when p = 3, the conjecture is also true. If P(B) 6= ∅, then B has a subset B′ of minimal cycle generators such that P(B′) 6= ∅ and P(B′′) = ∅ for B′′ $ B′. This study demonstrates that the set C(3) of all minimal cycle generators contains 787, 605 members that can be classified into 2, 906 equivalence classes. N(3) is the set of all maximal non-cycle generators : if B ∈ N(3), then P(B) = ∅ and P(B ˜) 6= ∅ for B ˜ % B. Wang’s conjecture is shown to be true by proving that B ∈ N(3) implies Σ(B) = ∅.

No abstract uploaded!

No abstract uploaded!

To study arithmetic structures of natural numbers, we introduce a notion of entropy of arithmetic functions, called anqie entropy. This entropy possesses some crucial properties common to both Shannon's and Kolmogorov's entropies. We show that all arithmetic functions with zero anqie entropy form a C*-algebra. Its maximal ideal space defines our arithmetic compactification of natural numbers, which is totally disconnected but not extremely disconnected. We also compute the $K$-groups of the space of all continuous functions on the arithmetic compactification. As an application, we show that any topological dynamical system with topological entropy $\lambda$, can be approximated by symbolic dynamical systems with entropy less than or equal to $\lambda$.

Many discrete integrable systems exhibit the Laurent phenomenon. In this paper, we investigate three integrable systems: the Somos-4 recurrence, the Somos-5 recurrence, and a system related to so-called A_1 A_1-system, whose general solutions are derived in terms of Hankel determinant. As a result, we directly confirm that they satisfy the Laurent property. Additionally, it is shown that the Somos-5 recurrence can be viewed as a specified Backlund transformation of the Somos-4 recurrence. Related topics about Somos polynomials are also studied.

Let $K$ be a self-similar set satisfying the open set condition. Following Kaimanovich’s elegant idea, it has been proved that on the symbolic space $X$ of $K$ a natural augmented tree structure $E$ exists; it is hyperbolic, and the hyperbolic boundary $\partial_H X$ with the Gromov metric is H\"older equivalent to $K$. In this paper we consider certain reversible random walks with return ratio $0 < \lambda < 1$ on $(X,E)$. We show that the Martin boundary ${\mathcal M}$ can be identified with $\partial_H X$ and $K$. With this setup and a device of Silverstein, we obtain precise estimates of the Martin kernel and the Na\"im kernel in terms of the Gromov product. Moreover, the Naïm kernel turns out to be a jump kernel satisfying the estimate $\Theta (\xi,\eta) \asymp |\xi-\eta|^{-(\alpha+\beta)}$, where $\alpha$ is the Hausdorff dimension of $K$ and $\beta$ depends on $\lambda$. For suitable $\beta$, the kernel defines a regular non-local Dirichlet form on $K$. This extends the results of Kigami concerning random walks on certain trees with Cantor-type sets as boundaries.