We set up a general correspondence between algebraic properties of βℕ and sets defined by dynamical properties. In particular, we obtain a dynamical characterization of C-sets, i.e., sets satisfying the strong Central Sets Theorem. As an application, we show that Rado systems are solvable in C-sets.
The adaptive stabilization is investigated for a class of coupled PDE-ODE systems with multiple uncertainties. The presence of the multiple uncertainties and the interaction between the sub-systems makes the systems to be considered more general and representative, and moreover it may result in the ineffectiveness of the conventional methods on this topic. Motivated by the existing literature, an infinite-dimensional backsteppping transformation with new kernel functions is first introduced to change...
Let M ∈ Mₙ(ℤ) be expanding such that |det(M)| = p is a prime and pℤⁿ ⊈ M²(ℤⁿ). Let D ⊂ ℤⁿ be a finite set with |D| = |det(M)|. Suppose the attractor T(M,D) of the iterated function system has positive Lebesgue measure. We prove that (i) if D ⊈ M(ℤⁿ), then D is a complete set of coset representatives of ℤⁿ/M(ℤⁿ); (ii) if D ⊆ M(ℤⁿ), then there exists a positive integer γ such that , where D₀ is a complete set of coset representatives of ℤⁿ/M(ℤⁿ). This improves the corresponding results of Kenyon,...
Let be a self-affine measure associated with an expanding matrix M and a finite digit set D. We study the spectrality of when |det(M)| = |D| = p is a prime. We obtain several new sufficient conditions on M and D for to be a spectral measure with lattice spectrum. As an application, we present some properties of the digit sets of integral self-affine tiles, which are connected with a conjecture of Lagarias and Wang.
Two semigroups are said to be distinct if they are neither isomorphic nor anti-isomorphic. Although there exist 1373 distinct monoids of order six, only two are known to be non-finitely based. In the present dissertation, the finite basis property of the other 1371 distinct monoids of order six is verified. Since it is long established that all semigroups of order five or less are finitely based, the two known non-finitely based monoids of order six are the only examples of minimal order.
In a recent paper, Neuts, Rauschenberg and Li [10] examined, by computer experimentation, four different procedures to randomly partition the interval [0,1] into m intervals. The present paper presents some new theoretical results on one of the partitioning schemes. That scheme is called Random Interval (RI); it starts with a first random point in [0,1] and places the kth point at random in a subinterval randomly picked from the current k subintervals (1
Page 1 Next