{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2279682","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2279682","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2279682","kernelVersion":"v1","immutable":true,"modified":"2026-01-25T10:39:18Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2279682","name":"A simple upper bound on the number of antichains in \\([t]^n\\)","headline":"A simple upper bound on the number of antichains in \\([t]^n\\)","description":"scientific article; zbMATH DE number 7143300","url":"https://portal.mardi4nfdi.de/entity/Q2279682","datePublished":"2019-12-13","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2141368"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q172073"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/S11083-018-9480-5","url":"https://doi.org/10.1007/S11083-018-9480-5"},"sameAs":["https://doi.org/10.1007/S11083-018-9480-5"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1239323"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5585384"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2758972"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2557261"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4083667"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3671891"},{"@id":"https://portal.mardi4nfdi.de/entity/Q956379"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2251909"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4503366"}]},"provenance":{"prov:generatedAtTime":"2026-01-25T10:39:18Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}