Essays about: "Young diagram"

Found 4 essays containing the words Young diagram.

  1. 1. A Study on Poset Probability

    University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Author : Albin Jaldevik; [2022]
    Keywords : Discrete mathematics; Order theory; Combinatorics; Partially ordered set; Poset; Linear extension; Topological sorting; Probability; Partition; Young diagram;

    Abstract : Let be a finite poset (partially ordered set) with cardinality . A linear extension of is an order-preserving bijection : , that is, if in then . We define the poset probability as the proportion of linear extensions where . We are primarily interested in for incomparable elements . READ MORE

  3. 2. Practical Implementation of Lean at Small and Young Companies

    University essay from Lunds universitet/Industriell Produktion

    Author : Fredrik Hasselgren; [2018]
    Keywords : “Lean SME”; “Lean Small Company”; “Lean Manufacturing”; “Practical Lean Implementation”; “Lean Young Company”; Technology and Engineering;

    Abstract : Introduction: This thesis aims to investigate how a small and young company can implement the management philosophy Lean. The thesis is designed as a literature study with two objectives. The first objective is to identify what Lean is and what its underlying tools, methods and principles are. READ MORE

  4. 3. Partizan Poset Games

    University essay from KTH/Matematik (Avd.)

    Author : Fredrik Wahlberg; [2014]
    Keywords : ;

    Abstract : This thesis analyzes a class of element-removal partizan games played on colored posets. In these games a player moves by removing an element of its color together with all greater elements in the poset. A player loses if it has no elements left to remove. READ MORE

  5. 4. Pomax games: A new class of partizan games played on posets

    University essay from KTH/Matematik (Avd.)

    Author : ERik Järleberg; [2013]
    Keywords : ;

    Abstract : A new class of partizan games (Pomax games) played on posets is presented. It is shown that all Pomax games are integer valued, and that it is NP-hard to determine the winner of an arbitrary Pomax game. Pomax games played on trees are solved, and also for Pomax games played on a chess-colored Young diagram. . READ MORE