Pages that link to "Item:Q5158511"
From MaRDI portal
The following pages link to An algorithm determining the set of lengths of polynomial cycles in $Z_K^N$ (Q5158511):
Displaying 3 items.
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831) (← links)
- Cycles of polynomial mappings in several variables over discrete valuation rings and over \(\mathbb Z\) (Q2346062) (← links)
- On explicit relations between cyclotomic numbers (Q4488459) (← links)
