Davenport constant for semigroups II

Let $\mathcal{S}$ be a finite commutative semigroup. The Davenport constant of $\mathcal{S}$, denoted ${\rm D}(\mathcal{S})$, is defined to be the least positive integer $\ell$ such that every sequence $T$ of elements in $\mathcal{S}$ of length at least $\ell$ contains a proper subsequence $T'$ ($T'\neq T$) with the sum of all terms from $T'$ equaling the sum of all terms from $T$. Let $q>2$ be a prime power, and let \F_q[x] be the ring of polynomials over the finite field \F_q. Let $R$ be a quotient ring of \F_q[x] with 0\neq R\neq \F_q[x]. We prove that $${\rm D}(\mathcal{S}_R)={\rm D}(U(\mathcal{S}_R)),$$ where $\mathcal{S}_R$ denotes the multiplicative semigroup of the ring $R$, and $U(\mathcal{S}_R)$ denotes the group of units in $\mathcal{S}_R$.Comment: In press in Journal of Number Theory. arXiv admin note: text overlap with arXiv:1409.1313 by other author

A Fuzzy Petri Nets Model for Computing With Words

Motivated by Zadeh's paradigm of computing with words rather than numbers, several formal models of computing with words have recently been proposed. These models are based on automata and thus are not well-suited for concurrent computing. In this paper, we incorporate the well-known model of concurrent computing, Petri nets, together with fuzzy set theory and thereby establish a concurrency model of computing with words--fuzzy Petri nets for computing with words (FPNCWs). The new feature of such fuzzy Petri nets is that the labels of transitions are some special words modeled by fuzzy sets. By employing the methodology of fuzzy reasoning, we give a faithful extension of an FPNCW which makes it possible for computing with more words. The language expressiveness of the two formal models of computing with words, fuzzy automata for computing with words and FPNCWs, is compared as well. A few small examples are provided to illustrate the theoretical development.Comment: double columns 14 pages, 8 figure