Emanuela Fachini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Emanuela Fachini has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- János Körner
NKFIH Hungary Sapienza University of Rome Italy
10 shared publications - Gérard Cohen
Télécom ParisTech, department INFRES/MIC2, CNRS, UMR 5441
4 shared publications - Gérard Cohen
Département Informatique et Réseaux, École Nationale Supérieure des Télécommunications CNRS Paris Paris, France
2 shared publications Gerard Cohen
1 shared publication- Graham Brightwell
London School of Economics
1 shared publication - Gábor Simonyi
Department of Computer Science and Information Theory Alfréd Rényi Institute of Mathematics Budapest Hungary
1 shared publication
Latest Publications
- Open Access
Divergent permutations
Two permutations of the natural numbers diverge if the absolute value of the difference of their elements in the same position goes to infinity. We show that there exists an infinite number of pairwise divergent permutations of the naturals. We relate this result to more general questions about the permutation capacity of infinite graphs.
Open AccessDivergent permutations
Two permutations of the natural numbers diverge if the absolute value of the difference of their elements in the same position goes to infinity. We show that there exists an infinite number of pairwise divergent permutations of the naturals. We relate this result to more general questions about the permutation capacity of infinite graphs.
- Open Access
Interlocked permutations
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.
Open AccessInterlocked permutations
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.
- Open Access
Hamilton paths with lasting separation
We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained in only one of them and edge{disjoint from the other one.
Open AccessHamilton paths with lasting separation
We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained in only one of them and edge{disjoint from the other one.
- 26 May 2016
- Published by Wiley in Journal of Graph Theory
- Vol. 85 (1) , 107-114
Path Separation by Short Cycles
- 26 May 2016
- Published by Wiley in Journal of Graph Theory
- Vol. 85 (1) , 107-114
Path Separation by Short Cycles
- Open Access
Path separation by short cycles
Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any pair of paths in the family is separated by a cycle of length $k.$Open AccessPath separation by short cycles
Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any pair of paths in the family is separated by a cycle of length $k.$ - Open Access
Zero-error capacity of binary channels with memory
We begin a systematic study of the problem of the zero--error capacity of noisy binary channels with memory and solve some of the non--trivial cases.
Open AccessZero-error capacity of binary channels with memory
We begin a systematic study of the problem of the zero--error capacity of noisy binary channels with memory and solve some of the non--trivial cases.
- 30 July 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (6) , 1417-1425
Connector Families of Graphs
- 30 July 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (6) , 1417-1425
Connector Families of Graphs
- 1 December 2011
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 38, 195-199
Permutation Capacities and Oriented Infinite Paths
- 1 December 2011
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 38, 195-199
Permutation Capacities and Oriented Infinite Paths
- 16 October 2010
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 27 (4) , 495-503
Forbiddance and Capacity
- 16 October 2010
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 27 (4) , 495-503
Forbiddance and Capacity
- Open Access
On the permutation capacity of digraphs
We extend several results of the third author and C. Malvenuto on graph-different permutations to the case of directed graphs and introduce new open problems. Permutation capacity is a natural extension of Sperner capacity from finite directed graphs to infinite digraphs. Our subject is combinatorial in nature, but can be equally regarded as zero-error information theory.
Open AccessOn the permutation capacity of digraphs
We extend several results of the third author and C. Malvenuto on graph-different permutations to the case of directed graphs and introduce new open problems. Permutation capacity is a natural extension of Sperner capacity from finite directed graphs to infinite digraphs. Our subject is combinatorial in nature, but can be equally regarded as zero-error information theory.