Search

In this paper, the fast synchronization problem of 5D Hindmarsh-Rose neuron networks is studied. Firstly, the global predefined-time stability of a class of nonlinear dynamical systems is investigated under the complete beta function. Then an active controller via backstepping design is proposed to achieve predefined-time synchronization of two 5D Hindmarsh-Rose neuron networks in which the synchronization time of each state variable of the master-slave 5D Hindmarsh-Rose neuron networks is different and can be defined in advance, respectively. To show the applicability of the obtained theoretical results, the designed predefined-time backstepping controller is applied to secure communication to realize asynchronous communication of multiple different messages. Three numerical simulations are provided to validate the theoretical results. [ABSTRACT FROM AUTHOR]

In previous work it was shown that the lower triangular generalized Hausdorff matrix Hαa with nonzero entries hnk= (n+α+1)-1, for a ≥ 0, is subnormal on Ι² if and only if α=0,1,2, …. For 0h : ..., is subnormal when .... In this paper we show that, when dj = Γ( j+1)Γ(h)/Γ( j+h), the square of the weights chosen above, then the corresponding operator Ch is bounded on Ι² for 0 < h < 3/2, that Hα is bounded on Ι² for all non-integer α < 0, and that Ch is closely related to Hh-1. This relationship leads to our main result that Ch is only subnormal when h = 1, when it corresponds to the original Cesaro operator with α = 0 and each dj = 1. [ABSTRACT FROM AUTHOR]

The blended solutions are more general than the unblended solutions for polynomial-like iterative equation with multivalued functions. In this paper we study the blended solutions of polynomial-like iterative equation with multivalued functions. [ABSTRACT FROM AUTHOR]

Text Let K be a complete, algebraically closed, non-Archimedean valued field, and let ϕ ∈ K ( z ) with deg ⁡ ( ϕ ) ≥ 2 . In this paper we consider the family of functions ord Res ϕ n ( x ) , which measure the resultant of ϕ n at points x in P K 1 , the Berkovich projective line, and show that they converge locally uniformly to the diagonal values of the Arakelov–Green's function g μ ϕ ( x , x ) attached to the canonical measure of ϕ . Following this, we are able to prove an equidistribution result for Rumely's crucial measures ν ϕ n , each of which is a probability measure supported at finitely many points whose weights are determined by dynamical properties of ϕ . Video For a video summary of this paper, please visit https://youtu.be/YCCZD1iwe00 . [ABSTRACT FROM AUTHOR]

Abstract In this paper, we consider the following nonlinear waveequation with variable exponents: u t t − div (| ∇ u | r (⋅) − 2 ∇ u) + | u t | m (⋅) − 2 u t = 0. By using a lemma by Komornik, we prove the decay estimates for the solution under suitable assumptions on the variable exponents m , r and the initial data. We also give two numerical applications to illustrate our theoretical results. [ABSTRACT FROM AUTHOR]

Let F q denote the finite field of order q . In this paper, some new classes of permutation polynomials of the form ( x p m − x + δ ) s + x over F p 2 m are obtained by determining the number of solutions of certain equations. [ABSTRACT FROM AUTHOR]

A ring R is said to be left uniquely generated if R a = R b in R implies that a = u b for some unit u in R . These rings have been of interest since Kaplansky introduced them in 1949 in his classic study of elementary divisors. Writing l ( b ) = { r ∈ R | r b = 0 } , a theorem of Canfell asserts that R is left uniquely generated if and only if, whenever R a + l ( b ) = R where a , b ∈ R , then a − u ∈ l ( b ) for some unit u in R . By analogy with the stable range 1 condition we call a ring with this property left annihilator-stable. In this paper we exploit this perspective on the left UG rings to construct new examples and derive new results. For example, writing J for the Jacobson radical, we show that a semiregular ring R is left annihilator-stable if and only if R / J is unit-regular, an analogue of Bass' theorem that semilocal rings have stable range 1. [ABSTRACT FROM AUTHOR]

Sixty (35 girls) ninth graders were assessed on measures of algebraic reasoning and usage of visual and symbolic representations (with a prompt for visual use) to solve equations and inequalities. The study grouped visual representations into two categories: arithmetic-visual, which entailed the use of real-world objects to represent specific values of variables, and algebraic-visual, which involved formal representations like the number line and the coordinate plane. Symbolic representations, on the other hand, encompassed the use of standard algorithms to solve equations, such as changing the place of terms in an equation. The results reveal that the use of algebraic visuals, as opposed to arithmetic visuals, was associated with enhanced algebraic reasoning. Further, although the students initially relied on standard algorithms to explain equations and inequalities, they could produce accurate algebraic-visual representations when prompted. These findings suggest that students have multiple representations of equations and inequalities but only express visual representations when asked to do so. In keeping with the general relationship between visuospatial abilities and mathematics, self-generated algebraic-visual representations partially mediated the relation between overall mathematics achievement and algebraic reasoning. [ABSTRACT FROM AUTHOR]

This paper deals with the solvability of interval matrix equations in max-plus algebra. Max-plus algebra is the algebraic structure in which classical addition and multiplication are replaced by ⊕ and ⊗, where a ⊕ b = max ⁡ { a , b } and a ⊗ b = a + b . The notation A ⊗ X ⊗ C = B represents an interval max-plus matrix equation, where A , B , and C are given interval matrices. We define four types of solvability of interval max-plus matrix equations, i.e., the tolerance, weak tolerance, left-weak tolerance, and right-weak tolerance solvability. We derive the necessary and sufficient conditions for checking each of them, whereby all can be verified in polynomial time. [ABSTRACT FROM AUTHOR]

Tensor computation is intensive and difficult. Invariably, a vital component is the truncation of tensors, so as to control the memory and associated computational requirements. Various tensor toolboxes have been designed for such a purpose, in addition to transforming tensors between different formats. In this paper, we propose a simple Q-less QR truncation technique for tensors { x ( i ) } with x ( i ) ∈ R n 1 × ⋯ × n d in the simple and natural Kronecker product form. It generalizes the QR decomposition with column pivoting, adapting the well-known Gram–Schmidt orthogonalization process. The main difficulty lies in the fact that linear combinations of tensors cannot be computed or stored explicitly. All computations have to be performed on the coefficients α i in an arbitrary tensor v = ∑ i α i x ( i ) . The orthonormal Q factor in the QR decomposition X ≡ [ x ( 1 ) , ⋯ , x ( p ) ] = Q R cannot be computed but expressed as X R − 1 when required. The resulting algorithm has an O ( p 2 d n ) computational complexity, with n = max ⁡ n i . Some illustrative examples in the numerical solution of tensor linear equations are presented. [ABSTRACT FROM AUTHOR]

In the present paper we will ask for the lattice L(MVEx) of subvarieties of the variety defined by the set Ex(MV) of all externally com- patible identities valid in the variety MV of all MV-algebras. In particular, we will find all subdirectly irreducible algebras from the classes in the lattice L(MVEx) and give syntactical and semantical characterization of the class of algebras defined by P-compatible identities of MV-algebras. [ABSTRACT FROM AUTHOR]

In this paper, we consider the asymptotic behavior of solutions for nonlocal dispersal equation with non-homogeneous boundary conditions. We find that the long-time behavior is determined by the boundary value. [ABSTRACT FROM AUTHOR]

Based on properties of Green's function and by Avery-Peterson fixed point theorem, the existence of multiple positive solutions are obtained for singular p-Laplacian fractional differential equation with infinite-point boundary conditions, and an example is given to demonstrate the validity of our main results. [ABSTRACT FROM AUTHOR]

Let R be a prime ring with center Z(R). Suppose that R admits a generalized semiderivation F with associated derivation d 6= 0. In the present paper we investigate the commutativity of a prime ring R satisfying any one of the identities: (i) F([x; y]) 2 Z(R), (ii) F(x-y) 2 Z(R), (iii) F(xy)-xy 2 Z(R), (iv) F(xy) - yx 2 Z(R), (v) [F(x); F(y)] = 0; (vi) F(x) - F(y) = 0 for all x; y 2 R. [ABSTRACT FROM AUTHOR]

Formal mathematics is a paragon of abstractness. It thus seems natural to assume that the mathematical expert should rely more on symbolic or conceptual processes, and less on perception and action. We argue instead that mathematical proficiency relies on perceptual systems that have been retrained to implement mathematical skills. Specifically, we investigated whether the visual system-in particular, object-based attention-is retrained so that parsing algebraic expressions and evaluating algebraic validity are accomplished by visual processing. Object-based attention occurs when the visual system organizes the world into discrete objects, which then guide the deployment of attention. One classic signature of object-based attention is better perceptual discrimination within, rather than between, visual objects. The current study reports that object-based attention occurs not only for simple shapes but also for symbolic mathematical elements within algebraic expressions-but only among individuals who have mastered the hierarchical syntax of algebra. Moreover, among these individuals, increased object-based attention within algebraic expressions is associated with a better ability to evaluate algebraic validity. These results suggest that, in mastering the rules of algebra, people retrain their visual system to represent and evaluate abstract mathematical structure. We thus argue that algebraic expertise involves the regimentation and reuse of evolutionarily ancient perceptual processes. Our findings implicate the visual system as central to learning and reasoning in mathematics, leading us to favor educational approaches to mathematics and related STEM fields that encourage students to adapt, not abandon, their use of perception. [ABSTRACT FROM AUTHOR]

We generalize the notion of a laterally convergent net from increasing nets to general ones and study the corresponding lateral continuity of maps. The main result asserts that, the lateral continuity of an orthogonally additive operator is equivalent to its continuity at zero. This theorem holds for operators that send laterally convergent nets to any type convergent nets (laterally, order or norm convergent). [ABSTRACT FROM AUTHOR]