Upconversion in Detail: Multicolor Emission of Yb/Er/Tm-Doped Nanoparticles under 800, 975, 1208, and 1532 nm Excitation Wavelengths

Spectroscopic properties of YPO₄ nanoparticles doped with Yb³⁺, Tm³⁺, and Er³⁺ ions have been studied in detail. These multiemitting materials are promising not only for photonic or electronic use but especially for anticounterfeiting applications. The nanopowders are synthesized by the facile coprecipitation method with annealing in the air atmosphere at 1000 °C. The structural and morphological studies reveal pure tetragonal nanocrystallites with an average size of 20–30 nm. Most interestingly, under NIR excitation, the samples exhibit intense upconversion (UC) luminescence where the color can be tuned by changing the laser source, switching the excitation wavelengths between 800, 975, 1208, and 1532 nm, double-wavelength excitation, and by changing laser power density. As a result, a very high color shift, being the result of intensity changes in the emission bands of Er³⁺ (green and red) and Tm³⁺ (blue and red) is obtained. The luminescence lifetimes, temporal evolution, and the pump power dependences are also measured to propose the mechanisms responsible for the observed UC emission.     

Self-intersection local time for Gaussian ′( )-processes: Existence, path continuity and examples

In this paper we develop a criterion for existence or non-existence of self-intersection local time (SILT) for a wide class of Gaussian ′( ^d)-valued processes, we show that quite generally the SILT process has continuous paths, and we give several examples which illustrate existence of SILT for different ranges of dimensions (e.g., d ≤ 3, d ≤ 7 and 5 ≤ d ≤ 11 in the Brownian case). Some of the examples involve branching and exhibit “dimension gaps”. Our results generalize the work of Adler and coauthors, who studied the special case of “density processes” and proved that SILT paths are cadlag in the Brownian case making use of a “particle picture” approximation (this technique is not available for our general formulation).     

The bicategories of corings

To a B-coring and a (B,A)-bimodule that is finitely generated and projective as a right A-module an A-coring is associated. This new coring is termed a base ring extension of a coring by a module. We study how the properties of a bimodule such as separability and the Frobenius properties are reflected in the induced base ring extension coring. Any bimodule that is finitely generated and projective on one side, together with a map of corings over the same base ring, lead to the notion of a module-morphism, which extends the notion of a morphism of corings (over different base rings). A module-morphism of corings induces functors between the categories of comodules. These functors are termed pull-back and push-out functors, respectively, and thus relate categories of comodules of different corings. We study when the pull-back functor is fully faithful and when it is an equivalence. A generalised descent associated to a morphism of corings is introduced. We define a category of module-morphisms, and show that push-out functors are naturally isomorphic to each other if and only if the corresponding module-morphisms are mutually isomorphic. All these topics are studied within a unifying language of bicategories and the extensive use is made of interpretation of corings as comonads in the bicategory Bim of bimodules and module-morphisms as 1-cells in the associated bicategories of comonads in Bim.     

On-Line Dimension for Posets Excluding Two Long Incomparable Chains

For a positive integer k, let k?+?k denote the poset consisting of two disjoint k-element chains, with all points of one chain incomparable with all points of the other. Bosek, Krawczyk and Szczypka showed that for each k?≥?1, there exists a constant c _k so that First Fit will use at most $c_kw^2$ chains in partitioning a poset P of width at most w, provided the poset excludes k?+?k as a subposet. This result played a key role in the recent proof by Bosek and Krawczyk that O(w ^16logw ) chains are sufficient to partition on-line a poset of width w into chains. This result was the first improvement in Kierstead’s exponential bound: (5 ^w ???1)/4 in nearly 30 years. Subsequently, Joret and Milans improved the Bosek–Krawczyk–Szczypka bound for the performance of First Fit to 8(k???1)² w, which in turn yields the modest improvement to O(w ^14logw ) for the general on-line chain partitioning result. In this paper, we show that this class of posets admits a notion of on-line dimension. Specifically, we show that when k and w are positive integers, there exists an integer t?=?t(k,w) and an on-line algorithm that will construct an on-line realizer of size t for any poset P having width at most w, provided that the poset excludes k?+?k as a subposet.     

On Harnack inequality for <Emphasis Type="Italic">α</Emphasis>-stable Ornstein–Uhlenbeck processes

We consider the α-stable Ornstein–Uhlenbeck process in with the generator . We show that if 2 > α ≥ 1 or α < 1 = d the Harnack inequality holds. For α < 1 < d we construct a counterexample that shows that the Harnack inequality does not hold. Partially supported by KBN and MEN.     

Conservation of energy for the Euler–Korteweg equations

In this article we study the principle of energy conservation for the Euler–Korteweg system. We formulate an Onsager-type sufficient regularity condition for weak solutions of the Euler–Korteweg system to conserve the total energy. The result applies to the system of Quantum Hydrodynamics.     

On interval predictor-corrector methods

One can approximate numerically the solution of the initial value problem using single or multistep methods. Linear multistep methods are used very often, especially combinations of explicit and implicit methods. In floating-point arithmetic from an explicit method (a predictor), we can get the first approximation to the solution obtained from an implicit method (a corrector). We can do the same with interval multistep methods. Realizing such interval methods in floating-point interval arithmetic, we compute solutions in the form of intervals which contain all possible errors. In this paper, we propose interval predictor-corrector methods based on conventional Adams-Bashforth-Moulton and Nyström-Milne-Simpson methods. In numerical examples, these methods are compared with interval methods of Runge-Kutta type and methods based on high-order Taylor series. It appears that the presented methods yield comparable approximations to the solutions.     

Approximate homomorphisms on lattices

We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain systems of lattice neighborhoods. As a corollary, we obtain a stability result for approximately monotone functions.     

Special subsets of the reals and tree forcing notions

We study relationships between classes of special subsets of the reals (e.g. meager-additive sets, -sets, -sets, -sets) and the ideals related to the forcing notions of Laver, Mathias, Miller and Silver.