Displaying 41 – 60 of 82

Showing per page

Minimality in asymmetry classes

Michał Wiernowolski (1997)

Studia Mathematica

We examine minimality in asymmetry classes of convex compact sets with respect to inclusion. We prove that each class has a minimal element. Moreover, we show there is a connection between asymmetry classes and the Rådström-Hörmander lattice. This is used to present an alternative solution to the problem of minimality posed by G. Ewald and G. C. Shephard in [4].

Minimality of toric arrangements

Giacomo d'Antonio, Emanuele Delucchi (2015)

Journal of the European Mathematical Society

We prove that the complement of a toric arrangement has the homotopy type of a minimal CW-complex. As a corollary we deduce that the integer cohomology of these spaces is torsionfree. We apply discrete Morse theory to the toric Salvetti complex, providing a sequence of cellular collapses that leads to a minimal complex.

Minkowski sums of Cantor-type sets

Kazimierz Nikodem, Zsolt Páles (2010)

Colloquium Mathematicae

The classical Steinhaus theorem on the Minkowski sum of the Cantor set is generalized to a large class of fractals determined by Hutchinson-type operators. Numerous examples illustrating the results obtained and an application to t-convex functions are presented.

Minkowski valuations intertwining the special linear group

Christoph Haberl (2012)

Journal of the European Mathematical Society

All continuous Minkowski valuations which are compatible with the special linear group are completely classified. One consequence of these classifications is a new characterization of the projection body operator.

Minkowskian rhombi and squares inscribed in convex Jordan curves

Horst Martini, Senlin Wu (2010)

Colloquium Mathematicae

We show that any convex Jordan curve in a normed plane admits an inscribed Minkowskian square. In addition we prove that no two different Minkowskian rhombi with the same direction of one diagonal can be inscribed in the same strictly convex Jordan curve.

Mixture decompositions of exponential families using a decomposition of their sample spaces

Guido F. Montúfar (2013)

Kybernetika

We study the problem of finding the smallest m such that every element of an exponential family can be written as a mixture of m elements of another exponential family. We propose an approach based on coverings and packings of the face lattice of the corresponding convex support polytopes and results from coding theory. We show that m = q N - 1 is the smallest number for which any distribution of N q ...

Currently displaying 41 – 60 of 82