نتایج جستجو برای: s 16th problem

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

Journal: :Computers & Security 1993
Harold Joseph Highland

Journal: :journal of linear and topological algebra (jlta) 0
r jalilian department of mathematics, razi university tagh bostan, kermanshah p.o. box 6714967346 iran; y jalilian department of mathematics, razi university tagh bostan, kermanshah p.o. box 6714967346 iran; h jalilian school of mathematics, iran university of science and technology narmak, tehran 16844, iran

a class of new methods based on a septic non-polynomial spline function for the numerical solution one-dimensional bratu's problem are presented. the local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. the inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. associated bound...

Journal: :bulletin of the iranian mathematical society 0
b. khosravi department of pure mathematics‎, ‎faculty of mathematics and computer sciences‎, ‎amirkabir university of technology‎, ‎424‎, ‎hafez ave.‎, ‎tehran 15914‎, ‎iran. a. babai department of mathematics‎, ‎university of qom‎, ‎p.o‎. ‎box 37185-3766‎, ‎qom‎, ‎iran‎.

vasil'ev posed problem 16.26 in [the kourovka notebook: unsolved problems in group theory, 16th ed.,sobolev inst. math., novosibirsk (2006).] as follows:does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? conjecture: $k = 5$.in [zvezdina, on nonabelian simple groups having the same prime gr...

Journal: :Tobacco Control 2007

Journal: :Journal of Mechanical Design 1981

Journal: :Laser and Particle Beams 1984

Journal: :Electronic Notes in Discrete Mathematics 2009
Guillaume Fertin Stéphane Vialette

Let G be a graph of order n and size m. A labeling of G is a bijective mapping θ : V(G) → {1, 2, . . . , n}, and we call Θ(G) the set of all labelings of G. For any graph G and any labeling θ ∈ Θ(G), let SL(G, θ) = ∑ e∈E(G)min{θ(u) : u ∈ e}. In this paper, we consider the S-Labeling problem, defined as follows: Given a graph G, find a labeling θ ∈ Θ(G) that minimizes SL(G, θ). The S-Labeling pr...

2009
K. Bezdek

In the 1930’s, Tarski introduced his plank problem at a time when the field Discrete Geometry was about to born. It is quite remarkable that Tarski’s question and its variants continue to generate interest in the geometric and analytic aspects of coverings by planks in the present time as well. The paper is of a survey type with some new results and with a list of open research problems on the ...

2005
AUREL WINTNER A. WINTNER

tact, whereas those for a = 0.02 imply only 25% more frequent contacts than the all-ornone hypothesis but with rather high though rapidly diminishing attack rates. 10 Schuman and Doull, Amer. Jour. Pub. Health, 30, Supplement to March, 1940, p. 21, state: "From these estimates of carrier prevalence and froni the average annual increment in Shick-negatives, an estimate may be made of the number ...

2012
Vilmos Totik

For a system of smooth Jordan curves asymptotics for Christoffel functions is established almost everywhere for measures belonging to Szegő’s class. 1 The result Let μ be a finite Borel-measure on the plane with compact support consisting of infinitely many points. The Christoffel functions associated with μ are defined as λn(z, μ) = inf Pn(z)=1 ∫ |Pn|dμ, where the infimum is taken for all poly...

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

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