2020
DOI: 10.1007/s00012-020-00683-5
|View full text |Cite
|
Sign up to set email alerts
|

Closed sets of finitary functions between finite fields of coprime order

Abstract: We investigate the finitary functions from a finite field $$\mathbb {F}_q$$ F q to the finite field $$\mathbb {F}_p$$ F p , where p and q are powers of different primes. An $$(\mathbb {F}_p,\mathbb {F}_q)$$ ( F p , F q ) -linearly closed clonoid is a subset of these functions which is closed under composition from the right and from the left with linear mappings. We give a characterization of these subsets of functions through the invariant subspaces of the vector space $$\mathbb {F}_p^{\mathbb {F}_… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Then the set of functions that are polymorphisms of all pairs of all the relations in R is denoted by Pol(R). As in [7,Lemma 5.5] we can use polymorphisms to prove the following. Lemma 4.5.…”
Section: The Lattice Of All (F K)-linearly Closed Clonoidsmentioning
confidence: 99%
See 1 more Smart Citation
“…Then the set of functions that are polymorphisms of all pairs of all the relations in R is denoted by Pol(R). As in [7,Lemma 5.5] we can use polymorphisms to prove the following. Lemma 4.5.…”
Section: The Lattice Of All (F K)-linearly Closed Clonoidsmentioning
confidence: 99%
“…In the [7] there is a complete description of the structure of all (F, K)-linearly closed clonoids in case F and K are fields and the results we will present are a generalization of this description.…”
Section: Introductionmentioning
confidence: 99%
“…In [6] there is a complete description of the structure of all (F, K)-linearly closed clonoids in case F and K are fields and the results we will present are a generalization of this description.…”
Section: Introductionmentioning
confidence: 99%