Displaying similar documents to “Notes on generalized Dedekind sums”

Strict maximum separability of two finite sets: an algorithmic approach

Dorota Cendrowska (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a recursive algorithm for the investigation of a strict,linear separation in the Euclidean space. In the case when sets are linearly separable, it allows us to determine the coefficients of the hyperplanes. An example of using this algorithm as well as its drawbacks are shown. Then the algorithm of determining an optimal separation (in the sense of maximizing the distance between the two sets) is presented.

S-expansions in dimension two

Bernhard Schratzberger (2004)

Journal de Théorie des Nombres de Bordeaux

Similarity:

The technique of singularization was developped by C. Kraaikamp during the nineties, in connection with his work on dynamical systems related to continued fraction algorithms and their diophantine approximation properties. We generalize this technique from one into two dimensions. We apply the method to the the two dimensional Brun’s algorithm. We discuss, how this technique, and related ones, can be used to transfer certain metrical and diophantine properties from one algorithm to the...