Global ETD Search

1	Flussgleichungen für das Anderson-Gitter zur Beschreibung von Schwer-Fermion-Systemen Meyer, Karsten 22 February 2004 (has links) (PDF) In der vorliegenden Arbeit wird die Physik von Schwer-Fermion-Systemen, die durch Lanthanid- und Aktinid-Übergangsmetallverbindungen realisiert werden, untersucht. Die Basis für eine theoretische Beschreibung bildet das Anderson-Gitter, welches das Wechselspiel freier Leitungselektronen und stark korrelierter Elektronen aus lokalisierten f-Orbitalen charakterisiert. Als Zugang zu diesem Modell wird die von Wegner vorgeschlagene Flussgleichungsmethode verwendet, ein analytisches Verfahren, welches auf der Konstruktion eines effektiven Hamilton-Operators basiert. Ein zentrales Thema dieser Arbeit ist die Beschreibung der elektronischen Struktur von Schwer-Fermion-Systemen. Insbesondere wird die Abhängigkeit statischer Größen vom Einfluss verschiedener Systemparameter betrachtet. Die Dynamik kollektiver Anregungen in Schwer-Fermion-Systemen wird an Hand der elektronischen Zustandsdichten und dynamischen magnetischen Suszeptibilitäten untersucht. / The physical properties of heavy-fermion systems are examined. These systems are mainly formed by rare earth or actinide compounds. Their essential physics can be characterized by the periodic Anderson model which describes the interplay of itinerant metal electrons and localized, but strongly correlated f-electrons. The present calculations are based on the flow equations approach proposed by Wegner. This method uses a continuous unitary transformation to derive an effective Hamiltonian of an easy to treat structure. Within this framework the electronic structure of heavy-fermion systems is calculated and the influence of external parameters is studied. Beside the derivation of static properties the density of states and dynamic magnetic susceptibilities are investigated in order to characterize the nature of collective excitations. Anderson-Gitter Flussgleichungen Kondo-Gitter Schwer-Fermion-Systeme Kondo lattice model flow equations heavy-fermion systems periodic Anderson model ddc:530 rvk:UP 3600 Anderson-Modell Fluss &lt;Mathematik&gt; Hamilton-Operator Kondo-Modell Schwere-Fermionen-System
2	Flussgleichungen für das Anderson-Gitter zur Beschreibung von Schwer-Fermion-Systemen Meyer, Karsten 15 March 2004 (has links) In der vorliegenden Arbeit wird die Physik von Schwer-Fermion-Systemen, die durch Lanthanid- und Aktinid-Übergangsmetallverbindungen realisiert werden, untersucht. Die Basis für eine theoretische Beschreibung bildet das Anderson-Gitter, welches das Wechselspiel freier Leitungselektronen und stark korrelierter Elektronen aus lokalisierten f-Orbitalen charakterisiert. Als Zugang zu diesem Modell wird die von Wegner vorgeschlagene Flussgleichungsmethode verwendet, ein analytisches Verfahren, welches auf der Konstruktion eines effektiven Hamilton-Operators basiert. Ein zentrales Thema dieser Arbeit ist die Beschreibung der elektronischen Struktur von Schwer-Fermion-Systemen. Insbesondere wird die Abhängigkeit statischer Größen vom Einfluss verschiedener Systemparameter betrachtet. Die Dynamik kollektiver Anregungen in Schwer-Fermion-Systemen wird an Hand der elektronischen Zustandsdichten und dynamischen magnetischen Suszeptibilitäten untersucht. / The physical properties of heavy-fermion systems are examined. These systems are mainly formed by rare earth or actinide compounds. Their essential physics can be characterized by the periodic Anderson model which describes the interplay of itinerant metal electrons and localized, but strongly correlated f-electrons. The present calculations are based on the flow equations approach proposed by Wegner. This method uses a continuous unitary transformation to derive an effective Hamiltonian of an easy to treat structure. Within this framework the electronic structure of heavy-fermion systems is calculated and the influence of external parameters is studied. Beside the derivation of static properties the density of states and dynamic magnetic susceptibilities are investigated in order to characterize the nature of collective excitations. info:eu-repo/classification/ddc/530 ddc:530
3	Search for heavy Higgs bosons A/H decaying to a top-quark pair in pp collisions at \sqrt(s)=8 TeV with the ATLAS detector Stănescu-Bellu, Mădălina 30 April 2021 (has links) In dieser Dissertation wird die Suche nach schweren neutralen pseudoskalaren A und skalaren H Higgs-Bosonen vorgestellt, die in gg-Fusionen erzeugt werden, und in ein Top-Antitop-Quark-Paar zerfallen. Gesucht wurde im vollständigen Datensatz von Proton–Proton-Kollisionen bei einer Schwerpunktsenergie von 8 TeV die vom ATLAS-Detektor am Large Hadron Collider aufgezeichnet wurde und einer integrierten Luminosität von 20.3 fb−1 entspricht. Der Signalprozess und der Haupthintergrund aus der Top-Quark-Paar-Produktion über starke gg-Fusionen-Prozesse, interferieren heftig, was zu einer Verzerrung des reinen Breit-Wigner-Resonanzpeak in eine Peak-Dip-Struktur führt. Diese Analyse ist die erste am LHC, die die Interferenz zwischen Signal und Hintergrundprozessen vollständig berücksichtigt. Die Suche stützt sich auf die statistische Analyse des invarianten Top-Quark-Paar-Massenspektrum, welches aus Ereignissen mit einem Elektron oder Myon mit hohem Transversalimpuls, einer hohen fehlenden Transversalenergie von dem nicht detektierten Neutrino und mindestens vier Jets rekonstruiert wird. In den Daten wird keine signifikante Abweichung vom erwarteten Standardmodell-Hintergrund beobachtet. Die Ausschließungsgrenzen wurden abgeleitet im Kontext des Typ II Two-Higgs-Doublet Model, für Higgs-Bosonen mit einer Masse von 500 und 750 GeV und mit niedrigerem tan(\beta)-Parameter, bei der tan(\beta) das Verhältnis der Vakuumerwartungswerte der beiden Higgs-Dublett-Felder ist. Diese Parameterregionen sind weitgehend unerforscht in Untersuchungen von beliebigen Endzuständen. / In this thesis a search is presented for heavy neutral pseudoscalar A and scalar H Higgs bosons, produced in gg fusion and decaying into a top-antitop quark pair. The search is conducted on the full proton-proton collisions dataset recorded by the ATLAS detector at the Large Hadron Collider at a centre-of-mass collision energy of 8 TeV and corresponding to an integrated luminosity of 20.3 fb−1. The signal process and the main background from top quark pair production via the gg fusion strong process, interfere heavily, distorting the signal shape from the pure Breit-Wigner resonance peak to a peak-dip structure. This analysis is the first one at the LHC that fully takes into account the interference between a signal and the background processes. The search relies on the statistical analysis of the top quark pair invariant mass spectrum, which is reconstructed in signal candidate events with a high-transverse momentum electron or muon, large missing transverse energy from the undetected neutrino and at least four jets. No significant deviation from the expected SM background is observed in data. Exclusion limits are derived in the context of the type-II Two-Higgs-Doublet Model, for Higgs boson masses of 500 and 750 GeV and in the low tan(\beta) parameter region, where tan(\beta) is the ratio of the vacuum expectation values of the two Higgs doublet fields. These parameter regions have been largely unexplored by searches in any final state. Physik LHC ATLAS Higgs 8TeV Skalar Pseudoskalar A H schwer Interferenz Top-Quark Top-Quark-Paar ttbar Top-Schleife Breit-Wigner Peak-Dip-Struktur semileptonisch 2HDM BSM physics LHC ATLAS Higgs 8TeV scalar pseudoscalar A H heavy interference top-quark top-quark-pair ttbar top-loop Breit-Wigner peak-dip semileptonic 2HDM BSM 530 Physik ddc:530
4	Algorithms for the Maximum Independent Set Problem Lê, Ngoc C. 13 July 2015 (has links) (PDF) This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs. maximal unabhängige Menge maximal stabile Menge Unabhängigkeitszahl Stabilitätszahl vergrößernde Graphen vergrößernde Knoten Modulzerlegung Cliquenseparator Graphentransformationen pseudo-Boolesche Funktion α-redundante Knoten MIN MAX VO Knotenanordnung Heuristik polynomiale Lösung NP-schwer Maximum Independent Set Stable Set Independence Number Stability Number Augmenting Graph Augmenting Vertex Modular Decomposition Clique Separator Graph Transformations Pseudo-Boolean Function α-redundant Vertex MIN MAX VO Vertex Ordering Heuristic Subcubic Graphs Polynomial Solution NP-hard ddc:510 Stabile-Mengen-Problem
5	Algorithms for the Maximum Independent Set Problem Lê, Ngoc C. 18 February 2015 (has links) This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs. info:eu-repo/classification/ddc/510 ddc:510 Stabile-Mengen-Problem

1

Page generated in 0.0342 seconds