Sets with a negative number of elements (Q1190227): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Ravi N. Kalia / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q56214722 / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Ravi N. Kalia / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0001-8708(92)90011-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996256231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspaces, subsets, and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the binomial coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Stirling numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal power series of logarithmic type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947818 / rank
 
Normal rank

Latest revision as of 10:58, 16 May 2024

scientific article
Language Label Description Also known as
English
Sets with a negative number of elements
scientific article

    Statements

    Sets with a negative number of elements (English)
    0 references
    0 references
    27 September 1992
    0 references
    The author shows how to extend the established combinatorial facts by using ``hybrid'' sets. A hybrid set is defined as follows: Given a universe \(U\), any function \(f: U\to Z\) is called a hybrid set. The value of \(f(x)\) is said to be the multiplicity of the element \(x\). If \(f(x)\neq 0\), we say \(x\) is a member of \(f\) and write \(x\in f\); otherwise, we write \(x\not\in f\). Define the number of elements \(\# f\) to be the sum \(\sum_{x\in U} f(x)\). \(f\) is said to be an \(\# f\) (element) hybrid set.
    0 references
    Roman coefficients
    0 references
    linear partitions
    0 references
    hybrid set
    0 references
    multiplicity
    0 references
    0 references

    Identifiers

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