Publications associées à Graphe de Levi

Matching fields and lattice points of simplices

We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on l ...

2020

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

Effects of Motion and Configural Complexity on Color Transparency Perception

Sabine Süsstrunk, Peggy Gerardin

We tested whether motion and configural complexity affect perceived transparency. A series of five coherent chromatic transformations in color space was applied across a figure: translation, convergence, shear, divergence and rotation. The stimuli consiste ...

2006

Configural and perceptual factors influencing the perception of color transparency

Peggy Gerardin

The mechanisms by which the brain represents colors are largely unknown. In addition, the large number of color phenomena in the natural world has made understanding color rather difficult. Color transparency perception, which is studied in this thesis, is ...

EPFL2005