منابع مشابه
determinant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولUnit Disk Cover Problem
Given a set D of unit disks in the Euclidean plane, we consider (i) the discrete unit disk cover (DUDC) problem and (ii) the rectangular region cover (RRC) problem. In the DUDC problem, for a given set P of points the objective is to select minimum cardinality subset D∗ ⊆ D such that each point in P is covered by at least one disk in D∗. On the other hand, in the RRC problem the objective is to...
متن کاملThe Maximum Matrix Contraction Problem
In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem. Especially, we prove this problem to be NP-Complete and that every algorithm solving this problem is at most an √ n-approximation algorithm where n is the numb...
متن کاملRadial balanced metrics on the unit disk
Let Φ be a strictly plurisubharmonic and radial function on the unit disk D ⊂ C and let g be the Kähler metric associated to the Kähler form ω = i 2 ∂∂̄Φ. We prove that if g is geucl-balanced of height 3 (where geucl is the standard Euclidean metric on C = R), and the function h(x) = e−Φ(z), x = |z|, extends to an entire analytic function on R, then g equals the hyperbolic metric. The proof of o...
متن کاملOn random points in the unit disk
Let n be a positive integer and λ > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(λ, n) to be the graph with vertex set Vn, in which two vertices are adjacent if and only if their Euclidean distance is at most λ. We call this graph a unit disk random graph. Let λ = c √ lnn/n and let X be the number of isolated points in G(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90326-5