No label defined (Q4800845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1892907
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1892907 |
Statements
6 April 2003
0 references
polynomial functional system
0 references
basis of functional system
0 references
algorithms
0 references
0.8386416435241699
0 references
0.785766065120697
0 references
0.7736498713493347
0 references
Let \(F_X\) denote the set of polynomial functions over \(X\), here \(X\) can be the set of natural numbers, the set of integers, or the set of rational numbers together with the set of operations \(\Omega=\{\eta, \tau, \bigtriangleup, \bigtriangledown, *\}\) which are defined as follows: \[ (\eta f)(x_1,\dots,x_n)=f(x_2,x_3,\dots,x_n,x_1) , \] \[ (\tau f)(x_1,\dots,x_n)=f(x_2,x_1,x_3,\dots,x_n) , \] \[ (\bigtriangleup f)(x_1,\dots,x_{n-1})=f(x_1,x_1,\dots,x_{n-1}) , \] in the case \(n>1\), and in the case \(n=1\), let \((\eta f)=(\tau f)=(\bigtriangleup f)=f \), \[ (\bigtriangledown f)(x_1,\dots,x_n,x_{n+1})=f(x_2,x_3,\dots,x_n,x_{n+1}) , \] \[ (f*g)(x_2,\dots, x_n, x_{n+1},\dots, x_{n+m})=f(g(x_{n+1},\dots, x_{n+m}), x_2,\dots, x_n). \] Therefore, \((F_X,\Omega)\) is an algebra which is usually called the polynomial functional system. In the usual way we associate with the functional system \((F_X,\Omega)\) the closure operator \(I_{\Omega}\) which provides each subset \(M\subseteq F_X\) with the corresponding subset \(I_{\Omega}(M) \subseteq F_X\) consisting of all functions that can be obtained from \(M\) by a finite number of operations from \(\Omega\). \(M\) is called closed if \(I_{\Omega}(M)=M\) and \(M\) is called complete if \(I_{\Omega}(M)=F_X\). Among the basic results of the paper, it is proved that for any natural number \(n\) there is a complete functional system in \(F_{\mathbb{Z}}\) which has a basis of cardinality \(n\). There are complete systems without a basis in \(F_{\mathbb{Q}}\). Also, in \(F_{\mathbb{N}}\) there exists an algorithm which can find a basis for any finite complete system. For \(F_{\mathbb{Z}}\) it is shown that there is no such algorithm.
0 references