We present a tight bound on the exact maximum complexity of Minkowski sums of convex
polyhedra in R3. In particular, we prove that the maximum number of facets of the Minkowski …

An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy",
"parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (…

The aim of this article is to provide a selected review of some of typical results regarding
inequality comparisons using the dominance approach in a multivariate context. Price …

The paper concerns estimation of the rose of directions of a stationary fibre process in $R^3$
from the intersection counts of the process with test planes. A new approach is suggested …

The paper proposes a new translation algorithm that translates a hybrid system described as
a discrete hybrid automaton (DHA) into an equivalent piecewise affine (PWA) system. The …

Theory and Applications of Models of Computation (TAMC) is an international conference
series with an interdisciplinary character, bringing together researchers working in computer …

Occasionally a mathematical fact is so significant that the results it leads to give insights which
range widely over a large area of mathematics and its applications. This is true of Euler's …

We present a tight bound on the exact maximum complexity of Minkowski sums of convex
polyhedra in R3. In particular, we prove that the maximum number of facets of the Minkowski …

The notions of minimality, π-uniqueness and additivity originated in discrete tomography.
They have applications to Kronecker products of characters of the symmetric group and arise …

The new functions added in this version include dd MatrixCanonicalize to find a nonredundant
proper H-or V-representation, dd FindRelativeInterior to find a relative interior point of an …