background: noninvasive techniques for the localization of the accessory pathways (aps) might help guide mapping procedures and ablation techniques. we sought to examine the diagnostic accuracy of strain imaging for the localization of the aps in wolff-parkinson-white syndrome. methods: w e prospectively studied 25 patients (mean age = 32 ± 17 years, 58.3% men) with evidence of pre-excitation o...

v. dannon showed that spherical curves in e4 can be given by frenet-like equations, and he thengave an integral characterization for spherical curves in e4 . in this paper, lorentzian spherical timelike andspacelike curves in the space time 41 r are shown to be given by frenet-like equations of timelike andspacelike curves in the euclidean space e3 and the minkowski 3-space 31 r . thus, finding...

Proof. Clearly (A ∩ B)[G] ⊆ A[G] ∩ B[G]. Let us show the opposite inclusion. It is enough to deal with ordinals. Note that B[G]∩ V = B, since Q ⊆ B. Let δ ∈ A[G]∩B[G]∩On = A[G]∩B ∩On. Pick a canonical name δ ∼ ∈ A such that δ ∼ = δ. It is of the form ⟨⟨qi, τ̌i⟩ | i < ρ ≤ |Q|⟩, where τi’s are in B and ⟨qi | i < ρ⟩ is a maximal antichain. Now, δ ∼ ∈ B, since |Q|B ⊆ B. So, δ ∼ ∈ A∩B. Hence, δ = δ ∼...

Assume that n and δ are positive integers with 3 ≤ δ < n. Let hc(n, δ) be the minimum number of edges required to guarantee ann-vertex graphGwithminimumdegree δ(G) ≥ δ to be hamiltonian connected. Any n-vertex graphGwith δ(G) ≥ δ is hamiltonian connected if |E(G)| ≥ hc(n, δ). We prove that hc(n, δ) = C(n − δ + 1, 2) + δ2 − δ + 1 if δ ≤ b n+3×(n mod 2) 6 c+1,hc(n, δ) = C(n−b n 2 c+1, 2)+b n 2 c ...

We give a nonstandard variant of Jordan’s proof of the Jordan curve theorem which is free of the defects his contemporaries criticized and avoids the epsilontic burden of the classical proof. The proof is selfcontained, except for the Jordan theorem for polygons taken for granted.

A homomorphism of an automaton A without outputs onto a subau-tomaton B of A is called a retract homomorphism if it leaves the elements of B fixed. An automaton A is called a retractable automaton if, for every subautomaton B of A, there is a retract homomorphism of A onto B. In [1] and [3], special retractable automata are examined. The purpose of this paper is to give a construction for state...

We consider a real analytic map-germ (f, g) : (R, 0) → (R, 0). Under some conditions, we establish degree formulas for the following quantities : χ({f = α} ∩ {g = δ} ∩B ε ), χ({f = α} ∩ {g ≥ δ} ∩B ε )− χ({f = α} ∩ {g ≤ δ} ∩B ε ), where (α, δ) is a regular value of (f, g) and 0 < |(α, δ)| ¿ ε ¿ 1.

A connected graph G is optimal-κ if the connectivity κ(G) = δ(G), where δ(G) is the minimum degree of G. It is super-κ if every minimum vertex cut isolates a vertex. An optimal-κ graph G is moptimal-κ if for any vertex set S ⊆ V (G) with |S| ≤ m, G−S is still optimal-κ. The maximum integer of such m, denoted by Oκ(G), is the vertex fault tolerance of G with respect to the property of optimal-κ....

Claims A.1 to A.15 establish results needed to show that the strategy given in (28) is welldefined and subgame perfect. The first two claims establish some properties of the paths π̂, . . . , π̂. Claim A.1 For all i ∈ {0, . . . , n} and d, d′ ∈ N with d = d′: −B(1− δ) + δ(n+5)(T+1)Vd(π̂(d)) > B(1− δ) + δVd(π̂), (A.1) −B(1− δ) + δVd(π̂) > (1− δ)B + δVd(π̂), (A.2) −(1− δ)B + δVd(π̂) > (1− δ)B + δVd(π̂). ...