相关论文: 1-Safe Petri nets and special cube complexes: equi…

The biased net paradigm was the first general and empirically tractable scheme for parameterizing complex patterns of dependence in networks, expressing deviations from uniform random graph structure in terms of latent ``bias events,''…

In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph $G=(V,E)$ and two "object types"…

We show how the theory of the critical behaviour of $d$-dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes. This in particular encompasses the case of a single polymer chain…

We propose and analyze a structure with which to organize the difference between a knot in the 3-sphere bounding a topologically embedded 2-disk in the 4-ball and it bounding a smoothly embedded disk. The n-solvable filtration of the…

Boolean Petri nets are differentiated by types of nets $\tau$ based on which of the interactions nop, inp, out, set, res, swap, used, and free they apply or spare. The synthesis problem relative to a specific type of nets $\tau$ is to find…

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

A rooted acyclic digraph N with labelled leaves displays a tree T when there exists a way to select a unique parent of each hybrid vertex resulting in the tree T. Let Tr(N) denote the set of all trees displayed by the network N. In general,…

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

Networks of disparate phenomena-- be it the global ecology, human social institutions, within the human brain, or in micro-scale protein interactions-- exhibit broadly consistent architectural features. To explain this, we propose a new…

We construct canonical absolute parallelisms over real-analytic manifolds equipped with $2$-nondegenerate, hypersurface-type CR structures of arbitrary odd dimension not less than $7$ whose Levi kernel has constant rank belonging to a broad…

Persistence is a strong, global, behavioural property of a Petri net, meaning that no activity can disable a different activity. Persistent permutability is a weaker property, pertaining to individual interleavings of a Petri net and…

We identify all $[1, \lambda, 8]$-cycle regular $I$-graphs and all $[1, \lambda, 8]$-cycle regular double generalized Petersen graphs. As a consequence we describe linear recognition algorithms for these graph families. Using structural…

We study what happens when coherence fails. Categories with a tensor product and a natural associativity isomorphism that does not necessarily satisfy the pentagon coherence requirements (called associative categories) are considered.…

The pro-\'etale fundamental group of a scheme, introduced by Bhatt and Scholze, generalizes formerly known fundamental groups -- the usual \'etale fundamental group $\pi_1^{\mathrm{et}}$ defined in SGA1 and the more general group defined in…

The in-plane lattice constants of close-packed planes of fcc and hcp Ni and Co match that of graphite almost perfectly so that they share a common two dimensional reciprocal space. Their electronic structures are such that they overlap in…

Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis problem has important applications in the design of digital hardware and commercial processes. Given a labeled transition system (TS) $A$,…

We propose a new method that takes advantage of structural reductions to accelerate the verification of reachability properties on Petri nets. Our approach relies on a state space abstraction, called polyhedral abstraction, which involves a…

We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…

Given a suitable Noetherian scheme, we classify tensor $t$-structures on the bounded derived category of coherent sheaves and its variants with prescribed support. Furthermore, we show that the existence of such $t$-structures restricting…

We prove a strong form of finite rigidity for pants graphs of spheres. Specifically, for any $n\geq4$, we construct a finite subgraph $X_n$ of the pants graph $P(S_{0,n})$ of the n-punctured sphere $S_{0,n}$ with the following property. Any…