in this paper we classify fuzzy subgroups of a rank-3 abelian group $g = mathbb{z}_{p^n} + mathbb{z}_p + mathbb{z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. we present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...

in this paper we classify fuzzy subgroups of the dihedral group $d_{pqrs}$  for distinct primes  $p$, $q$, $r$ and $s$. this follows similar work we have done on distinct fuzzy subgroups of some dihedral groups.we present formulae for the number of (i) distinct maximal chains of subgroups, (ii) distinct fuzzy subgroups and (iii) non-isomorphic classes of fuzzy subgroups under our chosen equival...

A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...

the rings considered in this article are commutative with identity $1neq 0$. by a proper ideal of a ring $r$,  we mean an ideal $i$ of $r$ such that $ineq r$.  we say that a proper ideal $i$ of a ring $r$ is a  maximal non-prime ideal if $i$ is not a prime ideal of $r$ but any proper ideal $a$ of $r$ with $ isubseteq a$ and $ineq a$ is a prime ideal. that is, among all the proper ideals of $r$,...

In [Wol67], Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that such maximal chain cannot be found computably, not even hyperarithmetically: No hyperarithmetic set can compute maximal chains in all computable wpos. However, we prove that almost every set, in the sense of categ...

This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the untilmodality is equipped with a bound that contains variables; e.g., ♦6x φ asserts that φ holds within x time steps, where x is a variable on natural numbers. The central problem studied in this paper is to determine the set of parameter valuations V≺p(φ) for which the p...