Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/13988
Nаziv: | On the maximum size of the terms in the realization of symmetric functions | Аutоri: | Tosic R. Stojmenovic I. Miyakawa M. |
Dаtum izdаvаnjа: | 1-мај-1991 | Čаsоpis: | Proceedings of The International Symposium on Multiple-Valued Logic | Sažetak: | The symmetric functions of m-valued logic have a sum-product (i.e. max-min) representation whose terms are sums of fundamental symmetric functions (FSFs). These sums may be simplified if they contain adjacent SFSs. This naturally leads to the combinatorial problem of determining the maximum size M(m, n) of adjacent-free sets of n-variable SFSs. J. C. Muzio (1990) related M(m, n) to a special graph F(m, n). Continuing in this direction, the authors give a simple closed formula for M (m, n) and then deduce that for large m or large n the largest nonsimplifiable set of n-variable SFSs consists of approximately one-half of all possible FSFs, proving thus also all the conjectures from the Muzio paper. | URI: | https://open.uns.ac.rs/handle/123456789/13988 | ISBN: | 0818621451 | ISSN: | 0195623X |
Nаlаzi sе u kоlеkciјаmа: | Naučne i umetničke publikacije |
Prikаzаti cеlоkupаn zаpis stаvki
Prеglеd/i stаnicа
1
Prоtеklа nеdеljа
0
0
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.