نتایج جستجو برای: golab schinzel equation

تعداد نتایج: 230033  

Journal: :Plodovodstvo 2022

The article provides an assessment of the quality fruits promising apple tree hybrids Belarusian selection.
 Promising with a complex economic and biological characteristics (appearance, taste, keeping quality, marketability)
 were identified – 2005-15/2-I (96-41/5 × Golab Kohanz), 2005-16/1-I (Zorka Start), 2006-23/26-II (Nadzejny open
 pollinated). This sampling will be used in...

2015
Elena Khramtcova Evanthia Papadopoulou

We present linear-time algorithms to construct tree-like Voronoi diagrams with disconnected regions after the sequence of their faces along an enclosing boundary (or at infinity) is known. We focus on the farthest-segment Voronoi diagram, however, our techniques are also applicable to constructing the order-(k+1) subdivision within an order-k Voronoi region of segments and updating a nearest-ne...

Journal: :حفاظت گیاهان 0
کبری مسلم خانی مرتضی همتی حسن حاج نجار سپیده امین خاکی

the internal infections of erwinia amylovora have important roles for disease beginning in the spring and dissemination of inoculum through infected vegetative planting material and nursery trees. in this study, we survey internal infection of erwinia amylovora in symptomless commercial apple cultivars in karaj and damavand cities, using optimized diagnostic methods such as plating on semi sele...

2005
H. A. HELFGOTT

This conjecture can be traced to Chowla ([1], p. 96). It is closely related to the Bunyakovsky– Schinzel conjecture on primes represented by irreducible polynomials. The one-variable analogue of (1.1) is classical for deg f = 1 and quite hopeless for deg f > 1. We know (1.1) itself when deg f ≤ 2. (The main ideas of the proof go back to de la Vallée-Poussin ([3], [4]); see [11], §3.3, for an ex...

2011
Joshua Harrington

In 1960 Sierpiński proved that there are infinitely many odd positive integers k such that k · 2 + 1 is composite for all positive integers n. A polynomial variation of Sierpiński’s result has been investigated by several people. More specifically, the question has been asked, for which integers d does there exist a polynomial f(x) ∈ Z[x] with f(1) 6= −d such that f(x) ·x + d is reducible over ...

2014
Elena Khramtcova Evanthia Papadopoulou

We present linear-time algorithms to construct tree-structured Voronoi diagrams, after the sequence of their regions at infinity or along a given boundary is known. We focus on Voronoi diagrams of line segments, including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor diagram. Although tree-...

2005
Stefan Barańczuk

C. Corrales-Rodrigáñez and R. Schoof answered the question and proved its analogue for number fields and for elliptic curves in [C-RS]. A. Schinzel proved the support problem for the pair of sets of positive integers in [S]. G. Banaszak, W. Gajda and P. Krasoń examined the support problem for abelian varieties for which the images of the l-adic representation is well controled and for K-theory ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید