Related papers: Petri Nets and its Polynomials
We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…
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…
Complex 1-variable polynomials with connected Julia sets and only repelling periodic points are called \emph{dendritic}. By results of Kiwi, any dendritic polynomial is semi-conjugate to a topological polynomial whose topological Julia set…
Petri net synthesis consists in deciding for a given transition system $A$ whether there exists a Petri net $N$ whose reachability graph is isomorphic to $A$. Several works examined the synthesis of Petri net subclasses that restrict, for…
We study the connectedness structure of the proper Pareto solution sets, the Pareto solution sets, the weak Pareto solution sets of polynomial vector variational inequalities, as well as the connectedness structure of the efficient solution…
The purpose of this paper is to provide a new account of multiplicity for finite morphisms between smooth projective varieties. Traditionally, this has been defined using commutative algebra in terms of the length of integral ring…
The algebraic foundation of tropical polynomial algebra provides the framework for the geometric construction of the supplement and the reversal of tropical varieties, thereby inducing a duality of reduced tropical varieties; for classes of…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
We consider orthogonal polynomials on the unit circle associated with certain semi-classical weight functions. This means that the Pearson-type differential equations satisfied by these weight functions involve two polynomials of degree at…
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…
Every cohomology ring isomorphism between two non-singular complete toric varieties and quasitoric manifolds, respectively, with second Betti number $2$ is realizable by a diffeomorphism and homeomorphism, respectively.
The spectral decomposition for an explicit second-order differential operator $T$ is determined. The spectrum consists of a continuous part with multiplicity two, a continuous part with multiplicity one, and a finite discrete part with…
Supercyclides are surfaces with a characteristic conjugate parametrization consisting of two families of conics. Patches of supercyclides can be adapted to a Q-net (a discrete quadrilateral net with planar faces) such that neighboring…
A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…
We introduce multiple Wilson polynomials, which give a new example of multiple orthogonal polynomials (Hermite-Pade polynomials) of type II. These polynomials can be written as a Jacobi-Pineiro transform, which is a generalization of the…
Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets…
The coverability and boundedness problems for Petri nets are known to be Expspace-complete. Given a Petri net, we associate a graph with it. With the vertex cover number k of this graph and the maximum arc weight W as parameters, we show…
We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
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…