Fixing and hindering systems in combinatorial geometry (Q1567471): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 04:56, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fixing and hindering systems in combinatorial geometry |
scientific article |
Statements
Fixing and hindering systems in combinatorial geometry (English)
0 references
18 June 2000
0 references
Let \(F\) be a set in the boundary of a convex body \(M\subset \mathbb{R}^n\). The set \(F\) is a fixing system (a hindering system) for \(M\) if for every (oriented) direction here is a nontrivial translation \(t\) in this direction such that \(tF\cap \text{int} M\neq \emptyset\) (respectively, \(tF\cap M\neq \emptyset)\). The paper is concerned with various estimates for the minimal cardinality of fixing systems (hindering systems) and the maximal cardinality of primitive fixing systems (primitive hindering systems). Several of the new results are for \(d\)-convex bodies in a Minkowski space \((\mathbb{R}^n\) with a norm).
0 references
\(d\)-convex bodies
0 references
fixing system
0 references
hindering system
0 references