List edge-coloringIn mathematics, list edge-coloring is a type of graph coloring that combines list coloring and edge coloring. An instance of a list edge-coloring problem consists of a graph together with a list of allowed colors for each edge. A list edge-coloring is a choice of a color for each edge, from its list of allowed colors; a coloring is proper if no two adjacent edges receive the same color. A graph G is k-edge-choosable if every instance of list edge-coloring that has G as its underlying graph and that provides at least k allowed colors for each edge of G has a proper coloring.
Internet des objetsvignette|upright=1.5|Différents aspects de l’Internet des objets. LInternet des objets ou IdO (en anglais (the) Internet of Things ou IoT) est l'interconnexion entre l'Internet et des objets, des lieux et des environnements physiques. L'appellation désigne un nombre croissant d'objets connectés à Internet permettant ainsi une communication entre nos biens dits physiques et leurs existences numériques. Ces formes de connexions permettent de rassembler de nouvelles masses de données sur le réseau et donc, de nouvelles connaissances et formes de savoirs.
Torsion-free moduleIn algebra, a torsion-free module is a module over a ring such that zero is the only element annihilated by a regular element (non zero-divisor) of the ring. In other words, a module is torsion free if its torsion submodule is reduced to its zero element. In integral domains the regular elements of the ring are its nonzero elements, so in this case a torsion-free module is one such that zero is the only element annihilated by some non-zero element of the ring.
Doubly connected edge listThe doubly connected edge list (DCEL), also known as half-edge data structure, is a data structure to represent an embedding of a planar graph in the plane, and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects in question (vertices, edges, faces). It is used in many algorithms of computational geometry to handle polygonal subdivisions of the plane, commonly called planar straight-line graphs (PSLG).
Verma moduleVerma modules, named after Daya-Nand Verma, are objects in the representation theory of Lie algebras, a branch of mathematics. Verma modules can be used in the classification of irreducible representations of a complex semisimple Lie algebra. Specifically, although Verma modules themselves are infinite dimensional, quotients of them can be used to construct finite-dimensional representations with highest weight , where is dominant and integral. Their homomorphisms correspond to invariant differential operators over flag manifolds.
