Related papers: Petri Nets and its Polynomials
We discuss computing with hierarchies of families of (potentially weighted) semiclassical Jacobi polynomials which arise in the construction of multivariate orthogonal polynomials. In particular, we outline how to build connection and…
Given the toric (or toral) arrangement defined by a root system $\Phi$, we describe the poset of its layers (connected components of intersections) and we count its elements. Indeed we show how to reduce to zero-dimensional layers, and in…
The categorical modeling of Petri nets has received much attention recently. The Dialectica construction has also had its fair share of attention. We revisit the use of the Dialectica construction as a categorical model for Petri nets…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
We study the connection between stringy Betti numbers of Gorenstein toric varieties and the generating functions of the Ehrhart polynomials of certain polyhedral regions. We use this point of view to give counterexamples to Hibi's…
We extend the methods developed in our earlier work to algorithmically compute the intersection cohomology Betti numbers of reductive varieties. These form a class of highly symmetric varieties that includes equivariant compactifications of…
Reversible computation is an unconventional form of computing that extends the standard forward-only mode of computation with the ability to execute a sequence of operations in reverse at any point during computation. As such, in this…
Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…
A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…
Boolean Petri nets equipped with nop allow places and transitions to be independent by being related by nop. We characterize for any fixed natural number g the computational complexity of synthesizing nop-equipped Boolean Petri nets from…
We provide a categorical semantics for bounded Petri nets, both in the collective- and individual-token philosophy. In both cases, we describe the process of bounding a net internally, by just constructing new categories of executions of a…
We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the…
Let P^n denote the n-dimensional projective space defined over the algebraic closure of a finite field F_q, let V contained P^n be a complete intersection defined over F_q of dimension r and singular locus of dimension at most s, and let…
This paper initiates the dialectical approach to net theory. This approach views nets as special, but very important and natural, dialectical systems. By following this approach, a suitably generalized version of nets, called dialectical…
We present and expand some existing results on the Zariski closure of cyclic groups and semigroups of matrices. We show that, with the exclusion of isolated points, their irreducible components are toric varieties. Additionally, we…
Petri nets are a popular formalism for modeling and analyzing distributed systems. Tokens in Petri net models can represent the control flow state or resources produced/consumed by transition firings. We define a resource as a part (a…
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-S\"oderberg theory. That is, given a Betti diagram, we determine if it is possible to decompose it into the Betti diagrams of complete…
We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be…
Recent work by the authors equips Petri occurrence nets (PN) with probability distributions which fully replace nondeterminism. To avoid the so-called confusion problem, the construction imposes additional causal dependencies which restrict…
We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…