Sharp spectral bounds for complex perturbations of the indefinite Laplacian

We derive quantitative bounds for eigenvalues of complex perturbations of the indefinite Laplacian on the real line. Our results substantially improve existing results even for real potentials. For $L^1$-potentials, we obtain optimal spectral enclosures which accommodate also embedded eigenvalues, while our result for $L^p$-potentials yield sharp spectral bounds on the imaginary parts of eigenvalues of the perturbed operator for all $p\in [1,\infty )$. The sharpness of the results are demonstrated by means of explicit examples.     

关于拉普拉斯谱半径的一个不等式

设G是一个简单连通图,v是图G的一个割点.G_1,G_2,…,G_s(s≥2)是图G的s个v-分支.令H_1=G_1∪G_2∪…∪G_t,H_2=G_(t+1)∪G_(t+2)∪…∪G_s,其中1≤t相似文献   

Rectangling a rectangle

We show that the following are equivalent: (i) A rectangle of eccentricityv can be tiled using rectangles of eccentricityu. (ii) There is a rational function with rational coefficients,Q(z), such thatv =Q(u) andQ maps each of the half-planes {z | Re(z) < 0} and {z | Re(z) > 0 into itself, (iii) There is an odd rational function with rational coefficients,Q(z), such thatv = Q(u) and all roots ofv = Q(z) have a positive real part. All rectangles in this article have sides parallel to the coordinate axes and all tilings are finite. We letR(x, y) denote a rectangle with basex and heighty. In 1903 Dehn [1 ] proved his famous result thatR(x, y) can be tiled by squares if and only ify/x is a rational number. Dehn actually proved the following result. (See [4] for a generalization to tilings using triangles.) The first and third authors were partially supported by NSF.     

An indefinite measure in J-spaces

An analogue of Gleason's theorem for the logic of all J-projectors of an approximate W^*J-factor in a J-space is proposed.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 10, pp. 1406–1408, October, 1990.     

An estimate on the non-real spectrum of a singular indefinite Sturm-Liouville operator

It will be shown with the help of the Birman-Schwinger principle that the non-real spectrum of the singular indefinite Sturm-Liouville operator sgn(·)(−d²/dx² + q) with a real potential q ∈ L¹ ∩ L² is contained in a circle around the origin with radius . (© 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An indefinite concave-convex equation under a Neumann boundary condition I

We investigate the problem (P _λ) ?Δu = λb(x)|u| ^q?2 u + a(x)|u| ^p?2 u in Ω, ?u/?n = 0 on ?Ω, where Ω is a bounded smooth domain in R ^N (N ≥ 2), 1 < q < 2 < p, λ ∈ R, and a, b ∈ \({C^\alpha }\left( {\overline \Omega } \right)\) with 0 < α < 1. Under certain indefinite type conditions on a and b, we prove the existence of two nontrivial nonnegative solutions for small |λ|. We then characterize the asymptotic profiles of these solutions as λ → 0, which in some cases implies the positivity and ordering of these solutions. In addition, this asymptotic analysis suggests the existence of a loop type component in the non-negative solutions set. We prove the existence of such a component in certain cases, via a bifurcation and a topological analysis of a regularized version of (P _λ).     

An eigenvalue bound for the Laplacian of a graph

We present a lower bound for the smallest non-zero eigenvalue of the Laplacian of an undirected graph. The bound is primarily useful for graphs with small diameter.     

An approximation algorithm for dissecting a rectangle into rectangles with specified areas

Given a rectangle R with area α and a set of n positive reals A={a₁,a₂,…,a_n} with ∑_ai∈Aa_i=α, we consider the problem of dissecting R into n rectangles r_i with area so that the set R of resulting rectangles minimizes an objective function such as the sum of the perimeters of the rectangles in R, the maximum perimeter of the rectangles in R, and the maximum aspect ratio of the rectangles in R, where we call the problems with these objective functions PERI-SUM, PERI-MAX and ASPECT-RATIO, respectively. We propose an O(nlogn) time algorithm that finds a dissection R of R that is a 1.25-approximate solution to PERI-SUM, a -approximate solution to PERI-MAX, and has an aspect ratio at most , where ρ(R) denotes the aspect ratio of R.     

Search game in a rectangle

We consider a search game in which the searcher (player S) moves along a continuous trajectory in a rectangleQ. The velocity vectogram of player S is a rhombus-type set. In this paper, we construct the strategies of both players which make it possible to find the asymptotic value of the game in the case of small discovery radius.The author would like to thank the referee for considerable simplification of the proof of Theorem 4.1.     

An improved algorithm for the rectangle enclosure problem

Given a set of n rectangles in the plane, with sides parallel to the coordinate axes, the rectangle enclosure problem consists of finding all q pairs of rectangles such that one rectangle of the pair encloses the other. In this note we present an alternative algorithm to the one by Vaishnavi and Wood; while both techniques have worst-case running time O(nlog²n + q), ours uses optimal storage O(n) rather than O(nlog²n) of Vaishnavi and Wood. Our algorithm works entirely in-place and uses very conventional data structures.     

A note on finding a maximum empty rectangle

Given a rectangle A and a set S of n points in A, the maximum empty rectangle problem is that of finding a largest-area rectangle which is contained in A, has its sides parallel to those of A, and does not contain any of the points in S. This note describes an efficient algorithm for solving this problem.     

Locating an axis-parallel rectangle on a Manhattan plane

In this paper we consider the problem of locating an axis-parallel rectangle in the plane such that the sum of distances between the rectangle and a finite point set is minimized, where the distance is measured by the Manhattan norm ? ₁. In this way we solve an extension of the Weber problem to extensive facility location. As a model, our problem is appropriate for position sensing of rectangular objects.