121 research outputs found

    Is zero focalization reducible to variable internal and external focalization?

    Full text link
    Ist Nullfokalisierung etwas anderes als (variable) interne und/oder externe Fokalisierung? Der Beitrag argumentiert, dass dies durchaus der Fall ist: Legt man die durch Genette popularisierte Theorie von Fokalisierungstypen zugrunde, so ist Nullfokalisierung nicht auf interne oder externe Fokalisierung zurĂŒckfĂŒhrbar. Dasselbe gilt, wenn die Genette'sche Theorie der Fokalisierung durch eine plausiblere Alternativtheorie ersetzt wird. Der Beitrag erlĂ€utert und begrĂŒndet diese Thesen

    Local moduli of holomorphic bundles

    Get PDF
    We study moduli of holomorphic vector bundles on non-compact varieties. We discuss filtrability and algebraicity of bundles and calculate dimensions of local moduli. As particularly interesting examples, we describe numerical invariants of bundles on some local Calabi-Yau threefolds.Comment: 18 pages. Revision history: v1: As submitted for publication. v2: minor corrections, as publishe

    Rhenium is different: CO tetramerization induced by a divalent lanthanide complex in rhenium carbonyls

    Get PDF
    The reduction of M2_{2}(CO)10_{10} (M = Mn, Re) with different divalent lanthanide (Ln = Sm, Yb) compounds was investigated. Depending on the steric demand of the ligand, either unusual CO tetramerization or formation of a new Re carbonyl anion occurred in the case of Re. Theoretical calculations were performed for a better understanding of the nature of bonding in the newly formed species

    A cyclopentadienyl functionalized silylene-a flexible ligand for Si- And C-coordination

    Get PDF
    The synthesis of a 1,2,3,4-tetramethylcyclopentadienyl (Cp4^{4}) substituted four-membered N-heterocyclic silylene [{PhC(NtBu) 2_{2}}Si(C5_{5}Me4_{4}H)] is reported first. Then, selected reactions with transition metal and a calcium precursor are shown. The proton of the Cp4_{4}-unit is labile. This results in two different reaction pathways: (1) deprotonation and (2) rearrangement reactions. Deprotonation was achieved by the reaction of [{PhC(NtBu) 2_{2}}Si(C5_{5}Me4_{4}H)] with suitable zinc precursors. Rearrangement to [{PhC(NtBu) 2_{2}}(C5_{5}Me4_{4})SiH], featuring a formally tetravalent silicon R2_{2}CSi(Râ€Č)-H unit, was observed when the proton of the Cp4^{4} ring was shifted from the Cp4^{4}-ring to the silylene in the presence of a Lewis acid. This allows for the coordination of the Cp4^{4}-ring to a calcium compound. Furthermore, upon reaction with transition metal dimers [MCl(cod)] 2_{2} (M = Rh, Ir; cod = 1,5-cyclooctadiene) the proton stays at the Cp4^{4}-ring and the silylene reacts as a sigma donor, which breaks the dimeric structure of the precursors

    Stimuli Responsive Silylene: Electromerism Induced Reversible Switching Between Mono‐ and Bis‐Silylene

    Get PDF
    Electromerism is a very well-known phenomenon in transition metal chemistry. In main group chemistry, this concept has only started getting attention recently. We report stimuli responsive low-valent silicon compounds exhibiting electromerism. A mixed-valent silaiminyl-silylene 1, [LSi−Si(NDipp)L] (L=PhC(Nt^tBu)2_2), was synthesized in a single step from amidinate-chlorosilylene. Compound 1 has two interconnected Si atoms in formally +I and +III oxidation states. Upon treatment with Lewis acidic CuI^IX (X=mesityl, Cl, Br, I), electron redistribution occurs resulting in the formation of [{LSi(NDipp)Si(L)}−CuX], in which both silicon atoms are in the +II formal oxidation state. Removal of the copper center from [{LSi(NDipp)Si(L)}−CuX] by using a Lewis basic carbene led to reformation of the precursor [LSi−Si(NDipp)L]. Thus, the process is fully reversible. This showcases the first example of Lewis acid/base-induced reversible electromerism in silicon chemistry

    A parametric integer programming algorithm for bilevel mixed integer programs

    Get PDF
    We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader's variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case it yields a ``better than fully polynomial time'' approximation scheme with running time polynomial in the logarithm of the relative precision. For the pure integer case where the leader's variables are integer, and hence optimal solutions are guaranteed to exist, we present two algorithms which run in polynomial time when the total number of variables is fixed.Comment: 11 page
    • 

    corecore