Commuting polynomial operations of distributive lattices (Q438810): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The aim of this paper is to describe which pairs of distributive lattice polynomial operations commute. The authors consider operations \(f:X^m\longrightarrow X\) and \(g:X^n\longrightarrow X\) on \(X\); and \([x_{ij}]\in X^{m\times n}\) be a matrix of elemens of \(X\). It is said that \(f\) commutes with \(g\) on \([x_{ij}]\) if \(f\circ g([x_{ij}])=g\circ f([x_{ij}]^T)\), and that \(f\) and \(g\) commute if they commute on all matrices \([x_{ij}]\in X^{m\times n}\). Suppose that \(M\) is an \(R\)-module and that \(f(x_1,\dots, x_m)=\sum_{i=1}^m a_ix_i+c\) and \(g(x_1,\dots, x_n)=\sum_{j=1}^n b_jx_j+d\) are module polynomial operations. Using the notation \([k]\) for the set \(\{1, 2, \dots, k\}\) for all natural numbers \(k\), the main result of the paper can be stated as follows: if \(f(x_1, \dots, x_m)=\sum_{S\subseteq [m]}a_S \prod_{i\in S}x_i\) and \(g(x_1, \dots, x_n)=\sum_{T\subseteq [n]}b_T \prod_{j\in T}x_j\) are distributive lattice polynomial operations written in maximal disjunctive normal form, then \(f\) commutes with \(g\) if and only if (i) some condition on constant terms and leading coefficients is met and (ii) some type of ``commutativity condition'' is satisfied by all coefficients. Corollaries of the main theorem include: a characterization of the self-commutativity, distributive lattice polynomial operations, and a characterization of the pairs of commuting distributive lattice term operations. I think that the article contains valuable results and can be a starting point for other studies on this subject.
Property / review text: The aim of this paper is to describe which pairs of distributive lattice polynomial operations commute. The authors consider operations \(f:X^m\longrightarrow X\) and \(g:X^n\longrightarrow X\) on \(X\); and \([x_{ij}]\in X^{m\times n}\) be a matrix of elemens of \(X\). It is said that \(f\) commutes with \(g\) on \([x_{ij}]\) if \(f\circ g([x_{ij}])=g\circ f([x_{ij}]^T)\), and that \(f\) and \(g\) commute if they commute on all matrices \([x_{ij}]\in X^{m\times n}\). Suppose that \(M\) is an \(R\)-module and that \(f(x_1,\dots, x_m)=\sum_{i=1}^m a_ix_i+c\) and \(g(x_1,\dots, x_n)=\sum_{j=1}^n b_jx_j+d\) are module polynomial operations. Using the notation \([k]\) for the set \(\{1, 2, \dots, k\}\) for all natural numbers \(k\), the main result of the paper can be stated as follows: if \(f(x_1, \dots, x_m)=\sum_{S\subseteq [m]}a_S \prod_{i\in S}x_i\) and \(g(x_1, \dots, x_n)=\sum_{T\subseteq [n]}b_T \prod_{j\in T}x_j\) are distributive lattice polynomial operations written in maximal disjunctive normal form, then \(f\) commutes with \(g\) if and only if (i) some condition on constant terms and leading coefficients is met and (ii) some type of ``commutativity condition'' is satisfied by all coefficients. Corollaries of the main theorem include: a characterization of the self-commutativity, distributive lattice polynomial operations, and a characterization of the pairs of commuting distributive lattice term operations. I think that the article contains valuable results and can be a starting point for other studies on this subject. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Lavinia Corina Ciungu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 08A40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 06D05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 39B05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6062528 / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial operations
Property / zbMATH Keywords: polynomial operations / rank
 
Normal rank
Property / zbMATH Keywords
 
commuting operations
Property / zbMATH Keywords: commuting operations / rank
 
Normal rank
Property / zbMATH Keywords
 
functional equations
Property / zbMATH Keywords: functional equations / rank
 
Normal rank

Revision as of 01:35, 30 June 2023

scientific article
Language Label Description Also known as
English
Commuting polynomial operations of distributive lattices
scientific article

    Statements

    Commuting polynomial operations of distributive lattices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2012
    0 references
    The aim of this paper is to describe which pairs of distributive lattice polynomial operations commute. The authors consider operations \(f:X^m\longrightarrow X\) and \(g:X^n\longrightarrow X\) on \(X\); and \([x_{ij}]\in X^{m\times n}\) be a matrix of elemens of \(X\). It is said that \(f\) commutes with \(g\) on \([x_{ij}]\) if \(f\circ g([x_{ij}])=g\circ f([x_{ij}]^T)\), and that \(f\) and \(g\) commute if they commute on all matrices \([x_{ij}]\in X^{m\times n}\). Suppose that \(M\) is an \(R\)-module and that \(f(x_1,\dots, x_m)=\sum_{i=1}^m a_ix_i+c\) and \(g(x_1,\dots, x_n)=\sum_{j=1}^n b_jx_j+d\) are module polynomial operations. Using the notation \([k]\) for the set \(\{1, 2, \dots, k\}\) for all natural numbers \(k\), the main result of the paper can be stated as follows: if \(f(x_1, \dots, x_m)=\sum_{S\subseteq [m]}a_S \prod_{i\in S}x_i\) and \(g(x_1, \dots, x_n)=\sum_{T\subseteq [n]}b_T \prod_{j\in T}x_j\) are distributive lattice polynomial operations written in maximal disjunctive normal form, then \(f\) commutes with \(g\) if and only if (i) some condition on constant terms and leading coefficients is met and (ii) some type of ``commutativity condition'' is satisfied by all coefficients. Corollaries of the main theorem include: a characterization of the self-commutativity, distributive lattice polynomial operations, and a characterization of the pairs of commuting distributive lattice term operations. I think that the article contains valuable results and can be a starting point for other studies on this subject.
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial operations
    0 references
    commuting operations
    0 references
    functional equations
    0 references