Related papers: 1-Safe Petri nets and special cube complexes: equi…

Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…

We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…

We prove a general form of the regularity theorem for uniformity norms, and deduce an inverse theorem for these norms which holds for a class of compact nilspaces including all compact abelian groups, and also nilmanifolds; in particular we…

Process discovery techniques return process models that are either formal (precisely describing the possible behaviors) or informal (merely a "picture" not allowing for any form of formal reasoning). Formal models are able to classify…

Recently, Amnon Neeman settled a bold conjecture by Antieau, Gepner, and Heller regarding the relationship between the regularity of finite-dimensional noetherian schemes and the existence of bounded $t$-structures on their derived…

A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…

Assigning a satisfactory truly concurrent semantics to Petri nets with confusion and distributed decisions is a long standing problem, especially if one wants to resolve decisions by drawing from some probability distribution. Here we…

Object-centric process mining investigates the intertwined behavior of multiple objects in business processes. From object-centric event logs, object-centric Petri nets (OCPN) can be discovered to replay the behavior of processes accessing…

In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…

In the binomial random graph $\mathcal{G}(n,p)$, when $p$ changes from $(1-\varepsilon)/n$ (subcritical case) to $1/n$ and then to $(1+\varepsilon)/n$ (supercritical case) for $\varepsilon>0$, with high probability the order of the largest…

Techniques to discover Petri nets from event data assume precisely one case identifier per event. These case identifiers are used to correlate events, and the resulting discovered Petri net aims to describe the life-cycle of individual…

A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. Beyond the well-known modularity…

This paper focuses on a fundamental problem on information security of bounded labeled Petri nets: non-interference analysis. As in hierarchical control, we assume that a system is observed by users at different levels, namely high-level…

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

In the classical survivable network design problem (SNDP), we are given an undirected graph $G=(V,E)$ with costs on edges and a connectivity requirement $k(s,t)$ for each pair of vertices. The goal is to find a minimum-cost subgraph…

We study a natural generalization of the classical $\epsilon$-net problem (Haussler--Welzl 1987), which we call the "$\epsilon$-$t$-net problem": Given a hypergraph on $n$ vertices and parameters $t$ and $\epsilon\geq \frac t n$, find a…

Semiclassical periodic-orbit theory and closed-orbit theory represent a quantum spectrum as a superposition of contributions from individual classical orbits. Close to a bifurcation, these contributions diverge and have to be replaced with…

Phylogenetic networks have gained prominence over the years due to their ability to represent complex non-treelike evolutionary events such as recombination or hybridization. Popular combinatorial objects used to construct them are triplet…

We prove a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs, and we obtain a general connectivity principle beyond planarity. Let $G$ be an infinite connected graph properly embedded in $\RR^2$ with…

We show that every ridge unfolding of an $n$-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the…