Reformulation of Hensel’s Lemma and extension of a theorem of Ore

In this paper, we extend the theorem of Ore regarding factorization of polynomials over p-adic numbers to henselian valued fields of arbitrary rank thereby generalizing the main results of Khanduja and Kumar (J Pure Appl Algebra 216:2648–2656, 2012) and Cohen et al. (Mathematika 47:173–196, 2000). As an application, we derive the analogue of Dedekind’s Theorem regarding splitting of rational primes in algebraic number fields as well as of its converse for general valued fields extending similar results proved for discrete valued fields in Khanduja and Kumar (Int J Number Theory 4:1019–1025, 2008). The generalized version of Ore’s Theorem leads to an extension of a result of Weintraub dealing with a generalization of Eisenstein Irreducibility Criterion (cf. Weintraub in Proc Am Math Soc 141:1159–1160, 2013). We also give a reformulation of Hensel’s Lemma for polynomials with coefficients in henselian valued fields which is used in the proof of the extended Ore’s Theorem and was proved in Khanduja and Kumar (J Algebra Appl 12:1250125, 2013) in the particular case of complete rank one valued fields.     

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.     

Existence and Strong Uncountability

On the standard view for something to exist is for one thing to exist: in slogan form, to be is to be countable (cf. van Inwagen 2009). E.J. Lowe (2009, 2003, 1998) argues something can exist without being countable as one, however. His primary example is homogenous “stuff,” i.e., qualitatively uniform and infinitely divisible matter. Lacking nonarbitrary boundaries and being everywhere the same, homogenous stuff lacks a principle of individuation that would yield countably distinct constituents. So, for Lowe, homogenous stuff is strongly uncountable. Olson (2011) rejects Lowe’s view and defends the orthodox connection between existence and number. He argues that if there is any stuff, there is a (determinate) number of portions of stuff. Sider (2011, 2001) also rejects a stuff ontology, claiming it is incompatible with his preferred view that the familiar quantifiers of predicate logic carve at nature’s joints. Against these arguments, I defend the uncountability of stuff and the possibility of existence without countability. If to be is to be countable, more is needed than the arguments that Olson and Sider provide.     

Optimal Rearrangement Invariant Sobolev Embeddings in Mixed Norm Spaces

We improve the Sobolev-type embeddings due to Gagliardo (Ric Mat 7:102–137, 1958) and Nirenberg (Ann Sc Norm Sup Pisa 13:115–162, 1959) in the setting of rearrangement invariant (r.i.) spaces. In particular, we concentrate on seeking the optimal domains and the optimal ranges for these embeddings between r.i. spaces and mixed norm spaces. As a consequence, we prove that the classical estimate for the standard Sobolev space \(W^{1}L^{p}\) by Poornima (Bull Sci Math 107(3):253–259,  1983), O’Neil (Duke Math J 30:129–142,  1963) and Peetre (Ann Inst Fourier 16(1):279–317,  1966) (\(1 \le p < n\)), and by Hansson (Math Scand 45(1):77–102,  1979, Brezis and Wainger (Commun Partial Differ Equ 5(7):773–789,  1980) and Maz’ya (Sobolev spaces,  1985) (\(p=n\)) can be further strengthened by considering mixed norms on the target spaces.     

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.     

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.     

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.     

Haglund’s conjecture on 3-column Macdonald polynomials

We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund (Proc Natl Acad Sci USA 101(46):16127–16131, 2004). The proof requires expressing a noncommutative Schur function as a positive sum of monomials in Lam’s (Eur J Combin 29(1):343–359, 2008) algebra of ribbon Schur operators. Combining this result with the expression of Haglund et al. (J Am Math Soc 18(3):735–761, 2005) for transformed Macdonald polynomials in terms of LLT polynomials then yields a positive combinatorial rule for transformed Macdonald polynomials indexed by a shape with 3 columns.     

Condition Length and Complexity for the Solution of Polynomial Systems

Smale’s 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale in Mathematical problems for the next century, American Mathematical Society, Providence, 2000). The main progress on Smale’s problem is Beltrán and Pardo (Found Comput Math 11(1):95–129, 2011) and Bürgisser and Cucker (Ann Math 174(3):1785–1836, 2011). In this paper, we will improve on both approaches and prove an interesting intermediate result on the average value of the condition number. Our main results are Theorem 1 on the complexity of a randomized algorithm which improves the result of Beltrán and Pardo (2011), Theorem 2 on the average of the condition number of polynomial systems which improves the estimate found in Bürgisser and Cucker (2011), and Theorem 3 on the complexity of finding a single zero of polynomial systems. This last theorem is similar to the main result of Bürgisser and Cucker (2011) but relies only on homotopy methods, thus removing the need for the elimination theory methods used in Bürgisser and Cucker (2011). We build on methods developed in Armentano et al. (2014).     

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).     

A simple proof of Olatinwo’s theorems

In this paper we provide a simple proof of the existence coupled fixed point theorem in complete cone metric spaces due to Sabetghadam et al. (Fixed Point Theory Appl 2009:8, 2009) and due to Olatinwo (Annali Dell’Universita’Di Ferrara 57:173–180, 2011). In particular we prove that these results are spacial cases of Rezapour and Hamlbarani’s theorems (J Math Anal Appl 345(2):719–724, 2008).     

Spectral transfer morphisms for unipotent affine Hecke algebras

We classify the spectral transfer morphisms (cf. Opdam in Adv Math 286:912–957, 2016) between affine Hecke algebras associated to the unipotent types of the various inner forms of an unramified absolutely simple algebraic group G defined over a non-archimedean local field k. This turns out to characterize Lusztig’s classification (Lusztig in Int Math Res Not 11:517–589, 1995; in Represent Theory 6:243–289, 2002) of unipotent characters of G in terms of the Plancherel measure, up to diagram automorphisms. As an application of these results, the spectral correspondences associated with such morphisms (Opdam 2016), and some results of Ciubotaru, Kato and Kato [CKK] (also see Ciubotaru and Opdam in A uniform classification of the discrete series representations of affine Hecke algebras. arXiv:1510.07274) we prove a conjecture of Hiraga, Ichino and Ikeda [HII] on formal degrees and adjoint gamma factors in the special case of unipotent discrete series characters of inner forms of unramified simple groups of adjoint type defined over k.     

Amalgamating players,symmetry, and the Banzhaf value

We suggest new characterizations of the Banzhaf value without the symmetry axiom, which reveal that the characterizations by Lehrer (Int J Game Theory 17:89–99, 1988) and Nowak (Int J Game Theory 26:137–141, 1997) as well as most of the characterizations by Casajus (Theory Decis 71:365–372, 2011b) are redundant. Further, we explore symmetry implications of Lehrer’s 2-efficiency axiom.     

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.     

Dependence structure and test of independence for some well-known bivariate distributions

In this paper, we study the dependence structure of some bivariate distribution functions based on dependence measures of Kochar and Gupta (Biometrika 74(3):664–666, 1987) and Shetty and Pandit (Stat Methods Appl 12:5–17, 2003) and then compare these measures with Spearman’s rho and Kendall’s tau. Moreover, the empirical power of the class of distribution-free tests introduced by Kochar and Gupta (1987) and Shetty and Pandit (2003) is computed based on exact and asymptotic distribution of U-statistics. Our results are obtained from simulation work in some continuous bivariate distributions for the sample of sizes \(n=6,8,15,20\) and 50. Also, we apply some examples to illustrate the results. Finally, we compare the common estimators of dependence parameter based on empirical MSE.     

Robust return risk measures

In this paper we provide an axiomatic foundation to Orlicz risk measures in terms of properties of their acceptance sets, by exploiting their natural correspondence with shortfall risk Föllmer and Schied (Stochastic finance. De Gruyter, Berlin, 2011), thus paralleling the characterization in Weber (Math Financ 16:419–442, 2006). From a financial point of view, Orlicz risk measures assess the stochastic nature of returns, in contrast to the common use of risk measures to assess the stochastic nature of a position’s monetary value. The correspondence with shortfall risk leads to several robustified versions of Orlicz risk measures, and of their optimized translation invariant extensions (Rockafellar and Uryasev in J Risk 2:21–42, 2000, Goovaerts et al. in Insur Math Econ 34:505–516, 2004), arising from an ambiguity averse approach as in Gilboa and Schmeidler (J Math Econ 18:141–153, 1989), Maccheroni et al. (Econometrica 74:1447–1498, 2006), Chateauneuf and Faro (J Math Econ 45:535–558, 2010), or from a multiplicity of Young functions. We study the properties of these robust Orlicz risk measures, derive their dual representations, and provide some examples and applications.     

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.     

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.     

A Geometric Proof of Bourgain’s $$L^2$$ Estimate of Maximal Operators Along Analytic Vector Fields

Bourgain (A remark on the maximal function associated to an analytic vector field. Analysis at Urbana, Cambridge University Press, Cambridge, 1989) proved that the maximal operator associated with an analytic vector field is bounded on \(L^2\). In the present paper, we give a geometric proof of Bourgain’s result by using the tools developed by Lacey and Li in (Trans Am Math Soc 358(9):4099–4117, 2006) and (Mem Am Math Soc 205 (965):viii+72, 2010).     

New characterizations of the Takagi function via functional equations

We provide two new characterizations of the Takagi function as the unique bounded solution of some systems of two functional equations. The results are independent of those obtained by Kairies (Wy? Szko? Ped Krakow Rocznik Nauk Dydakt Prace Mat 196:73–82, 1998), Kairies (Aequ Math 53:207–241, 1997), Kairies (Aequ Math 58:183–191, 1999) and Kairies et al. (Rad Mat 4:361–374, 1989; Errata, Rad Mat 5:179–180, 1989).