We consider the sets of quasi-regular points in the countable symbolic space. We measure the sizes of the sets by Billingsley-Hausdorff dimension defined by Gibbs measures. It is shown that the dimensions of those sets, always bounded from below by the convergence exponent of the Gibbs measure, are given by a variational principle, which generalizes Li and Ma’s result and Bowen’s result.

We compute the Hausdorff and Minkowski dimension of subsets of the symbolic space Σm = {0, ..., m−1} N that are invariant under multiplication by integers. The results apply to the sets {x ∈ Σm : ∀ k, xkx2k · · ·xnk = 0}, where n ≥ 3. We prove that for such sets, the Hausdorff and Minkowski dimensions typically differ.

Let Z ⊂ Pr be a smooth variety of dimension n and let c0, . . . , cn be the Chern classes of Z. We present an algorithm to compute the degree of any monomial in {c0, . . . , cn}. The method is based on intersection theory and may be implemented as a numeric or as a symbolic algorithm.

We compute the Hausdorff and Minkowski dimension of subsets of the symbolic space Σm = {0, ..., m−1}N that are invariant under multiplication by integers. The results apply to the sets {x ∈ Σm : ∀ k, xkx2k · · ·xnk = 0}, where n ≥ 3. We prove that for such sets, the Hausdorff and Minkowski dimensions typically differ.

We study whether the entropy (or growth rate) of minimal forbidden patterns of symbolic dynamical shifts of dimension 2 or more, is a conjugacy invariant. We prove that the entropy of minimal forbidden patterns is a conjugacy invariant for uniformly semi-strongly irreducible shifts. We prove a weaker invariant in the general case.

The present research applies the conceptual background of psychological empowerment to explore customer cognitions regarding smart technologies, particularly when deployment is imposed by an organization, as well their impact on use device. We conducted analysis structure social representations meters in France, demonstrating existence three patterns ambivalent referring dimensions construct: f...

In this paper, the maximal abelian dimension is algorithmically and computationally studied for the Lie algebra hn, of n×n upper-triangular matrices. More concretely, we define an algorithm to compute abelian subalgebras of hn besides programming its implementation with the symbolic computation package MAPLE. The algorithm returns a maximal abelian subalgebra of hn and, hence, its maximal abeli...

We introduce the symbolic simulation function implemented in our model-checker/simulator RED 4.0 for densetime concurrent systems. By representing and manipulating statespaces as logic predicates, the technique of symbolic simulation can lead to high performance by encoding even a dense amount of traces in traditional simulation into one symbolic trace. Symbolic simulation adds the dimension of...