Cooperative and Non-Cooperative Differential Game Solutions to an Investment and Pricing Problem

A monopoly possesses a finite stock of a resource and wishes to determine an optimal pricing policy. The competitive fringe invests in production capacity and wishes to select an optimal investment rate. Demand towards the monopoly depends on price as well as on the sales rate of the competition. Modelling the situation as a differential game, non-cooperative (Nash and Stackelberg) and cooperative (Pareto) equilibria are determined. Owing to the special structure of the game, these solutions can be found in closed form.     

Transverse magnetization transfer under planar mixing conditions in spin systems consisting of three coupled spins 1/2

Polarization transfer under planar mixing conditions is a widely used tool in modern NMR-experiments. In the case of two coupled spins 1/2 or a chain of three or more spins 1/2 with only nearest neighbor couplings, it is only possible to transfer a single magnetization component (longitudinal magnetization in the principle axis system of the planar coupling tensors). However, if all couplings in a three-spin system are non-zero, it turns out that all magnetization components can be efficiently transferred even under strictly planar mixing conditions. In this article a detailed theoretical analysis is presented based on analytical transverse coherence transfer functions and on the underlying commutator algebra. In addition, transverse magnetization transfer is demonstrated experimentally. The results show that in highly coupled spin systems, as for example in the case of partially aligned samples with many residual dipolar couplings, special care has to be taken to avoid phase distortions if planar mixing steps are used.     

Reasoning about proof and knowledge

In previous work [15], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from Gödel's interpretation of IPC in S4, our modal systems contain IPC in the way established in [13]. The modal operator can be viewed as a predicate for intuitionistic truth, i.e. proof. Epistemic principles are partially adopted from Intuitionistic Epistemic Logic IEL [4]. In the present paper, we show that the S5-style systems of our hierarchy correspond to an extended Brouwer–Heyting–Kolmogorov interpretation and are complete w.r.t. a relational semantics based on intuitionistic general frames. In this sense, our S5-style logics are adequate and complete systems for the reasoning about proof combined with belief or knowledge. The proposed relational semantics is a uniform framework in which also IEL can be modeled. Verification-based intuitionistic knowledge formalized in IEL turns out to be a special case of the kind of knowledge described by our S5-style systems.     

Experimental implementation of an adiabatic quantum optimization algorithm

We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to solve hard problems. This experiment uses a particularly well-suited three quantum bit molecule and was made possible by introducing a technique that encodes general instances of the given optimization problem into an easily applicable Hamiltonian. Our results indicate an optimal run time of the adiabatic algorithm that agrees well with the prediction of a simple decoherence model.     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.     

1‐Factor and Cycle Covers of Cubic Graphs

Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. Any list of three 1‐factors induces a core of a cubic graph. We use results on the structure of cores to prove sufficient conditions for Berge‐covers and for the existence of three 1‐factors with empty intersection. Furthermore, if , then is an upper bound for the girth of G. We also prove some new upper bounds for the length of shortest cycle covers of bridgeless cubic graphs. Cubic graphs with have a 4‐cycle cover of length and a 5‐cycle double cover. These graphs also satisfy two conjectures of Zhang 18 . We also give a negative answer to a problem stated in 18 .     

Minkowski content and fractal curvatures of self-similar tilings and generator formulas for self-similar sets

We study Minkowski contents and fractal curvatures of arbitrary self-similar tilings (constructed on a feasible open set of an IFS) and the general relations to the corresponding functionals for self-similar sets. In particular, we characterize the situation, when these functionals coincide. In this case, the Minkowski content and the fractal curvatures of a self-similar set can be expressed completely in terms of the volume function or curvature data, respectively, of the generator of the tiling. In special cases such formulas have been obtained recently using tube formulas and complex dimensions or as a corollary to results on self-conformal sets. Our approach based on the classical Renewal Theorem is simpler and works for a much larger class of self-similar sets and tilings. In fact, generator type formulas are obtained for essentially all self-similar sets, when suitable volume functions (and curvature functions, respectively) related to the generator are used. We also strengthen known results on the Minkowski measurability of self-similar sets, in particular on the question of non-measurability in the lattice case.     

On lower bounds for cohomology growth in p-adic analytic towers

Let \(p\) and \(\ell \) be two distinct prime numbers and let \(\Gamma \) be a group. We study the asymptotic behaviour of the mod- \(\ell \) Betti numbers in \(p\) -adic analytic towers of finite index subgroups. If \(\Theta \) is a finite \(\ell \) -group of automorphisms of \(\Gamma \) , our main theorem allows to lift lower bounds for the mod- \(\ell \) cohomology growth in the fixed point group \(\Gamma ^\Theta \) to lower bounds for the growth in \(\Gamma \) . We give applications to \(S\) -arithmetic groups and we also obtain a similar result for cohomology with rational coefficients.     

QUANTIS: Data quality assessment tool by clustering analysis

Automatically generated kinetic networks are ideally validated against a large set of accurate, reproducible, and easy-to-model experimental data. However, although this might seem simple, it proves to be quite challenging. QUANTIS, a publicly available Python package, is specifically developed to evaluate both the precision and accuracy of experimental data and to ensure a uniform, quick processing, and storage strategy that enables automated comparison of developed kinetic models. The precision is investigated with two clustering techniques, PCA and t-SNE, whereas the accuracy is probed with checks for the conservation laws. First, the developed tool processes, evaluates, and stores experimental yield data automatically. All data belonging to a given experiment, both unprocessed and processed, are stored in the form of an HDF5 container. The demonstration of QUANTIS on three different pyrolysis cases showed that it can help in identifying and overcoming instabilities in experimental datasets, reduce mass and molar balance closure discrepancies, and, by evaluating the visualized correlation matrices, increase understanding in the underlying reaction pathways. Inclusion of all experimental data in the HDF5 file makes it possible to automate simulating the experiment with CHEMKIN. Because of the employed InChI string identifiers for molecules, it is possible to automate the comparison experiment/simulation. QUANTIS and the concepts demonstrated therein is a potentially useful tool for data quality assessment, kinetic model validation, and refinement.     

Synthesis,Crystal Structure and Properties of Na2MnO2

Na₂MnO₂ was prepared via the azide/nitrate route. Stoichiometric mixtures of the precursors (Mn₂O₃, NaN₃ and NaNO₃) were heated in an appropriate regime up to 390 °C and annealed at this temperature for 20 h, in specially designed silver containers. As the most prominent feature, the crystal structure of Na₂MnO₂ (C2/c, Z = 12, a = 12.5026(9), b = 12.1006(9), c = 6.0939(4) Å, β = 117.94(0)°, 1556 independent reflections, R₁ = 3.83 % (all data)) forms a three dimensional framework polyanion of corner sharing MnO₄‐tetrahedra. The connectivity pattern of the tetrahedral building units corresponds to the moganite structure, a rare SiO₂ modification. According to measurements of the magnetic susceptibility in the temperature range from 2 to 750 K, Na₂MnO₂ shows antiferromagnetic ordering below 250 K. Evaluation of the high temperature data employing the Curie‐Weiss law revealed a magnetic moment of μ_eff = 5.93 μ_B, confirming the presence of divalent manganese.