Related papers: Nets in $\mathbb P^2$ and Alexander Duality
Petri networks and network models are two frameworks for the compositional design of systems of interacting entities. Here we show how to combine them using the concept of a "catalyst": an entity that is neither destroyed nor created by any…
In this article, a new and natural topology on the prime spectrum is established which behaves completely as the dual of the Zariski topology. It is called the flat topology. The basic and also some sophisticated properties of the flat…
The structure of a river network may be seen as a discrete set of nested sub-networks built out of individual stream segments. These network components are assigned an integral stream order via a hierarchical and discrete ordering method.…
We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we…
Step net bisimulation is a coinductive behavioral relation for finite Petri nets, which is a smooth generalization of the definition of standard step bisimulation \cite{NT84} on finite Petri nets. Its induced equivalence offers an…
We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay. For instance, we provide a…
We propose an automated procedure to prove polyhedral abstractions (also known as polyhedral reductions) for Petri nets. Polyhedral abstraction is a new type of state space equivalence, between Petri nets, based on the use of linear integer…
Establishing correspondences between two images requires both local and global spatial context. Given putative correspondences of feature points in two views, in this paper, we propose Order-Aware Network, which infers the probabilities of…
Our work is motivated by and illustrated with application of association networks in computational biology, specifically in the context of gene/protein regulatory networks. Association networks represent systems of interacting elements,…
We explore the codimension one strata in the degree-one cohomology jumping loci of a finitely generated group, through the prism of the multivariable Alexander polynomial. As an application, we give new criteria that must be satisfied by…
The purpose of this article is to study the relationship between numerical invariants of certain subspace arrangements coming from reflection groups and numerical invariants arising in the representation theory of Cherednik algebras. For…
A quandle is an algebra whose axioms are motivated from knot theory. A linear extension of a quandle can be described by using a pair of maps called an Alexander pair. In this paper, we show that a linear extension of a multiple conjugation…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
As data structures and mathematical objects used for complex systems modeling, hypergraphs sit nicely poised between on the one hand the world of network models, and on the other that of higher-order mathematical abstractions from algebra,…
Let X be a simplicial complex with the ground set V. Define its Alexander dual as a simplicial complex X* = {A \subset V: V \setminus A \notin X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is…
We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…
Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…
Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road…
Fox's conjecture from 1962, that the absolute values of the coefficients of the Alexander polynomial of an alternating link are trapezoidal, has remained stubbornly open to this date. Recently Fox's conjecture was settled for all special…
Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks…