Self-commuting Lattice Polynomial Functions on Chains
نویسندگان
چکیده
We provide sufficient conditions for a lattice polynomial function to be self-commuting. We explicitly describe self-commuting polynomial functions on chains.
منابع مشابه
Representations and Characterizations of Polynomial Functions on Chains
We are interested in representations and characterizations of lattice polynomial functions f : L → L, where L is a given bounded distributive lattice. In a companion paper [4], we investigated certain representations and provided various characterizations of these functions both as solutions of certain functional equations and in terms of necessary and sufficient conditions. In the present pape...
متن کاملSelf-adjoint commuting differential operators of rank two
This is a survey of results on self-adjoint commuting ordinary differential operators of rank two. In particular, the action of automorphisms of the first Weyl algebra on the set of commuting differential operators with polynomial coefficients is discussed, as well as the problem of constructing algebro-geometric solutions of rank l > 1 of soliton equations. Bibliography: 59 titles.
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملPolynomial Functions on Bounded Chains
We are interested in representations and characterizations of lattice polynomial functions f : L → L, where L is a given bounded distributive lattice. In an earlier paper [4, 5], we investigated certain representations and provided various characterizations of these functions both as solutions of certain functional equations and in terms of necessary and sufficient conditions. In the present pa...
متن کاملOn the energy of non-commuting graphs
For given non-abelian group G, the non-commuting (NC)-graph $Gamma(G)$ is a graph with the vertex set $G$ $Z(G)$ and two distinct vertices $x, yin V(Gamma)$ are adjacent whenever $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
متن کامل