Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

About Regularity of Collections of Sets

The paper continues investigations of stationarity and regularity properties of collections of sets in normed spaces. It contains a summary of different characterizations (both primal and dual) of regularity and a list of sufficient conditions for a collection of sets to be regular.     

H MAS NMR monitoring of the C-labeled carbon scrambling for propane in zeolite H-ZSM-5

It has been demonstrated that ¹H MAS NMR spectroscopy can be used as a tool for in situ monitoring the reaction kinetics of ¹³C-labeled carbon scrambling in alkane molecules adsorbed on zeolite catalysts at the reaction temperature of 540–570 K. The accuracy of the results and the time resolution are improved compared to ¹³C MAS NMR spectroscopy.     

Finite-gap Solutions of the Fuchsian Equations

We find a new class of Fuchsian equations, with algebro-geometric solutions associated to a hyperelliptic curve. A method for calculating its arithmetic genus and branching points is suggested. Numerous examples are given.