We show that the modified log-Sobolev constant for a natural Markov chain which converges to an $r$-homogeneous strongly log-concave distribution is at least $1/r$. Applications include sharp mixing time bound bases-exchange walk matroids, and concentration Lipschitz functions over these distributions.

We have derived element abundances in 310 emission-line galaxies from the Early Data Release of the Sloan Digital Sky Survey (SDSS) for which the [O iii] λ4363 emission line was detected, allowing abundance determination by direct methods. We found no extremely metal-deficient galaxy (Z ∼ Z⊙/12) ⋆, probably as a consequence of selection effects in the SDSS sample. The oxygen abundance 12 + log ...

Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclosing circle whose center is constrained to lie on L . The preprocessing time and space complexity are O(n log n) and O(n) respectively. We then show how to use this data structure in order to compute the smallest enclo...

In the dynamic text indexing problem, a text string has to be maintained under string insertions and deletions in order to answer on-line queries about arbitrary pattern occurrences. By means of some new techniques and data structures, we achieve improved worst-case bounds. We show that nding all pocc occurrences of a pattern of length p in the current text of length n takes O(p + pocc + upd lo...

In this paper, we study the relations between the log term of the Szegö kernel of the unit circle bundle of the dual line bundle of an ample line bundle over a compact Kähler manifold. We prove a local rigidity theorem. The result is related to the classical Ramadanov conjecture.

In this work we report on a transaction log analysis of the Dutch Folktale Database, an online repository of extensively annotated folktales ranging from old fairy tales to recent urban legends, written in (old) Dutch, Frisian and a variety of Dutch dialects. We observed that users have a preference for subgenres within folktales such as traditional legends and urban legends and prefer stories ...

We present a new algorithm based on Dual Graph Contraction (DGC) to transform the Run Graph into its Minimum Line Property Preserving (MLPP) form which, when implemented in parallel, requires O(log(longestcurve)) steps. A MLPP graph of a line image compliments the structural information in geometric graph representations like the run graph. Using such a graph and its dual, line image analysis s...