Publication date
January 2011
DOI Publisher
Springer Science and Business Media LLCAbstract
We provide sufficient conditions for a lattice polynomial function to be self-commuting. We explicitly describe self-commuting 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
The topic of the thesis are common fixed points of commuting functions. With the help of the Mountai...
Let L be a bounded distributive lattice. We give several characterizations of those Ln → L mappings ...
This paper shows that the commutativity condition [A(t), A′(t)] = 0 is often not necessary to guara...
peer reviewedWe provide sufficient conditions for a lattice polynomial function to be self-commuting...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
AbstractThe concept of permutograph is introduced and properties of integral functions on permutogra...
AbstractThe chain polynomial of a graph was introduced in Read and Whitehead (Discrete Math. 204 (19...
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : X n → X...
This research is an exposition of the paper Commutativity of Polynomials by Shamuel Avital and Edwar...
We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, a...
peer reviewedThe associativity property, usually defined for binary functions, can be generalized to...
Référence ArXiV indiquée ci-dessous sous le titre : "A generalization of Goodstein's theorem: interp...
peer reviewedWe define the concept of weighted lattice polynomial functions as lattice polynomial fu...
The topic of the thesis are common fixed points of commuting functions. With the help of the Mountai...
Let L be a bounded distributive lattice. We give several characterizations of those Ln → L mappings ...
This paper shows that the commutativity condition [A(t), A′(t)] = 0 is often not necessary to guara...
peer reviewedWe provide sufficient conditions for a lattice polynomial function to be self-commuting...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
AbstractThe concept of permutograph is introduced and properties of integral functions on permutogra...
AbstractThe chain polynomial of a graph was introduced in Read and Whitehead (Discrete Math. 204 (19...
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : X n → X...
This research is an exposition of the paper Commutativity of Polynomials by Shamuel Avital and Edwar...
We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, a...
peer reviewedThe associativity property, usually defined for binary functions, can be generalized to...
Référence ArXiV indiquée ci-dessous sous le titre : "A generalization of Goodstein's theorem: interp...
peer reviewedWe define the concept of weighted lattice polynomial functions as lattice polynomial fu...
The topic of the thesis are common fixed points of commuting functions. With the help of the Mountai...
Let L be a bounded distributive lattice. We give several characterizations of those Ln → L mappings ...
This paper shows that the commutativity condition [A(t), A′(t)] = 0 is often not necessary to guara...
Add to ORKG