A sufficient condition for a polynomial to be stable

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Sufficient Condition for a Digraph to Be Hamiltonian

In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...

متن کامل

A necessary and sufficient condition for stable matching rules to be strategy-proof

Incompatibility between stability and strategy-proofness is well-known in the two-sided matching theory and this has been problems especially in designing matching rules. One possible resolution to such an impossibility result is to focus on the restricted preference domain. This paper analyzes the scope for the situation where the sets of admissible preferences for one side of the market are r...

متن کامل

A sufficient condition for planar graphs to be 3-colorable

Planar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be 3-colorable. We conjecture that, moreover, each plane graph with neither 5-cycles nor intersecting 3-cycles is 3-colorable. In this conjecture, none of the two assumptions can be dropped because there exist planar 4-chromatic graphs without 5-cycles, as well as planar 4chromatic graphs without intersect...

متن کامل

A necessary condition for a Shearlet system to be a frame via admissibility

    Necessary conditions for  shearlet  and cone-adapted shearlet systems to be frames are presented with respect to the admissibility condition of generators.

متن کامل

A Sharp Sufficient Condition for Sparsity Pattern Recovery

Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2008

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2008.05.079