Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.12218

Characterizing traces of processes defined by precedence and response constraints: an order theory approach

Mark Dukes·Anton Sohn
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we consider a general system of activities that can, but do not have to, occur. This system is governed by a set containing two types of constraints: precedence and response. A precedence constraint dictates that an activity can only occur if it has been preceded by some other specified activity. Response constraints are similarly defined. An execution of the system is a listing of activities in the order they occur and which satisfies all constraints. These listings are known as traces. Such systems naturally arise in areas of theoretical computer science and decision science. An outcome of the freedom with which activities can occur is that there are many different possible executions, and gaining a combinatorial insight into these is a non-trivial problem. We characterize all of the ways in which such a system can be executed. Our approach uses order theory to provide a classification in terms of the linear extensions of posets constructed from the constraint sets. This characterization is essential in calculating the stakeholder utility metrics that have been developed by the first author that allow for quantitative comparisons of such systems/processes. It also allows for a better understanding of the theoretical backbone to these processes.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark Dukes, Anton Sohn. 2025-02-20. Characterizing traces of processes defined by precedence and response constraints: an order theory approach. https://arxiv.org/abs/2311.12218

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗