Search

In this paper, we focus on the nonlinear least squares problem: \min _{{\boldsymbol {x}}\in \mathbb {H}^d}\|\lvert A{\boldsymbol {x}}\rvert -{\boldsymbol {b}}\| where A\in \mathbb {H}^{m\times d}, {\boldsymbol {b}}\in \mathbb {R}^m with \mathbb {H}\in \left \{\mathbb {R},\mathbb {C}\right \} and consider the uniqueness and stability of solutions. This problem arises in applications such as phase retrieval and absolute value rectification neural networks. While several results have been developed to characterize the uniqueness and stability of solutions when {\boldsymbol {b}}=\lvert A{\boldsymbol {x}}_0\rvert for some {\boldsymbol {x}}_0\in \mathbb {H}^d, no existing results address the case where {\boldsymbol {b}} is arbitrary. In this paper, we investigate the uniqueness and stability of solutions for the more general case where {\boldsymbol {b}} is not necessarily equal to \lvert A{\boldsymbol {x}}_0\rvert for any {\boldsymbol {x}}_0\in \mathbb {H}^d. We prove that for any matrix A\in \mathbb {H}^{m\times d}, there is always a vector {\boldsymbol {b}}\in \mathbb {R}^m for which the solution to the nonlinear least squares problem is not unique. However, we show that such "bad" vectors {\boldsymbol {b}} are negligible in practice; specifically, if {\boldsymbol {b}}\in \mathbb {R}_{ }^m does not lie in some measure zero set, then the solution is unique. Furthermore, we establish certain conditions under which the solution is guaranteed to be unique. Regarding the stability of solutions, we prove that the solution is not uniformly stable. However, if we restrict the vectors {\boldsymbol {b}} to a convex set where the solution to the least squares problem is unique, then the solution becomes stable. To the best of our knowledge, our results represent the first theoretical results of the uniqueness and stability of solutions for the nonlinear least squares problem. [ABSTRACT FROM AUTHOR]

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]

An exchange matrix B dominates an exchange matrix B' if the signs of corresponding entries weakly agree, with the entry of B always having weakly greater absolute value. When B dominates B', interesting things happen in many cases (but not always): the identity map between the associated mutation-linear structures is often mutation-linear; the mutation fan for B often refines the mutation fan for B'; the scattering (diagram) fan for B often refines the scattering fan for B'; and there is often an injective homomorphism from the principal-coefficients cluster algebra for B' to the principal-coefficients cluster algebra for B, preserving \mathbf {g}-vectors and sending the set of cluster variables for B' (or an analogous larger set) into the set of cluster variables for B (or an analogous larger set). The scope of the description "often" is not the same in all four contexts and is not settled in any of them. In this paper, we prove theorems that provide examples of these dominance phenomena. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the study of the Bohr phenomenon for a quasisubordination family of functions, and establish the classical Bohr's inequality for the class of quasisubordinate functions. As a consequence, we improve and obtain the exact version of the classical Bohr's inequality for bounded analytic functions and also for K-quasiconformal harmonic mappings by replacing the constant term by the absolute value of the analytic part of the given function. We also obtain the Bohr radius for the subordination family of odd analytic functions. [ABSTRACT FROM AUTHOR]