Search arXivSearch

arXiv · 2502.17737

Domination and Multistate Systems

Abstract

Domination theory has been studied extensively in the context of binary monotone systems, where the structure function is a sum of products of the component state variables, and with coefficients given by the signed domination function. Using e.g., matroid theory, many useful properties of the signed domination function has been derived. In this paper we show how some of these results can be extended to multistate systems. In particular, we show how the signed domination function can be extended to such systems. Using Möbius inversion we show how the signed domination function can be expressed in terms of a multistate structure function. Moreover, using this expression we show how calculating the signed domination function of a multistate system can be reduced to calculating the signed domination function of an associated binary system. This way many results from binary theory can easily be extended to multistate theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arne Bang Huseby. 2025-02-25. Domination and Multistate Systems. https://arxiv.org/abs/2502.17737

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO