決定性オートマトンの隣接行列構造について――最小性の必要十分条件

This paper gives a decomposition of the characteristic polynomial of the adjacency matrix of the tree T (d, k, r) , obtained by attaching copies of B(d, k) to the vertices of

In this paper a similar problem is studied for semidynamical systems. We prove that a non-trivial, weakly minimal and negatively strongly invariant sets in a semidynamical system on

In Section 7, we classify the sets reduced decompositions which can correspond to paths between two flags in a semimodular lattice, and in Section 8, we use our results to derive

We also give some characterizations of 0-distributive semilattices and a characterization of minimal prime ideals containing an ideal of a 0-distributive

Our method of proof involves tracking the formation of the allelic partition using a certain Markov process, for which we prove a fluid limit.. Key words: Allelic

Since we need information about the D-th derivative of f it will be convenient for us that an asymptotic formula for an analytic function in the form of a sum of analytic

Giordano, Putnam and Skau introduced the notion of strong orbit equivalence for Cantor minimal systems in [GPS1], and showed that two systems are strong orbit equivalent if and only

Since congruence classes satisfy the condition in Theorem 4 and Algorithm 2 is just a special case of Algorithm 1, we know that Algorithm 2 terminates after a finite of steps and