Decidability of Irreducible Tree Shifts of Finite Type
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Statistical Physics"
DOI: 10.1007/s10955-019-02407-z
Abstract: We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT), we… read more here.
Keywords: finite type; irreducible tree; shifts finite; decidability irreducible ... See more keywords
On the irreducibility of the hyperplane sections of Fermat varieties in ℙ3$\mathbb {P}^{3}$ in characteristic 2. II
Sign Up to like & getrecommendations! Published in 2017 at "Cryptography and Communications"
DOI: 10.1007/s12095-017-0213-1
Abstract: Let t be an integer ≥ 3 such that t ≡ 1 mod 4. The absolute irreducibility of the polynomial ϕt(x,y)=xt+yt+1+(x+y+1)t(x+y)(x+1)(y+1)$\phi _{t}(x, y) = \frac {x^{t} + y^{t} + 1 + (x + y +… read more here.
Keywords: irreducibility hyperplane; varieties mathbb; irreducibility; sections fermat ... See more keywords