Sökning: "bijective"
Visar resultat 1 - 5 av 8 uppsatser innehållade ordet bijective.
1. Friezes, Triangulations, and Trees
Kandidat-uppsats, Lunds universitet/Matematik LTH; Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/MatematikcentrumSammanfattning : In this thesis, we focus on these three classes of objects: frieze patterns, polygon triangulations, and planar binary rooted trees. After proving that these objects are in pairwise bijective correspondence with each other, we introduce Catalan numbers through Dyck paths and prove that all these objects are Catalan objects. LÄS MER
2. Electrodynamic field at spatial infinity
Master-uppsats, KTH/FysikSammanfattning : The treatment of spatial infinity is one of the remaining major open problems in the theory of isolated self-gravitating systems. Especially when one wants to model scattering of gravitational radiation in spacetime. In this thesis the conformal theory is used to study simple electromagnetic fields, close to spatial infinity. LÄS MER
3. Fluxes from the reduction of a gauge theory on a squashed three-sphere
Master-uppsats, Uppsala universitet/Teoretisk fysikSammanfattning : We present the supersymmetry and localization of an N=2 theory on S3b along with that of an N=(2,2) theory on S2. Performing the dimensional reduction of the theory on S3b produces a theory on S2 with no flux-sectors. LÄS MER
4. The Information Bottleneck : Connections to Other Problems, Learning and Exploration of the IB Curve
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : In this thesis we study the information bottleneck (IB) method. This is an informationtheoretic framework which addresses the question of what are the relevant factors of arandom variable X to explain another statistically dependent random variable Y . Thesefactors are embedded into a bottleneck variable T obeying the Markov condition Y $X $ T. LÄS MER
5. Linking the dynamics of genetic algorithms to the encoding of information
Kandidat-uppsats, Lunds universitet/Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; Lunds universitet/Institutionen för astronomi och teoretisk fysik - Genomgår omorganisationSammanfattning : Genetic algorithms are complex constructs often used as heuristic search methods in contexts ranging from combinatorial optimisation to in silico evolution. They draw inspiration from the principles of biological evolution by utilizing the concepts of mutation, reproduction and selection in order to improve a population of solutions. LÄS MER