On $ n $-tuplewise IP-sensitivity and thick sensitivity

<p style='text-indent:20px;'>Let <inline-formula><tex-math id="M2">\begin{document}$ (X,T) $\end{document}</tex-math></inline-formula> be a topological dynamical system and <inline-formula><tex-math id="M3">\begin{document}$ n\geq 2 $\end{document}</tex-math></inline-formula>. We say that <inline-formula><tex-math id="M4">\begin{document}$ (X,T) $\end{document}</tex-math></inline-formula> is <inline-formula><tex-math id="M5">\begin{document}$ n $\end{document}</tex-math></inline-formula>-tuplewise IP-sensitive (resp. <inline-formula><tex-math id="M6">\begin{document}$ n $\end{document}</tex-math></inline-formula>-tuplewise thickly sensitive) if there exists a constant <inline-formula><tex-math id="M7">\begin{document}$ \delta&gt;0 $\end{document}</tex-math></inline-formula> with the property that for each non-empty open subset <inline-formula><tex-math id="M8">\begin{document}$ U $\end{document}</tex-math></inline-formula> of <inline-formula><tex-math id="M9">\begin{document}$ X $\end{document}</tex-math></inline-formula>, there exist <inline-formula><tex-math id="M10">\begin{document}$ x_1,x_2,\dotsc,x_n\in U $\end{document}</tex-math></inline-formula> such that</p><p style='text-indent:20px;'><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ \Bigl\{k\in \mathbb{N}\colon \min\limits_{1\le i&lt;j\le n}d(T^k x_i,T^k x_j)&gt;\delta\Bigr\} $\end{document} </tex-math></disp-formula></p><p style='text-indent:20px;'>is an IP-set (resp. a thick set).</p><p style='text-indent:20px;'>We obtain several sufficient and necessary conditions of a dynamical system to be <inline-formula><tex-math id="M11">\begin{document}$ n $\end{document}</tex-math></inline-formula>-tuplewise IP-sensitive or <inline-formula><tex-math id="M12">\begin{document}$ n $\end{document}</tex-math></inline-formula>-tuplewise thickly sensitive and show that any non-trivial weakly mixing system is <inline-formula><tex-math id="M13">\begin{document}$ n $\end{document}</tex-math></inline-formula>-tuplewise IP-sensitive for all <inline-formula><tex-math id="M14">\begin{document}$ n\geq 2 $\end{document}</tex-math></inline-formula>, while it is <inline-formula><tex-math id="M15">\begin{document}$ n $\end{document}</tex-math></inline-formula>-tuplewise thickly sensitive if and only if it has at least <inline-formula><tex-math id="M16">\begin{document}$ n $\end{document}</tex-math></inline-formula> minimal points. We characterize two kinds of sensitivity by considering some kind of factor maps. We introduce the opposite side of pairwise IP-sensitivity and pairwise thick sensitivity, named (almost) pairwise IP<inline-formula><tex-math id="M17">\begin{document}$ ^* $\end{document}</tex-math></inline-formula>-equicontinuity and (almost) pairwise syndetic equicontinuity, and obtain dichotomies results for them. In particular, we show that a minimal system is distal if and only if it is pairwise IP<inline-formula><tex-math id="M18">\begin{document}$ ^* $\end{document}</tex-math></inline-formula>-equicontinuous. We show that every minimal system admits a maximal almost pairwise IP<inline-formula><tex-math id="M19">\begin{document}$ ^* $\end{document}</tex-math></inline-formula>-equicontinuous factor and admits a maximal pairwise syndetic equicontinuous factor, and characterize them by the factor maps to their maximal distal factors.</p>

Balances in the Set of Arithmetic Progressions

This article focuses on searching and classifying balancing numbers in a set of arithmetic progressions. The sufficient and necessary conditions for the existence of balancing numbers are presented. Moreover, explicit formulae of balancing numbers and various relations are included.

Dynamic Analysis of a Phytoplankton-Fish Model with the Impulsive Feedback Control Depending on the Fish Density and Its Changing Rate

This paper proposes a comprehensive fishing strategy that takes into consideration the population density of fish and its current growth rate, which provides new ideas for fishing strategies. Firstly, we establish a phytoplankton-fish model with the impulsive feedback control depending on the density and rate of change of the fish. Secondly, the complex phase and impulse sets of this model are divided into three cases, then the Poincar´e map for the model is defined, and analyzed the properties of Poincar´e map. In addition, the sufficient and necessary conditions for the global asymptotic stability of the order-1 periodic solution and existence condition of order- k ( k ≥ 2) periodic solution are discussed. The action threshold depends on the density and rate of change of the fish, which is reasonable than earlier studies. The analysis method proposed in this paper also plays an important role in the analysis of impulse models with complex phase sets or impulse sets.

Optimal allocation of relevations in coherent systems

In this paper we study the allocation problem of relevations in coherent systems. The optimal allocation strategies are obtained by implementing stochastic comparisons of different policies according to the usual stochastic order and the hazard rate order. As special cases of relevations, the load-sharing and minimal repair policies are further investigated. Sufficient (and necessary) conditions are established for various stochastic orderings. Numerical examples are also presented as illustrations.

A Class of New Permutation Polynomials over F 2 n

In this paper, according to the known results of some normalized permutation polynomials with degree 5 over F 2 n , we determine sufficient and necessary conditions on the coefficients b 1 , b 2 ∈ F 2 n 2 such that f x = x 3 x ¯ 2 + b 1 x 2 x ¯ + b 2 x permutes F 2 n . Meanwhile, we obtain a class of complete permutation binomials over F 2 n .

Estimate the spectrum of affine dynamical systems from partial observations of a single trajectory data

In this paper, we study the nonlinear inverse problem of estimating the spectrum of a system matrix, that drives a finite-dimensional affine dynamical system, from partial observations of a single trajectory data. In the noiseless case, we prove an annihilating polynomial of the system matrix, whose roots are a subset of the spectrum, can be uniquely determined from data. We then study which eigenvalues of the system matrix can be recovered and derive various sufficient and necessary conditions to characterize the relationship between the recoverability of each eigenvalue and the observation locations. We propose various reconstruction algorithms 1with theoretical guarantees, generalizing the classical Prony method, ESPRIT, and matrix pencil method. We test the algorithms over a variety of examples with applications to graph signal processing, disease modeling and a real-human motion dataset. The numerical results validate our theoretical results and demonstrate the effectiveness of the proposed algorithms, even when the data did not follow an exact linear dynamical system.

A New Notion of g-Angle in Normed

We discuss the g-orthogonality (⊥ g ) and its basic properties in a normed space. We also define a new g-angle between two vectors and prove its basic properties by using the g-orthogonality (⊥ g ). Moreover, we prove the sufficient and necessary conditions for strictly convexity in a normed space by using a new g-angle.

On SS-supplemented subgroups of some sylow subgroups of finite groups

Let [Formula: see text] be a finite group. A subgroup [Formula: see text] of [Formula: see text] is called to be [Formula: see text]-permutable in [Formula: see text] if [Formula: see text] permutes with all Sylow subgroups of [Formula: see text]. A subgroup [Formula: see text] of [Formula: see text] is said to be [Formula: see text]-supplemented in [Formula: see text] if there exists a subgroup [Formula: see text] of [Formula: see text] such that [Formula: see text] and [Formula: see text] is [Formula: see text]-permutable in [Formula: see text]. In this paper, we investigate [Formula: see text]-nilpotency of a finite group. As applications, we give some sufficient and necessary conditions for a finite group belongs to a saturated formation.

Controllability of Differential Systems with the General Conformable Derivative

In this paper, the controllability of differential systems with the general conformable derivative is studied. By elaborating the rank criterion and the conformable Gram criterion, sufficient and necessary conditions to investigate that a linear general conformable system is null completely controllable are given. We obtain a full generalization to the general conformable fractional-order system case. In addition, Krasnoselskii’s fixed point theorem to obtain a complete controllability result for a semilinear general conformable system is applied.