pith. sign in

arxiv: 1208.4702 · v1 · pith:5TPTNSQLnew · submitted 2012-08-23 · 🧮 math.PR · math.CO

Characterization of system signatures

classification 🧮 math.PR math.CO
keywords systemcharacterizationsignatureaffirmativeapproachcasecombinatorialdetermine
0
0 comments X
read the original abstract

We suggest a purely combinatorial approach to a general problem in system reliability. We show how to determine if a given vector can be the signature of a system, and in the affirmative case exhibit such a system in terms on its structure function. The method employs results from the theory of simplicial sets, and provides a full characterization of signature vectors.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.