References of "Lecomte, Pierre"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailOn a Lie Algebraic Characterization of Vector Bundles
Lecomte, Pierre ULg; Leuther, Thomas ULg; Zihindula Mushengezi, Elie ULg

in Symmetry, Integrability and Geometry: Methods and Applications [=SIGMA] (2012)

We prove that a vector bundle E -> M is characterized by the Lie algebra generated by all differential operators on E which are eigenvectors of the Lie derivative in the direction of the Euler vector ... [more ▼]

We prove that a vector bundle E -> M is characterized by the Lie algebra generated by all differential operators on E which are eigenvectors of the Lie derivative in the direction of the Euler vector field. Our result is of Pursell-Shanks type but it is remarkable in the sense that it is the whole f ibration that is characterized here. The proof relies on a theorem of [Lecomte P., J. Math. Pures Appl. (9) 60 (1981), 229{239] and inherits the same hypotheses. In particular, our characterization holds only for vector bundles of rank greater than 1. [less ▲]

Detailed reference viewed: 41 (9 ULg)
Full Text
See detailAbstract numeration systems (Chapter 3)
Lecomte, Pierre ULg; Rigo, Michel ULg

in Berthé, Valérie; Rigo, Michel (Eds.) Combinatorics, Automata and Number Theory (2010)

Detailed reference viewed: 72 (9 ULg)
Full Text
Peer Reviewed
See detailCombinatorics, Automata and Number Theory 2006
Berthé, Valérie; Lecomte, Pierre ULg; Rigo, Michel ULg

in Theoretical Computer Science (2008), 391

Detailed reference viewed: 17 (4 ULg)
Full Text
Peer Reviewed
See detailReal numbers having ultimately periodic representations in abstract numeration systems
Lecomte, Pierre ULg; Rigo, Michel ULg

in Information and Computation (2004), 192(1), 57-83

Using a genealogically ordered infinite regular language, we know how to represent an interval of R. Numbers having an ultimately periodic representation play a special role in classical numeration ... [more ▼]

Using a genealogically ordered infinite regular language, we know how to represent an interval of R. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to characterize the numbers having an ultimately periodic representation in generalized systems built on a regular language. The syntactical properties of these words are also investigated. Finally, we show the equivalence of the classical theta-expansions with our generalized representations in some special case related to a Pisot number theta. (C) 2004 Elsevier Inc. All rights reserved. [less ▲]

Detailed reference viewed: 13 (2 ULg)
Full Text
Peer Reviewed
See detailOn the representation of real numbers using regular languages
Lecomte, Pierre ULg; Rigo, Michel ULg

in Theory of Computing Systems (2002), 35(1, JAN-FEB), 13-38

Using a lexicographically ordered regular language, we show how to represent an interval of R. We determine exactly the possible representations of any element in this interval and study the function ... [more ▼]

Using a lexicographically ordered regular language, we show how to represent an interval of R. We determine exactly the possible representations of any element in this interval and study the function which maps a representation onto its numerical value. We make explicit the relationship between the convergence of finite words to an infinite word and the convergence of the corresponding approximations to a real number. [less ▲]

Detailed reference viewed: 42 (10 ULg)
Full Text
Peer Reviewed
See detailNumerations systems on a regular language
Lecomte, Pierre ULg; Rigo, Michel ULg

in Theory of Computing Systems (2001), 34

Generalizations of positional number systems in which N is recognizable by finite automata are obtained by describing an arbitrary infinite regular language according to the lexicographic ordering. For ... [more ▼]

Generalizations of positional number systems in which N is recognizable by finite automata are obtained by describing an arbitrary infinite regular language according to the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study translation and multiplication by constants as well as the order-dependence of the recognizability. [less ▲]

Detailed reference viewed: 29 (2 ULg)
Full Text
Peer Reviewed
See detailComparison of some modules of the Lie algebra of vector fields
Lecomte, Pierre ULg; Mathonet, Pierre ULg; Tousset, E.

in Indagationes Mathematicae (1996), 7(4), 461-471

Detailed reference viewed: 12 (2 ULg)
Peer Reviewed
See detailRecherches en production laitière et valorisation du lait.
Blecker, Christophe ULg; Burny, Philippe ULg; Fabry, J. et al

in Annales de Gembloux (1996), 102(3-4), 131-181

Detailed reference viewed: 102 (37 ULg)