@prefix dcat: . @prefix dct: . @prefix foaf: . @prefix vcard: . @prefix xsd: . a dcat:Dataset ; dct:description """ In chapter 2, we study a special decomposition intoduced by Lafforgue. More precisely, let P(M) be the matroid base polytope of a matroid M. A matroid base polytope decomposition of P(M) is a decomposition of the form P(M) = St i=1 P(Mi) where each P(Mi) is also a matroid base polytope for some matroid Mi, and for each 1 i 6= j t, the intersection P(Mi)\\P(Mj) is a face of both P(Mi) and P(Mj). In this thesis, we investigate hyperplane splits, that is, polytope decompositions when t = 2. We give sufficient conditions for M so P(M) has a hyperplane split and characterize when P(M1 M2) has a hyperplane split where M1 M2 denote the direct sum of matroids M1 and M2. We also prove that P(M) has not a hyperplane split if M is binary. Finally, we show that P(M) has not a decomposition if its 1-skeleton is the hypercube. In chapitre 3 we investigate the class of lattice oriented matroids. After giving a complete characterization of lattice oriented matroids in terms of union of rank-1 uniform oriented matroids, we show that this class is closed under duality and minors. We then study the simplexes of the hyperplane arrangements arising from lattice oriented matroids. We present a characterization of these simplexes and contruct arrangements of n hyperplanes in dimension d containing O(2k(n k )k) simplexes with n < k = bd 2 c. We finally investigate a question by Grünbaum [Grünbaum, 1971] concerning colorings of pseudoline arrangements. We extend Grünbaum's question to arrangements of hyperplanes and answer affirmatively the generalized question for arrangements arising from lattice oriented matroids. In chapitre 4 we are interested in an oriented matroid version of the well-known Shannon's switching game introduced by Hamidoune and Las Vergnas[Hamidoune et Las Vergnas, 1997a] in 1986. They conjectured that the classification of the directed switching game on an oriented matroids is identical to the classification of non-oriented version. In this thesis, we support this conjecture by showing its validity for an infinity class of oriented matroids obtained as unions of rank-1 and/or rank-2 uniform oriented matroids. """ ; dct:identifier "NNT: 2011PA066253" ; dct:issued "2026-05-11T01:31:15.107958"^^xsd:dateTime ; dct:language "fr" ; dct:modified "2026-05-11T01:31:15.107962"^^xsd:dateTime ; dct:publisher ; dct:title "Contributions in the matroid theory : base polytope, orientations, algorithms" ; dcat:contactPoint [ a vcard:Organization ; vcard:fn "CCSD" ] ; dcat:distribution ; dcat:keyword "arrangement-dhyperplans", "arrangement-of-hyperplanes", "decomposition-de-polytope", "infoeu-reposemanticsdoctoralthesis", "jeux-de-commutation", "mathmath-rtmathematics-mathrepresentation-theory-mathrt", "matroid", "matroid-base-polytope", "matroide", "matroide-oriente", "oriented-matroid", "polytope-de-bases-de-matroide", "polytope-decomposition", "switching-game", "theses" ; dcat:landingPage . a dcat:Distribution ; dct:format "HTML" ; dct:issued "2026-05-11T01:31:15.110003"^^xsd:dateTime ; dct:modified "2026-05-11T01:31:15.087445"^^xsd:dateTime ; dct:title "Contributions in the matroid theory : base polytope, orientations, algorithms" ; dcat:accessURL . a foaf:Agent ; foaf:name "test_moissonnage_selune" . a foaf:Document .