We show that every quasi-ordinary Weierstrass polynomial P (Z) = Z + a1(X)Z d−1 + · · ·+ ad(X) ∈ K[[X]][Z], X = (X1, . . . , Xn), over an algebraically closed field of characterisic zero K, such that a1 = 0, is ν-quasi-ordinary. That means that if the discriminant ∆P ∈ K[[X]] is equal to a monomial times a unit then the ideal (a i (X))i=2,...,d is monomial and generated by one of a i (X). We us...

An analytic cognitive style denotes a propensity to set aside highly salient intuitions when engaging in problem solving. We assess the hypothesis that an analytic cognitive style is associated with a history of questioning, altering, and rejecting (i.e., unbelieving) supernatural claims, both religious and paranormal. In two studies, we examined associations of God beliefs, religious engagemen...

Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of graphs. Let k ≥ 2 be a fixed integer, α1, . . . , αk be positive reals satisfying ∑ i αi = 1 and (α1, . . . , αk) 6= (1/k, . . . , 1/k), and G be a graph on n ver...

For each k = 0, 1, 2, . . . we define an equivalence relation called k-quasi-isotopy on the set of classical links in R3 up to isotopy in the sense of Milnor (1957), such that all sufficiently close approximations of a topological link are k-quasi-isotopic. Whereas 0-quasi-isotopy coincides with link homotopy, 1-quasi-isotopy is not implied by concordance, with aid of the generalized (lk 6= 0) ...

The subject of reincarnation* has been dealt with in various ways since the beginning of civilization. Claims to remember a previous life, like those of other alleged paranormal events, have occurred all through the ages and in nearly every part of the world. Memories attributed to previous lives have occurred and been investigated under a variety of conditions, including the normal waking stat...

In this paper, we prove the following assertions: (i) If T is of quasiclass (A, k), then T is polaroid and reguloid; (ii) If T or T ∗ is an algebraically of quasi-class (A, k) operator, then Weyls theorem holds for f(T ) for every f ∈ Hol(σ(T )); (iii) If T ∗ is an algebraically of quasi-class (A, k) operator, then a-Weyls theorem holds for f(T ) for every f ∈ Hol(σ(T )); (iv) If T ∗ is algebra...

Let D = (V (D), A(D)) be a digraph and k ≥ 2 an integer. We say that D is k-quasi-transitive if for every directed path (v0, v1, . . . , vk) in D, then (v0, vk) ∈ A(D) or (vk, v0) ∈ A(D). Clearly, a 2-quasi-transitive digraph is a quasi-transitive digraph in the usual sense. Bang-Jensen and Gutin proved that a quasi-transitive digraph D has a 3king if and only if D has a unique initial strong c...