<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=145213"><dc:title>Eulerian numbers and Coxeter groups</dc:title><dc:creator>Borges Santos da Costa,	João Manuel	(Avtor)
	</dc:creator><dc:creator>Konvalinka,	Matjaž	(Mentor)
	</dc:creator><dc:subject>Eulerian numbers</dc:subject><dc:subject>Eulerian polynomials</dc:subject><dc:subject>partial order</dc:subject><dc:subject>hyperplane
arrangements</dc:subject><dc:subject>Coxeter groups</dc:subject><dc:description>Eulerian numbers arise ubiquitously in various areas of mathematics. Indeed, this number sequence gives us the possibility to find several combinatorial invariants that characterize a panoply of geometric and algebraic structures. We will give a walkthrough on this beautiful counting sequence, starting with basic definitions and properties that are at the core of its combinatorial structure. Then, we introduce the notion of a partially ordered set and hyperplane arrangement, giving examples where the eulerian numbers naturally arise. Finally, there is a brief introduction to the theory of Coxeter groups, and, most importantly, how we can characterize them by using Eulerian numbers.</dc:description><dc:date>2023</dc:date><dc:date>2023-04-13 11:39:53</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>145213</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
