Search

In this paper we resolve a conjecture of Kresch and Tamvakis [Duke Math. J. 110 (2001), pp. 359–376]. Our result is the following. Theorem : For any positive integer D and any integers i,j (0\leq i,j \leq D), \; the absolute value of the following hypergeometric series is at most 1: \begin{equation*} {_4F_3} \left [ \begin {array}{c} -i, \; i+1, \; -j, \; j+1 \\ 1, \; D+2, \; -D \end{array} ; 1 \right ]. \end{equation*} To prove this theorem, we use the Biedenharn-Elliott identity, the theory of Leonard pairs, and the Perron-Frobenius theorem. [ABSTRACT FROM AUTHOR]

The energy of a graph G, denoted by E(G), is defined as the sum of absolute values of all eigenvalues of G. A graph G is called reciprocal if 1/≥ is an eigenvalue of G whenever λ is an eigenvalue of G. Further, if λ and 1 λ have the same multiplicities, for each eigenvalue λ, then it is called strong reciprocal. In (MATCH Commun. Math. Comput. Chem. 83 (2020) 631{633), it was conjectured that for every graph G with maximum degree Δ(G) and minimum degree ∞(G) whose adjacency matrix is non-singular, E(G) λ Δ(G) + ∞(G) and the equality holds if and only if G is a complete graph. Here, we prove the validity of this conjecture for some strong reciprocal graphs. Moreover, we show that if G is a strong reciprocal graph, then E(G) λ Δ(G) + ∞(G) - 1 2. Recently, it has been proved that if G is a reciprocal graph of order n and its spectral radius, ?, is at least 4λmin, where λmin is the smallest absolute value of eigenvalues of G, then E(G) λ n + 1 2. In this paper, we extend this result to almost all strong reciprocal graphs without the mentioned assumption. [ABSTRACT FROM AUTHOR]

Inequalities are frequently used in various fields of mathematics to prove theorems. The existence of inequalities contributes significantly to the foundations of such branches. In this paper, we study the properties of order relations in the system of dual numbers, which is inspired by order relations defined on real numbers. Besides, some special inequalities that are used in various fields of mathematics, such as Cauchy-Schwarz, Minkowski, and Chebyshev are studied in this framework. An example is also provided to validate our research findings. [ABSTRACT FROM AUTHOR]

This paper investigates the bifurcations of the following difference equations xn+1=axn+byne−xn,yn+1=cyn+dxne−yn,xn+1=ayn+bxne−yn,yn+1=cxn+dyne−xn,where a,b,c, and d are positive constants and the initial conditions x0 and y0 are positive numbers. Psarros, Papaschinopoulos, and Schinas (Math. Methods Appl. Sci., 2016, 39: 5216–5222) presented the semistability of the fixed point (0,0) when one eigenvalue is equal to 1 and the other eigenvalue has absolute value less than 1. In this paper, we consider another case: one eigenvalue is equal to −1. With the aid of the center manifold reduction theorem, we rigorously show that these two systems undergo flip bifurcations or generalized flip bifurcations. Moreover, the stability of the fixed point (0,0) and the existence of period‐two cycles are also given. [ABSTRACT FROM AUTHOR]

In the paper [Optim. Methods Softw., 31 (2016), pp. 904{930] we derived first order (KKT) and second order (second order suffciency condition (SOSC)) optimality conditions for functions defined by evaluation programs involving smooth elementals and absolute values. In that analysis, a key assumption on the local piecewise linearization was the linear independence kink qualification (LIKQ), a generalization of the linear independence constraint qualification (LICQ) known from smooth nonlinear optimization. Firstly, we show here that under LIKQ and SOSC with strict complementarity, the natural algorithm of successive abs-linear minimization with a proximal term (SALMIN) achieves a linear rate of convergence. A version of SALMIN called LiPsMin has already been implemented and tested in [Math. Program., 158 (2016), pp. 383{415; Math. Program. (2018), https://doi.org/10.1007/s10107-018-1273-5]. Secondly, we observe that, even without any kink qualifications, local optimality of the nonlinear objective always requires local optimality of its piecewise linearization, and strict minimality of the latter is in fact equivalent to sharp minimality of the former. Moreover, we show that SALMIN will converge quadratically to such sharp minimizers, where the function exhibits linear growth. These results are independent of the particular function representation, and allow in particular duplications of switching variables and other intermediates. Furthermore, we derive for nonsharp minimizers necessary and suffcient optimality conditions without any kink qualification. Finally, we present numerical results to illustrate the obtained convergence results. [ABSTRACT FROM AUTHOR]

The paper deals with hypergroupoids obtained from ternary relations.The correspondence between ternary relation and hypergroups, studied by the author, especially in the case when the relation ρ is symmetric and reflexive, is analyzed here in the most general context.A necessary and sufficient condition on a ternary relation ρ is obtained for the associated hypergroupoid to be a hypergroup or a join space. Extension of a hyperoperation associated with a ternary relation being employed to obtain a associated join space of the spherical geometry. [ABSTRACT FROM AUTHOR]

Finding the solution of the absolute value equation (AVE) A x − | x | = b has attracted much attention in recent years. In this paper, we propose a relaxed nonlinear PHSS-like iterative method, which is more efficient than the Picard-HSS iterative method for the AVE, and is a generalization of the nonlinear HSS-like iteration method for the AVE. By using the theory of nonsmooth analysis, we prove the convergence of the relaxed nonlinear PHSS-like iterative method for the AVE. Numerical experiments are given to demonstrate the feasibility, robustness and effectiveness of the relaxed nonlinear HSS-like method. [ABSTRACT FROM AUTHOR]