Search

The authors give a complete classification of projective threefolds admitting a holomorphic conformal structure. A corollary is the complete list of projective threefolds, whose tangent bundle is a symmetric square. [ABSTRACT FROM AUTHOR]

We prove the existence of infinitely many geometrically distinct two bump solutions of periodic superlinear Schrödinger equations of the type -Δu + V(x)u = f(x,u), where x ∈ ℝN and lim|x| → ∞u(x) = 0. The solutions we construct change sign and have exactly two nodal domains. The usual multibump constructions for these equations rely on strong non-degeneracy assumptions. We present a new approach that only requires a weak splitting condition. In the second part of the paper we exhibit classes of potentials V for which this splitting condition holds. [ABSTRACT FROM AUTHOR]

We apply the Murasugi–Tristram inequality to real algebraic curves of odd degree in RP2 with a deep nest, i.e. a nest of the depth k - 1 where 2k + 1 is the degree. For such curves, the ingredients of the Murasugi–Tristram inequality can be computed (or estimated) inductively using the computations for iterated torus links due to Eisenbud and Neumann as the base case of the induction and Conway's skein relation as the induction step. As an example of applications, we prove that some isotopy types are not realizable by M-curves of degree 9. In Appendix B, we give some generalization of the skein relation for Conway polynomial. [ABSTRACT FROM AUTHOR]

Let X be an n-dimensional non-degenerated subvariety of PN with N ≥ 2n + 1. We give a rough classification for varieties X having Gn-1;n-defect. In case n = 3, we give a fine classification for smooth varieties X having G2,3-defect. [ABSTRACT FROM AUTHOR]

A concept of higher order complexity is proposed in this letter. If a randomness-finding complexity [Rapp & Schmah, 2000] is taken as the complexity measure, the first-order complexity is suggested to be a measure of randomness of the original time series, while the second-order complexity is a measure of its degree of nonstationarity. A different order is associated with each different aspect of complexity. Using logistic mapping repeatedly, some quasi-stationary time series were constructed, the nonstationarity degree of which could be expected theoretically. The estimation of the second-order complexity of these time series shows that the second-order complexities do reflect the degree of nonstationarity and thus can be considered as its indicator. It is also shown that the second-order complexities of the EEG signals from subjects doing mental arithmetic are significantly higher than those from subjects in deep sleep or resting with eyes closed. [ABSTRACT FROM AUTHOR]