Search

In this paper, we first generalize to any hyper-Kahler manifold X with $$b_3(X)\not =0$$ results proved by O’Grady for hyper-Kahler manifolds of generalized Kummer type. In the second part, we restrict to hyper-Kahler manifolds of generalized Kummer type and prove, using results of Markman, that their Kuga–Satake correspondence is algebraic.

Sendov’s conjecture states that if all the zeroes of a complex polynomial P(z) of degree at least two lie in the unit disk, then within a unit distance of each zero lies a critical point of P(z). In a paper that appeared in 2014, Degot proved that, for each a ∈ (0, 1), there exists an integer N such that for any polynomial P(z) with degree greater than N, if P(a) = 0 and all zeroes lie inside the unit disk, the disk |z − a| ≤ 1 contains a critical point of P(z). Based on this result, we derive an explicit formula N(a) for each a ∈ (0, 1) and, consequently obtain a uniform bound N for all a ∈ [α, β] where 0 < α < β < 1. This (partially) addresses the questions posed in Degot’s paper.

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

In 1935, Erdos proved that all natural numbers can be written as a sum of a square of a prime and a square-free number. In 1939, Pillai derived an asymptotic formula for the number of such representations. The mathematical review of Pillai’s paper stated that the proof of the above result contained inaccuracies, thus casting a doubt on the correctness of the paper. In this paper, we re-examine Pillai’s paper and show that his argument was essentially correct. Afterwards, we improve the error term in Pillai’s theorem using the Bombieri–Vinogradov theorem.

We fill a gap in the proof of one of the central theorems in Epp's paper, concerning $p$-cyclic extensions of complete discrete valuation rings., Comment: 3 pages

In Venkaiah [1] an algorithm for solving linear optimization problems based on the idea of the projective algorithm of Karmarkar, is proposed. The essential simplification in the new algorithm is the use of a fixed projection operator. In this way the algorithm requires onlyO(n2) operations to obtain a sufficient exact solution. In this note it is shown that in some special cases the algorithm of Venkaiah yields a feasible solution that is far from the optimal one.

In the previous paper [T] we gave a classification of hermitian forms over the real function fieldk=R(t) and its completionsk v with respect to valuationsv trivial onR. Unfortunately in the local case the arguments given for cases A and D, in general, were not correct. Therefore the resulting local and local-global classifications obtained were incorrect. I would like also to thank Dr. D. Hoffmann for pointing out these mistakes and the referee for useful comments. Here we would like to make necessary corrections to [T]. We keep the same notation used there, except that in the first paragraph,J is not the standard involution of a quaternion division algebraD (with basis {1,i,j,ij}). All hermitian forms will be hermitian forms with respect toJ, with values inD.

We show functoriality of γα in our joint paper with A. Csaszar “Further remarks on δ- and θ-modifications”.

In the paper [1], the authors obtain a KAM theorem for nearly integrable hamiltonian systems under the Russmann’s non-degeneracy condition, which is known to be sharpest one for small divisor conditions. However, the Remark 1.3 is wrong because we have ignored the null set − ∗, which may contain zeros of ω of high order such that (1.4) does not hold for all p ∈ . The Remark 1.3 might mislead the readers that the condition (1.5) of Theorem B is equivalent to the Russmann’s non-degeneracy condition. Actually, the Russmann’s non-degeneracy condition is equivalent to the condition (1.4) of Theorem A as proved in [1]. Under the Russmann’s non-degeneracy condition (1.4), as proved in the Remark 3.1 the condition (1.5) holds if we replace n − 1 by a sufficiently large number N depending on h, and then the conclusion of Theorem B remains valid if in the measure estimate n − 1 is replaced by N .

We note that Theorem 5.4 of the paper ``Characteristic cycles of perverse sheaves and Milnor fibers" (by P. Nang and K. Takeuchi, published online in Math. Zeitschrift, October 15, 2004) holds for "any" non-zero complex number $a$., Comment: 1page

This paper deals with Schrodinger operators as they were treated by Kato - Ikebe [3]. It is shown that every element of the domain of definition of the adjoint of such an operator has locally square integrable distributional derivatives up to the order 2. For this the potential of the Schrodinger operator must fulfil a local Stummel condition; if the potential is only locally square integrable a somewhat weaker statement is possible for three dimensions (see remark 2 at the end of this paper).

In the mentioned paper of Hadwiger an upper bound is given for α (A)·N(A), where α (A) is the density of covering ℝn by lattice translates ofA⊂ℝn andN(A) is the number of neighbours ofA. Using “dual” descriptions of α (A) andN(A), in the paper a sharpening of Hadwiger's inequality as well as a lower bound for α (A)·N(A) are proved.

Månsson and Shukur (Econ Model 28:1475–1481, 2011) proposed a Poisson ridge regression estimator (PRRE) to reduce the negative effects of multicollinearity. However, a weakness of the PRRE is its relatively large bias. Therefore, as a remedy, Türkan and Özel (J Appl Stat 43:1892–1905, 2016) examined the performance of almost unbiased ridge estimators for the Poisson regression model. These estimators will not only reduce the consequences of multicollinearity but also decrease the bias of PRRE and thus perform more efficiently. The aim of this paper is twofold. Firstly, to derive the mean square error properties of the Modified Almost Unbiased PRRE (MAUPRRE) and Almost Unbiased PRRE (AUPRRE) and then propose new ridge estimators for MAUPRRE and AUPRRE. Secondly, to compare the performance of the MAUPRRE with the AUPRRE, PRRE and maximum likelihood estimator. Using both simulation study and real-world dataset from the Swedish football league, it is evidenced that one of the proposed, MAUPRRE ($$ \hat{k}_{q4} $$ k ^ q 4 ) performed better than the rest in the presence of high to strong (0.80–0.99) multicollinearity situation.

It is shown that unbranched proper holomorphic maps between pseudoconvex domains with smooth C∞ boundaries, one of which satisfies subelliptic estimates for the\(\bar \partial\)-Neumann problem on (0,1)-forms, extend to unbranched C∞-coverings between the closures of the domains.

Several formulas for translation-invariant operator ideals overLp-spaces of compact groups are proved by tensor product methods.

Cooperative games form an important class of problems in game theory, where a key goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assigns a value share to each player. A crucial aspect of such games is submodularity (or convexity). Indeed, convex instances of cooperative games exhibit several nice properties, e.g. regarding the existence and computation of allocations realizing some of the most important solution concepts proposed in the literature. For this reason, a relevant question is whether one can give a polynomial-time characterization of submodular instances, for prominent cooperative games that are in general non-convex. In this paper, we focus on a fundamental and widely studied cooperative game, namely the spanning tree game. An efficient recognition of submodular instances of this game was not known so far, and explicitly mentioned as an open question in the literature. We here settle this open problem by giving a polynomial-time characterization of submodular spanning tree games.

The main goal of this short paper is to prove the existence of rank 2 simple and special Ulrich bundles on a wide class of elliptic surfaces: namely, on regular Weierstrass fibrations \(\pi : S\rightarrow \mathbb {P}^1\). Alongside we also show the existence of rank 2 weakly Ulrich sheaves on arbitrary Weierstrass fibrations \(S\rightarrow C_0\) and we deal with the (non-)existence of rank one Ulrich bundles on them.

n/a

We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system with Hessian driven damping and a Tikhonov regularization term in connection with the minimization of a smooth convex function in Hilbert spaces. We obtain fast convergence results for the function values along the trajectories. The Tikhonov regularization term enables the derivation of strong convergence results of the trajectory to the minimizer of the objective function of minimum norm.

We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensional, optimization problems to global optimality. We assume that the optimization variables are in a bounded subset of a Hilbert space, and we determine worst-case run-time bounds for the algorithm under certain regularity conditions of the cost functional and the constraint set. Because these run-time bounds are independent of the number of optimization variables and, in particular, are valid for optimization problems with infinitely many optimization variables, we prove that the algorithm converges to an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}ε-suboptimal global solution within finite run-time for any given termination tolerance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document}ε>0. Finally, we illustrate these results for a problem of calculus of variations.