Abstract
AbstractWe investigate the finitary functions from a finite product of finite fields $$\prod _{j =1}^m\mathbb {F}_{q_j} = {\mathbb K}$$
∏
j
=
1
m
F
q
j
=
K
to a finite product of finite fields $$\prod _{i =1}^n\mathbb {F}_{p_i} = {\mathbb {F}}$$
∏
i
=
1
n
F
p
i
=
F
, where $$|{\mathbb K}|$$
|
K
|
and $$|{\mathbb {F}}|$$
|
F
|
are coprime. An $$({\mathbb {F}},{\mathbb K})$$
(
F
,
K
)
-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 $${\mathbb {F}}_p[{\mathbb K}^{\times }]$$
F
p
[
K
×
]
-submodules of $$\mathbb {F}_p^{{\mathbb K}}$$
F
p
K
, where $${\mathbb K}^{\times }$$
K
×
is the multiplicative monoid of $${\mathbb K}= \prod _{i=1}^m {\mathbb {F}}_{q_i}$$
K
=
∏
i
=
1
m
F
q
i
. Furthermore we prove that each of these subsets of functions is generated by a set of unary functions and we provide an upper bound for the number of distinct $$({\mathbb {F}},{\mathbb K})$$
(
F
,
K
)
-linearly closed clonoids.
Funder
Johannes Kepler University Linz
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference15 articles.
1. Aichinger, E.: Solving systems of equations in supernilpotent algebras. In: 44th International Symposium on Mathematical Foundations of Computer Science, LIPIcs. Leibniz Int. Proc. Inform, 138, Art. No. 72, 9, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2019)
2. Aichinger, E., Mayr, P.: Finitely generated equational classes. J. Pure Appl. Algebra 220(8), 2816–2827 (2016)
3. Aichinger, E., Moosbauer, J.: Chevalley-Warning type results on abelian groups. J. Algebra 569, 30–66 (2021)
4. Brakensiek, J., Guruswami, V.: Promise constraint satisfaction structure theory and a symmetric Boolean dichotomy. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms ( SODA’18), pp. 1782–1801. SIAM, Philadelphia (2018)
5. Bulín, J., Krokhin, A., Opršal, J.: Algebraic approach to promise constraint satisfaction. In: Proceedings of the Annual ACM Symposium on Theory of Computing (STOC ’19), pp. 602–613. ACM, New York (2019)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Clonoids between modules;International Journal of Algebra and Computation;2024-05-25