Pairwise intersecting homothets of a convex body (Q5915835): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(5 intermediate revisions by 3 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6827282
scientific article; zbMATH DE number 6722211
Property / DOI
 
Property / DOI: 10.1016/j.endm.2017.07.065 / rank
Normal rank
 
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1376.52016 / rank
 
Normal rank
Property / published in
 
Property / published in: Discrete Mathematics / rank
 
Normal rank
Property / publication date
 
22 May 2017
Timestamp+2017-05-22T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 22 May 2017 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52A40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6722211 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(0\)-symmetric convex body
Property / zbMATH Keywords: \(0\)-symmetric convex body / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-distance set
Property / zbMATH Keywords: \(k\)-distance set / rank
 
Normal rank
Property / zbMATH Keywords
 
cardinality
Property / zbMATH Keywords: cardinality / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2535663293 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.04400 / rank
 
Normal rank
Property / review text
 
A \textit{Minkowski arrangement} of a \(0\)-symmetric convex body \(K\) is a family \(\{v_i+\lambda_i K\}\) of homothets of \(K\), with \(\lambda_i>0\) and \(v_i\in{\mathbb R}\), such that none of them contains in its interior the center of any other set of the family. In the paper under review the author proves that the largest number of homothetic copies that a pairwise intersecting Minkowski arrangement of \(K\) can have is bounded from above by \(3^{d+1}\). The paper is also devoted to study the so-called \(k\)-distance sets in Minkowski spaces: a subset \(S\) of a metric space is a \textit{\(k\)-distance set}, \(k>1\), if the collection of non-zero distances occurring between points of \(S\) has size at most \(k\). The author shows that the cardinality of a \(k\)-distance set in a \(d\)-dimensional Minkowski space is at most \(k^{O(3^dd)}\), the constant in \(O(\cdot)\) being independent of \(d\) and \(k\).
Property / review text: A \textit{Minkowski arrangement} of a \(0\)-symmetric convex body \(K\) is a family \(\{v_i+\lambda_i K\}\) of homothets of \(K\), with \(\lambda_i>0\) and \(v_i\in{\mathbb R}\), such that none of them contains in its interior the center of any other set of the family. In the paper under review the author proves that the largest number of homothetic copies that a pairwise intersecting Minkowski arrangement of \(K\) can have is bounded from above by \(3^{d+1}\). The paper is also devoted to study the so-called \(k\)-distance sets in Minkowski spaces: a subset \(S\) of a metric space is a \textit{\(k\)-distance set}, \(k>1\), if the collection of non-zero distances occurring between points of \(S\) has size at most \(k\). The author shows that the cardinality of a \(k\)-distance set in a \(d\)-dimensional Minkowski space is at most \(k^{O(3^dd)}\), the constant in \(O(\cdot)\) being independent of \(d\) and \(k\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: María A. Hernández Cifre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Best Constant for the Besicovitch Covering Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bezdek–Pach Conjecture for Centrally Symmetric Convex Bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Károly Bezdek and János Pach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilateral Sets in Minkowski Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinalities of \(k\)-distance sets in Minkowski spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowskian Distribution of Discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise intersecting homothets of a convex body / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2017.07.065 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2017.04.002 / rank
 
Normal rank

Latest revision as of 05:44, 28 December 2024

scientific article; zbMATH DE number 6722211
Language Label Description Also known as
English
Pairwise intersecting homothets of a convex body
scientific article; zbMATH DE number 6722211

    Statements

    Pairwise intersecting homothets of a convex body (English)
    0 references
    18 January 2018
    0 references
    22 May 2017
    0 references
    Minkowski arrangement
    0 references
    pairwise intersecting homothets
    0 references
    \(k\)-distance sets
    0 references
    centrally symmetric convex body
    0 references
    \(0\)-symmetric convex body
    0 references
    \(k\)-distance set
    0 references
    cardinality
    0 references
    A \textit{Minkowski arrangement} of a \(0\)-symmetric convex body \(K\) is a family \(\{v_i+\lambda_i K\}\) of homothets of \(K\), with \(\lambda_i>0\) and \(v_i\in{\mathbb R}\), such that none of them contains in its interior the center of any other set of the family. In the paper under review the author proves that the largest number of homothetic copies that a pairwise intersecting Minkowski arrangement of \(K\) can have is bounded from above by \(3^{d+1}\). The paper is also devoted to study the so-called \(k\)-distance sets in Minkowski spaces: a subset \(S\) of a metric space is a \textit{\(k\)-distance set}, \(k>1\), if the collection of non-zero distances occurring between points of \(S\) has size at most \(k\). The author shows that the cardinality of a \(k\)-distance set in a \(d\)-dimensional Minkowski space is at most \(k^{O(3^dd)}\), the constant in \(O(\cdot)\) being independent of \(d\) and \(k\).
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references