Related papers: A Note on Generating Sets for Semiflows
We study the semiring $\mathbb{N}_0[\alpha]$ as an additive monoid where $\alpha$ is a positive real algebraic number. In the atomic case, the atoms of $\mathbb{N}_0[\alpha]$ are precisely the powers $\alpha^n$ up to a certain nonnegative…
Petri nets are an established graphical formalism for modeling and analyzing the behavior of systems. An important consideration of the value of Petri nets is their use in describing both the syntax and semantics of modeling formalisms.…
We specify the structure of completely positive operators and quantum Markov semigroup generators that are symmetric with respect to a family of inner products, also providing new information on the order strucure an extreme points in some…
If G is a semidirect product N by H with N normal and finitely generated then G has the property that every finite group is a quotient of some finite index subgroup of G if and only if one of N and H has this property. This has applications…
This paper gives a systematic construction of certain covers of finite semigroups. These covers will be used in future work on the complexity of finite semigroups.
We construct canonical $\mathbb{Q}$-factorial Gorenstein affine fourfolds in every positive characteristic that are not quasi-$F$-split.
Let $G=\left\langle S|R_{A}\right\rangle $ be a semigroup with generating set $ S$ and equivalences $R_{A}$ among $S$ determined by a matrix $A$. This paper investigates the complexity of $G$-shift spaces by yielding the topological…
The goal of this paper is to provide some basic structure information on derivations in finite semirings.
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
In finite dimensions, we provide characterizations of the quantum dynamical semigroups that do not decrease the von Neumann, the Tsallis and the Renyi entropies, as well as a family of functions of density operators strictly related to the…
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed over time by choosing a sequence of capacity labelings from…
We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…
In this paper, we introduce the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. We introduce the concept of Arf-irreducible numerical…
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
Impulsive semiflows modeled by continuous flows and continuous impulsive functions, defined over an impulsive region, are piecewise continuous semiflows with piecewise smooth trajectories. In this paper we contribute to the topological…
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent,…
A definable set $X$ in the first-order language of rings defines a family of random vectors: for each finite field $\mathbb{F}_q$, let the distribution be supported and uniform on the $\mathbb{F}_q$-rational points of $X$. We employ results…
As well-known, in a finitary algebraic structure the set $\Gamma$ of all the non-generators is the intersection of all the maximal proper substructures. In particular, $\Gamma$ is a substructure. We show that the corresponding statements…