Sets uniquely determined by projections on axes. II: Discrete case (Q1182577): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4403145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets Uniquely Determined by Projections on Axes I. Continuous Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maßtheoretische Marginalprobleme / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Counting Vector of a Simple Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem of Plane Measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decisions by players of comparable strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for regular set-covering and threshold synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chow Parameters in Threshold Logic / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(91)90106-c / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171634516 / rank
 
Normal rank

Latest revision as of 10:27, 30 July 2024

scientific article
Language Label Description Also known as
English
Sets uniquely determined by projections on axes. II: Discrete case
scientific article

    Statements

    Sets uniquely determined by projections on axes. II: Discrete case (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    In part I [SIAM J. Appl. Math. 50, No. 1, 288-306 (1990; Zbl 0695.44003)] the authors studied the continuous case. In this paper they characterize the discrete sets of uniqueness and additive sets. They show that every additive set is a set of uniqueness always and its converse is true in 2- dimensions. Some open combinatorial problems on this topic were mentioned at the end of the paper.
    0 references
    projections on axes
    0 references
    additive \(k\)-bad configuration
    0 references
    weakly \(k\)-bad configuration
    0 references
    linear programming
    0 references
    Radon transform
    0 references
    hyperplane integral projections
    0 references
    uniquely reconstructable sets
    0 references
    discrete sets of uniqueness
    0 references
    additive sets
    0 references

    Identifiers