We consider the nonlinear n-th order boundary value problem Lu=u(n)=f(t,u(t),u′(t),…,u(n−1)(t))=Nu given arbitrary bounded linear functional conditions Bi(u)=0, i=1,…,n and develop a method that allows us to study all such resonance problems of one, as well implementing more general constructive for deriving existence criteria in framework coincidence degree Mawhin. demonstrate applicability fo...

in this paper, we consider the finitely 2-generated groups k(s,l) and g_m as follows:k(s,l) = ;g_m = and find the explicit formulas for the probability of having nth-roots for them. also weinvestigate integers n for which, these groups are n-central.

We study the non-commutative supersymmetric Yang-Mills theory at strong coupling using the AdS/CFT correspondence. The supergravity description and the UV/IR relation confirms the expectation that the non-commutativity affects the ultra-violet but not the infra-red of the Yang-Mills dynamics. We show that the supergravity solution dual to the non-commutative N = 4 SYM in four dimensions has no ...

Two types of robust cycle bases are defined via recursively nice arrangements; complete and bipartite complete graphs are shown to have such bases. It is shown that a diagram in a groupoid is commutative up to natural equivalence (cutne) if for each cycle in a robust basis of the graph underlying the diagram, the composition of the morphisms is naturally equivalent to the identity. For a hyperc...

We analyze Neuberger’s double pass algorithm for the matrix-vector multiplication R(H) · Y (where R(H) is (n − 1, n)-th degree rational polynomial of positive definite operator H), and show that the number of floating point operations is independent of the degree n, provided that the number of sites is much larger than the number of iterations in the conjugate gradient. This implies that the ma...

Xavier Gourdon and Pascal Sebah February 12, 2003 Is it possible to compute directly the n-th digit of π without computing all its first n digits ? At first sight, the problem seems of the same complexity. Recently [1], a formula which permits to find directly the n-th bit of π with very little memory and in quasi-linear time was exhibited. In other words, the question has a positive answer in ...

in this paper‎, ‎we study some properties of analytic extension of a $n$th roots of $m$-hyponormal operator‎. ‎we show that every analytic extension of a $n$th roots of $m$-hyponormal operator is subscalar of order $2k+2n$‎. ‎as a consequence‎, ‎we get that if the spectrum of such operator $t$ has a nonempty interior in $mathbb{c}$‎, ‎then $t$ has a nontrivial invariant subspace‎. ‎finally‎, ‎w...

OBJECTIVE To investigate the factors affecting rehabilitation outcomes in children with congenital muscular torticollis (CMT). METHODS We retrospectively reviewed the medical records of 347 patients who were clinically suspected as having CMT and performed neck ultrasonography to measure sternocleidomastoid (SCM) muscle thickness. Fifty-four patients met the inclusion criteria. Included were ...

Let Fq be the finite field with q elements and let ! be a primitive n-th root of unity in an extension eld Fqd of Fq. Given a polynomial P 2 Fq[x] of degree less than n, we will show that its discrete Fourier transform (P (1); P (!); :::; P (!n¡1)) 2Fqd n can be computed essentially d times faster than the discrete Fourier transform of a polynomial Q 2 Fqd[x] of degree less than n, in many case...