Morse Index Bound for Minimal Two Spheres

Given a closed manifold of dimension at least three, with non-trivial homotopy group $$\pi _3(M)$$ π 3 ( M ) and a generic metric, we prove that there is a finite collection of harmonic spheres with Morse index bounded by one, with sum of their energies realizing a geometric invariant width.

Continuity of sub-additive topological pressure with matrix cocycles *

Let A = {A 1, A 2, …, A k } be a finite collection of contracting affine maps, the corresponding pressure function P(A, s) plays the fundamental role in the study of dimension of self-affine sets. The zero of the pressure function always give the upper bound of the dimension of a self-affine set, and is exactly the dimension of ‘typical’ self-affine sets. In this paper, we consider an expanding base dynamical system, and establish the continuity of the pressure with the singular value function of a Hölder continuous matrix cocycle. This extends Feng and Shmerkin’s result in (Feng and Shmerkin 2014 Geom. Funct. Anal. 24 1101–1128) to a general setting.

Glider automata on all transitive sofic shifts

For any infinite transitive sofic shift X we construct a reversible cellular automaton (that is, an automorphism of the shift X) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing directions. This shows in addition that every infinite transitive sofic shift has a reversible cellular automaton which is sensitive with respect to all directions. As another application we prove a finitary version of Ryan’s theorem: the automorphism group $\operatorname {\mathrm {Aut}}(X)$ contains a two-element subset whose centralizer consists only of shift maps. We also show that in the class of S-gap shifts these results do not extend beyond the sofic case.

Optimization Inspired on Herd Immunity Applied to Non-Hierarchical Grouping of Objects

Characterized as one of the most important operations related to data analysis, one non-hierarchical grouping consists of, even without having any information about the elements to be classified, establish upon a finite collection of objects, the partitioning of the items that constitute it into subsets or groups without intersecting, so that the elements that are part of a certain group are more similar to each other than the items that belong to distinct group. In this context, this study proposes the application of a meta-heuristic inspired by herd immunity to the determination of the non-hierarchical grouping of objects, and compares the results obtained by this method with the answers provided by four other grouping strategies, described in the literature. In particular, the resulting arrangements of the classification of 33 benchmark collections, performed by the suggested algorithm, by the metaheuristic inspired by the particle swarm, by the genetic algorithm, by the K-means algorithm and by the meta-heuristic inspired by the thermal annealing process, were compared under the perspective of 10 different evaluation measures, indicating that the partitions established by the meta-heuristic inspired by the herd immunity may, in certain respects, be more favorable than the classifications obtained by the other clustering methods.

Iterated Functions Systems Composed of Generalized θ-Contractions

The theory of iterated function systems (IFSs) has been an active area of research on fractals and various types of self-similarity in nature. The basic theoretical work on IFSs has been proposed by Hutchinson. In this paper, we introduce a new generalization of Hutchinson IFS, namely generalized θ-contraction IFS, which is a finite collection of generalized θ-contraction functions T1,…,TN from finite Cartesian product space X×⋯×X into X, where (X,d) is a complete metric space. We prove the existence of attractor for this generalized IFS. We show that the Hutchinson operators for countable and multivalued θ-contraction IFSs are Picard. Finally, when the map θ is continuous, we show the relation between the code space and the attractor of θ-contraction IFS.

Growth functions of lie algebras associated with associative algebras

Let [Formula: see text] be a finitely generated associative algebra over a field [Formula: see text] of characteristic [Formula: see text] and let [Formula: see text] be its associated Lie algebra. In this paper, we investigate relations between the growth functions of [Formula: see text] and the Lie algebra [Formula: see text]. We prove that if A is generated by a finite collection of nilpotent elements, then the growth functions are asymptotically equivalent.

Semigroups of Isometries of the Hyperbolic Plane

Motivated by a problem on the dynamics of compositions of plane hyperbolic isometries, we prove several fundamental results on semigroups of isometries, thought of as real Möbius transformations. We define a semigroup $S$ of Möbius transformations to be semidiscrete if the identity map is not an accumulation point of $S$. We say that $S$ is inverse free if it does not contain the identity element. One of our main results states that if $S$ is a semigroup generated by some finite collection $\mathcal{F}$ of Möbius transformations, then $S$ is semidiscrete and inverse free if and only if every sequence of the form $F_n=f_1\dotsb f_n$, where $f_n\in \mathcal{F}$, converges pointwise on the upper half-plane to a point on the ideal boundary, where convergence is with respect to the chordal metric on the extended complex plane. We fully classify all two-generator semidiscrete semigroups and include a version of Jørgensen’s inequality for semigroups. We also prove theorems that have familiar counterparts in the theory of Fuchsian groups. For instance, we prove that every semigroup is one of four standard types: elementary, semidiscrete, dense in the Möbius group, or composed of transformations that fix some nontrivial subinterval of the extended real line. As a consequence of this theorem, we prove that, with certain minor exceptions, a finitely generated semigroup $S$ is semidiscrete if and only if every two-generator semigroup contained in $S$ is semidiscrete. After this we examine the relationship between the size of the “group part” of a semigroup and the intersection of its forward and backward limit sets. In particular, we prove that if $S$ is a finitely generated nonelementary semigroup, then $S$ is a group if and only if its two limit sets are equal. We finish by applying some of our methods to address an open question of Yoccoz.

Parisian Time of Reflected Brownian Motion with Drift on Rays and Its Application in Banking

In this paper, we study the Parisian time of a reflected Brownian motion with drift on a finite collection of rays. We derive the Laplace transform of the Parisian time using a recursive method, and provide an exact simulation algorithm to sample from the distribution of the Parisian time. The paper was motivated by the settlement delay in the real-time gross settlement (RTGS) system. Both the central bank and the participating banks in the system are concerned about the liquidity risk, and are interested in the first time that the duration of settlement delay exceeds a predefined limit. We reduce this problem to the calculation of the Parisian time. The Parisian time is also crucial in the pricing of Parisian type options; to this end, we will compare our results to the existing literature.

Divergent trajectories in arithmetic homogeneous spaces of rational rank two

Let G be a semisimple real algebraic group defined over ${\mathbb {Q}}$ , $\Gamma $ be an arithmetic subgroup of G, and T be a maximal ${\mathbb {R}}$ -split torus. A trajectory in $G/\Gamma $ is divergent if eventually it leaves every compact subset. In some cases there is a finite collection of explicit algebraic data which accounts for the divergence. If this is the case, the divergent trajectory is called obvious. Given a closed cone in T, we study the existence of non-obvious divergent trajectories under its action in $G\kern-1pt{/}\kern-1pt\Gamma $ . We get a sufficient condition for the existence of a non-obvious divergence trajectory in the general case, and a full classification under the assumption that $\mathrm {rank}_{{\mathbb {Q}}}G=\mathrm {rank}_{{\mathbb {R}}}G=2$ .

Waiting Time Problems for Patterns in a Sequence of Multi-State Trials

In this paper, we investigate waiting time problems for a finite collection of patterns in a sequence of independent multi-state trials. By constructing a finite GI/M/1-type Markov chain with a disaster and then using the matrix analytic method, we can obtain the probability generating function of the waiting time. From this, we can obtain the stopping probabilities and the mean waiting time, but it also enables us to compute the waiting time distribution by a numerical inversion.