activity
20022015
most citedOn Verifying and Engineering the Well-gradedness of a Union-closed Family

16 citations · 23 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2015★ 6 cited

Knowledge Spaces and Learning Spaces

Jean-Paul Doignon, Jean-Claude Falmagne

How to design automated procedures which (i) accurately assess the knowledge of a student, and (ii) efficiently provide advices for further study? To produce well-founded answers,…

math-ph2012★ 1 cited

On a bounded version of Holder's Theorem and an application to the permutability equation

Jean-Claude Falmagne

The permutability equation G(G(x,y),z) = G(G(x,z),y) is satisfied by many scientific and geometric laws. A few examples among many are: The Lorentz-FitzGerald Contraction, Beer's L…

math-ph2008

Note: Axiomatic Derivation of the Doppler Factor and Related Relativistic Laws

Jean-Claude Falmagne, Jean-Paul Doignon

The formula for the relativistic Doppler effect is investigated in the context of two compelling invariance axioms. The axioms are expressed in terms of an abstract operation gener…

math.CO2008

Projections of a learning space

Jean-Claude Falmagne

Any subset Q' of the domain Q of a learning space defines a projection of that learning space on Q' which is itself a learning space consistent with the original one. Moreover, suc…

math.CO2007★ 16 cited

On Verifying and Engineering the Well-gradedness of a Union-closed Family

David Eppstein, Jean-Claude Falmagne, Hasan Uzun

Current techniques for generating a knowledge space, such as QUERY, guarantees that the resulting structure is closed under union, but not that it satisfies wellgradedness, which i…

cs.DS2002

Algorithms for Media

David Eppstein, Jean-Claude Falmagne

Falmagne recently introduced the concept of a medium, a combinatorial object encompassing hyperplane arrangements, topological orderings, acyclic orientations, and many other famil…