Mediatic graphs
| dc.creator | Falmagne, J. -Cl. | |
| dc.creator | Ovchinnikov, S. | |
| dc.date | 2007-04-07 | |
| dc.date | 2007-08-14 | |
| dc.date.accessioned | 2026-07-07T08:23:15Z | |
| dc.date.available | 2026-07-07T08:23:15Z | |
| dc.description | Any medium can be represented as an isometric subgraph of the hypercube, with each token of the medium represented by a particular equivalence class of arcs of the subgraph. Such a representation, although useful, is not especially revealing of the structure of a particular medium. We propose an axiomatic definition of the concept of a `mediatic graph'. We prove that the graph of any medium is a mediatic graph. We also show that, for any non-necessarily finite set S, there exists a bijection from the collection M of all the media on a given set S (of states) onto the collection G of all the mediatic graphs on S. | |
| dc.description | Four axioms replaced by two; two references added; Fig.6 corrected | |
| dc.identifier | https://arxiv.org/abs/0704.0994 | |
| dc.identifier | http://arxiv.org/abs/0704.0994 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/135930 | |
| dc.subject | Combinatorics | |
| dc.title | Mediatic graphs | |
| dc.type | text |