On the solution of systems of equations with constant rank derivatives

The famous for its simplicity and clarity Newton–Kantorovich hypothesis of Newton’s method has been used for a long time as the sufficient convergence condition for solving nonlinear equations. Recently, in the elegant study by Hu et al. (J Comput Appl Math 219:110–122, 2008), a Kantorovich-type convergence analysis for the Gauss–Newton method (GNM) was given improving earlier results by Häubler (Numer Math 48:119–125, 1986), and extending some results by Argyros (Adv Nonlinear Var Inequal 8:93–99, 2005, 2007) to hold for systems of equations with constant rank derivatives. In this study, we use our new idea of recurrent functions to extend the applicability of (GNM) by replacing existing conditions by weaker ones. Finally, we provide numerical examples to solve equations in cases not covered before (Häubler, Numer Math 48:119–125, 1986; Hu et al., J Comput Appl Math 219:110–122, 2008; Kontorovich and Akilov 2004).     

On spectral synthesis in varieties containing the solutions of inhomogeneous linear functional equations

As a continuation of our previous work [2] the aim of the recent paper is to investigate the solutions of special inhomogeneous linear functional equations by using spectral synthesis in translation invariant closed linear subspaces of additive/multiadditive functions containing the restrictions of the solutions to finitely generated fields. The idea is based on the fundamental work of [5]. Using spectral analysis in some related varieties we can prove the existence of special solutions (automorphisms) of the functional equation but spectral synthesis allows us to describe the entire space of solutions on a large class of finitely generated fields. It is spanned by the so-called exponential monomials which can be given in terms of automorphisms of \({\mathbb C}\) and differential operators. We apply the general theory to some inhomogeneous problems motivated by quadrature rules of approximate integration [8], see also [7, 9].     

Extensions of the Noncommutative Integration

In this paper we will continue the analysis undertaken in Bagarello et al. (Rend Circ Mat Palermo (2) 55:21–28, 2006), Bongiorno et al. (Rocky Mt J Math 40(6):1745–1777, 2010), Triolo (Rend Circ Mat Palermo (2) 60(3):409–416, 2011) on the general problem of extending the noncommutative integration in a *-algebra of measurable operators. As in Aiena et al. (Filomat 28(2):263–273, 2014), Bagarello (Stud Math 172(3):289–305, 2006) and Bagarello et al. (Rend Circ Mat Palermo (2) 55:21–28, 2006), the main problem is to represent different types of partial *-algebras into a *-algebra of measurable operators in Segal’s sense, provided that these partial *-algebras posses a sufficient family of positive linear functionals (states) (Fragoulopoulou et al., J Math Anal Appl 388(2):1180–1193, 2012; Trapani and Triolo, Stud Math 184(2):133–148, 2008; Trapani and Triolo, Rend Circolo Mat Palermo 59:295–302, 2010; La Russa and Triolo, J Oper Theory, 69:2, 2013; Triolo, J Pure Appl Math, 43(6):601–617, 2012). In this paper, a new condition is given in an attempt to provide a extension of the non commutative integration.     

Improved local convergence analysis of the Gauss–Newton method under a majorant condition

We present a local convergence analysis of Gauss-Newton method for solving nonlinear least square problems. Using more precise majorant conditions than in earlier studies such as Chen (Comput Optim Appl 40:97–118, 2008), Chen and Li (Appl Math Comput 170:686–705, 2005), Chen and Li (Appl Math Comput 324:1381–1394, 2006), Ferreira (J Comput Appl Math 235:1515–1522, 2011), Ferreira and Gonçalves (Comput Optim Appl 48:1–21, 2011), Ferreira and Gonçalves (J Complex 27(1):111–125, 2011), Li et al. (J Complex 26:268–295, 2010), Li et al. (Comput Optim Appl 47:1057–1067, 2004), Proinov (J Complex 25:38–62, 2009), Ewing, Gross, Martin (eds.) (The merging of disciplines: new directions in pure, applied and computational mathematics 185–196, 1986), Traup (Iterative methods for the solution of equations, 1964), Wang (J Numer Anal 20:123–134, 2000), we provide a larger radius of convergence; tighter error estimates on the distances involved and a clearer relationship between the majorant function and the associated least squares problem. Moreover, these advantages are obtained under the same computational cost.     

Vertex-Compressed Subalgebras of a Graph von Neumann Algebra

In Cho (Acta Appl. Math. 95:95–134, 2007 and Complex Anal. Oper. Theory 1:367–398, 2007), we introduced Graph von Neumann Algebras which are the (groupoid) crossed product algebras of von Neumann algebras and graph groupoids via graph-representations, which are groupoid actions. In Cho (Acta Appl. Math. 95:95–134, 2007), we showed that such crossed product algebras have the amalgamated reduced free probabilistic properties, where the reduction is totally depending on given directed graphs. Moreover, in Cho (Complex Anal. Oper. Theory 1:367–398, 2007), we characterize each amalgamated free blocks of graph von Neumann algebras: we showed that they are characterized by the well-known von Neumann algebras: Classical group crossed product algebras and (operator-valued) matricial algebras. This shows that we can provide a nicer way to investigate such groupoid crossed product algebras, since we only need to concentrate on studying graph groupoids and characterized algebras. How about the compressed subalgebras of them? i.e., how about the inner (cornered) structures of a graph von Neumann algebra? In this paper, we will provides the answer of this question. Consequently, we show that vertex-compressed subalgebras of a graph von Neumann algebra are characterized by other graph von Neumann algebras. This gives the full characterization of the vertex-compressed subalgebras of a graph von Neumann algebra, by other graph von Neumann algebras.     

On the generalization of the Salem test

The assertion that the Salem test [5] for the uniform convergence of a trigonometric Fourier series is improvable, is proved. In particular, an example of a continuous function, which does not fulfill the condition of the Salem test but satisfies the condition of the generalized Salem test [10], is constructed.Besides, the theorem which improves Golubov’s [3,4] result for continuous functions of two variables, is given.     

On some problems of tensor calculus. I

Basic definitions of linear algebra and functional analysis are given. In particular, the definitions of a semigroup, group, ring, field, module, and linear space are given [1, 2, 3, 6]. A local theorem on the existence of homeomorphisms is stated. Definitions of the inner r-product, local inner product of tensors whose rank is not less than r, and of local norm of a tensor [22] are also given. Definitions are given and basic theorems and propositions are stated and proved concerning the linear dependence and independence of a system of tensors of any rank. Moreover, definitions and proofs of some theorems connected with orthogonal and biorthonormal tensor systems are given. The definition of a multiplicative basis (multibasis) is given and ways of construction bases of modules using bases of modules of smaller dimensions. In this connection, several theorems are stated and proved. Tensor modules of even orders and problems on finding eigenvalues and eigentensors of any even rank are studied in more detail than in [22]. Canonical representations of a tensor of any even rank are given. It is worth while to note that it was studied by the Soviet scientist I. N. Vekua, and an analogous problem for the elasticity modulus tensor was considered by the Polish scientist Ya. Rikhlevskii in 1983–1984.     

Performance of convex underestimators in a branch-and-bound framework

The efficient determination of tight lower bounds in a branch-and-bound algorithm is crucial for the global optimization of models spanning numerous applications and fields. The global optimization method \(\alpha \)-branch-and-bound (\(\alpha \)BB, Adjiman et al. in Comput Chem Eng 22(9):1159–1179, 1998b, Comput Chem Eng 22(9):1137–1158, 1998a; Adjiman and Floudas in J Global Optim 9(1):23–40, 1996; Androulakis et al. J Global Optim 7(4):337–363, 1995; Floudas in Deterministic Global Optimization: Theory, Methods and Applications, vol. 37. Springer, Berlin, 2000; Maranas and Floudas in J Chem Phys 97(10):7667–7678, 1992, J Chem Phys 100(2):1247–1261, 1994a, J Global Optim 4(2):135–170, 1994), guarantees a global optimum with \(\epsilon \)-convergence for any \(\mathcal {C}^2\)-continuous function within a finite number of iterations via fathoming nodes of a branch-and-bound tree. We explored the performance of the \(\alpha \)BB method and a number of competing methods designed to provide tight, convex underestimators, including the piecewise (Meyer and Floudas in J Global Optim 32(2):221–258, 2005), generalized (Akrotirianakis and Floudas in J Global Optim 30(4):367–390, 2004a, J Global Optim 29(3):249–264, 2004b), and nondiagonal (Skjäl et al. in J Optim Theory Appl 154(2):462–490, 2012) \(\alpha \)BB methods, the Brauer and Rohn+E (Skjäl et al. in J Global Optim 58(3):411–427, 2014) \(\alpha \)BB methods, and the moment method (Lasserre and Thanh in J Global Optim 56(1):1–25, 2013). Using a test suite of 40 multivariate, box-constrained, nonconvex functions, the methods were compared based on the tightness of generated underestimators and the efficiency of convergence of a branch-and-bound global optimization algorithm.     

A brief note on the coarea formula

In this note we consider a special case of the famous Coarea Formula whose initial proof (for functions from any Riemannian manifold of dimension 2 into \({\mathbb {R}}\)) is due to Kronrod (Uspechi Matem Nauk 5(1):24–134, 1950) and whose general proof (for Lipschitz maps between two Riemannian manifolds of dimensions n and p) is due to Federer (Am Math Soc 93:418–491, 1959). See also Maly et al. (Trans Am Math Soc 355(2):477–492, 2002), Fleming and Rishel (Arch Math 11(1):218–222, 1960) and references therein for further generalizations to Sobolev mappings and BV functions respectively. We propose two counterexamples which prove that the coarea formula that we can find in many references (for example Bérard (Spectral geometry: direct and inverse problems, Springer, 1987), Berger et al. (Le Spectre d’une Variété Riemannienne, Springer, 1971) and Gallot (Astérisque 163(164):31–91, 1988), is not valid when applied to \(C^\infty \) functions. The gap appears only for the non generic set of non Morse functions.     

Locally piecewise affine functions and their order structure

Piecewise affine functions on subsets of \(\mathbb R^m\) were studied in Aliprantis et al. (Macroecon Dyn 10(1):77–99, 2006), Aliprantis et al. (J Econometrics 136(2):431–456, 2007), Aliprantis and Tourky (Cones and duality, 2007), Ovchinnikov (Beitr\(\ddot{\mathrm{a}}\)ge Algebra Geom 43:297–302, 2002). In this paper we study a more general concept of a locally piecewise affine function. We characterize locally piecewise affine functions in terms of components and regions. We prove that a positive function is locally piecewise affine iff it is the supremum of a locally finite sequence of piecewise affine functions. We prove that locally piecewise affine functions are uniformly dense in \(C(\mathbb R^m)\), while piecewise affine functions are sequentially order dense in \(C(\mathbb R^m)\). This paper is partially based on Adeeb (Locally piece-wise affine functions, 2014)     

Local convergence and the dynamics of a two-point four parameter Jarratt-like method under weak conditions

We present a local convergence analysis of a two-point four parameter Jarratt-like method of high convergence order in order to approximate a locally unique solution of a nonlinear equation. In contrast to earlier studies such us (Amat et al. Aequat. Math. 69(3), 212–223 2015; Amat et al. J. Math. Anal. Appl. 366(3), 24–32 2010; Behl, R. 2013; Bruns and Bailey Chem. Eng. Sci. 32, 257–264 1977; Candela and Marquina. Computing 44, 169–184 1990; Candela and Marquina. Computing 45(4), 355–367 1990; Chun. Appl. Math. Comput. 190(2), 1432–1437 2007; Cordero and Torregrosa. Appl. Math. Comput. 190, 686–698 2007; Deghan. Comput. Appl Math. 29(1), 19–30 2010; Deghan. Comput. Math. Math. Phys. 51(4), 513–519 2011; Deghan and Masoud. Eng. Comput. 29(4), 356–365 15; Cordero and Torregrosa. Appl. Math. Comput. 190, 686–698 2012; Deghan and Masoud. Eng. Comput. 29(4), 356–365 2012; Ezquerro and Hernández. Appl. Math. Optim. 41(2), 227–236 2000; Ezquerro and Hernández. BIT Numer. Math. 49, 325–342 2009; Ezquerro and Hernández. J. Math. Anal. Appl. 303, 591–601 2005; Gutiérrez and Hernández. Comput. Math. Appl. 36(7), 1–8 1998; Ganesh and Joshi. IMA J. Numer. Anal. 11, 21–31 1991; González-Crespo et al. Expert Syst. Appl. 40(18), 7381–7390 2013; Hernández. Comput. Math. Appl. 41(3-4), 433–455 2001; Hernández and Salanova. Southwest J. Pure Appl. Math. 1, 29–40 1999; Jarratt. Math. Comput. 20(95), 434–437 1966; Kou and Li. Appl. Math. Comput. 189, 1816–1821 2007; Kou and Wang. Numer. Algor. 60, 369–390 2012; Lorenzo et al. Int. J. Interact. Multimed. Artif. Intell. 1(3), 60–66 2010; Magreñán. Appl. Math. Comput. 233, 29–38 2014; Magreñán. Appl. Math. Comput. 248, 215–224 2014; Parhi and Gupta. J. Comput. Appl. Math. 206(2), 873–887 2007; Rall 1979; Ren et al. Numer. Algor. 52(4), 585–603 2009; Rheinboldt Pol. Acad. Sci. Banach Ctr. Publ. 3, 129–142 1978; Sicilia et al. J. Comput. Appl. Math. 291, 468–477 2016; Traub 1964; Wang et al. Numer. Algor. 57, 441–456 2011) using hypotheses up to the fifth derivative, our sufficient convergence conditions involve only hypotheses on the first Fréchet-derivative of the operator involved. The dynamics of the family for choices of the parameters such that it is optimal is also shown. Numerical examples are also provided in this study     

A Characterisation of Some $$\mathbf {}$$-Like Logics

In Béziau (Log Log Philos 15:99–111, 2006) a logic \(\mathbf {Z}\) was defined with the help of the modal logic \(\mathbf {S5}\). In it, the negation operator is understood as meaning ‘it is not necessary that’. The strong soundness–completeness result for \(\mathbf {Z}\) with respect to a version of Kripke semantics was also given there. Following the formulation of \(\mathbf {Z}\) we can talk about \(\mathbf {Z}\)-like logics or Beziau-style logics if we consider other modal logics instead of \(\mathbf {S5}\)—such a possibility has been mentioned in [1]. The correspondence result between modal logics and respective Beziau-style logics has been generalised for the case of normal logics naturally leading to soundness–completeness results [see Marcos (Log Anal 48(189–192):279–300, 2005) and Mruczek-Nasieniewska and Nasieniewski (Bull Sect Log 34(4):229–248, 2005)]. In Mruczek-Nasieniewska and Nasieniewski (Bull Sect Log 37(3–4):185–196, 2008), (Bull Sect Log 38(3–4):189–203, 2009) some partial results for non-normal cases are given. In the present paper we try to give similar but more general correspondence results for the non-normal-worlds case. To achieve this aim we have to enrich original Beziau’s language with an additional negation operator understood as ‘it is necessary that not’.     

On a rigidity result of singularities

The aim of this note is to prove, in the spirit of a rigidity result for isolated singularities of Schlessinger see Schlessinger (Invent Math 14:17–26, 1971) or also Kleiman and Landolfi (Compositio Math 23:407–434, 1971), a variant of a rigidity criterion for arbitrary singularities (Theorem 2.1 below). The proof of this result does not use Schlessinger’s Deformation Theory [Schlessinger (Trans Am Math Soc 130:208–222, 1968) and Schlessinger (Invent Math 14:17–26, 1971)]. Instead it makes use of Local Grothendieck-Lefschetz Theory, see (Grothendieck 1968, Éxposé 9, Proposition 1.4, page 106) and a Lemma of Zariski, see (Zariski, Am J Math 87:507–536, 1965, Lemma 4, page 526). I hope that this proof, although works only in characteristic zero, might also have some interest in its own.     

On spectral analysis in varieties containing the solutions of inhomogeneous linear functional equations

The aim of the paper is to investigate the solutions of special inhomogeneous linear functional equations using spectral analysis in a translation invariant closed linear subspace of additive/multiadditive functions containing the restrictions of the solutions to finitely generated fields. The application of spectral analysis in some related varieties is a new and important trend in the theory of functional equations; especially they have successful applications in the case of homogeneous linear functional equations. The foundations of the theory can be found in Kiss and Varga (Aequat Math 88(1):151–162, 2014) and Kiss and Laczkovich (Aequat Math 89(2):301–328, 2015). We are going to adopt the main theoretical tools to solve some inhomogeneous problems due to Kocl?ga-Kulpa and Szostok (Ann Math Sylesianae 22:27–40, 2008), see also Kocl?ga-Kulpa and Szostok (Georgian Math J 16:725–736, 2009; Acta Math Hung 130(4):340–348, 2011). They are motivated by quadrature rules of approximate integration.     

Remarks on defective Fano manifolds

This note continues our previous work on special secant defective (specifically, conic connected and local quadratic entry locus) and dual defective manifolds. These are now well understood, except for the prime Fano ones. Here we add a few remarks on this case, completing the results in our papers (Russo in Math Ann 344:597–617, 2009; Ionescu and Russo in Compos Math 144:949–962, 2008; Ionescu and Russo in J Reine Angew Math 644:145–157, 2010; Ionescu and Russo in Am J Math 135:349–360, 2013; Ionescu and Russo in Math Res Lett 21:1137–1154, 2014); see also the recent book (Russo, On the Geometry of Some Special Projective Varieties, Lecture Notes of the Unione Matematica Italiana, Springer, 2016).     

Notes on entire functions sharing an entire function of a smaller order with their difference operators

In this paper, we study a uniqueness question of entire functions sharing an entire function of smaller order with their difference operators. The results in this paper extend Theorem 1.1 in [19] by Liu and Yang and deal with Question 1 in [19], where the entire functions are of finite order. Moreover, we repair certain statements in [21] by Li et al., which in turn had depended on questionable assertions of Lemma 2.6 in [20]. Examples are provided to show that the results in this paper are best possible.     

Note on a theorem of Eliahou

From a result (Wilf’s conjecture and Macaulay’s theorem, 2017, Theorem 5.11) of Eliahou on the growth of the Hilbert function of a standard graded algebra we derive an inequality related to a question in Wilf (Am Math Mon 85, 1978). This enables us to construct a (to our knowledge new) class of numerical semigroups of embedding dimension 5 and arbitrarily high Cohen-Macaulay-type, for which the question of Wilf (1978) has an affirmative answer.     

Truthmaker Internalism and the Mind-Dependence of Propositions

It is generally thought that truthmaking has to be an internal relation because if it weren’t, then, as David Armstrong argues, “everything may be a truthmaker for any truth” (1997: 198). Depending on whether we take an internal relation to be one that is necessitated by the mere existence of its terms (Armstrong 1997: 87 and 2004: 9) or one that supervenes on the intrinsic properties of its relata (Lewis 1986: 62), the truthbearers involved in the truthmaking relation must either have their contents essentially or intrinsically. In this paper, I examine Armstrong’s account (1973; 1997 and 2004), according to which what is made true at the fundamental level are mental state tokens. The conclusion is reached that such tokens have their contents neither essentially nor intrinsically, and so, are simply the wrong kind of entities to be made true internally.     

A precedence constraint value revisited

This paper discusses games where cooperation is restricted by a hierarchical structure. The model assumes that there is a hierarchy between certain coalitions given by a partition. Face games (González-Díaz and Sánchez-Rodríguez in Games Econ Behav 62:100–105, 2008) play a central role in the definition of the proposed hierarchical game. It turns out that the Shapley value of the hierarchical game coincides with the Faigle and Kern precedence constraint value (Faigle and Kern in Int J Game Theory 21:249–266, 1992) and with some particular weighted Shapley value (Kalai and Samet in Int J Game Theory 16:205–222, 1987). Two new characterizations of this hierarchical value are given. Finally, an application of the model is given for bankruptcy problems.