Carrier envelope phase stabilization of a Yb:KGW laser amplifier

In this paper we report on the active stabilization of the carrier envelope phase (CEP) of a Yb:KGW chirped pulse amplifier laser system seeded by a Yb-doped solid-state Kerr-lens mode-locked oscillator. The regenerative amplifier delivers 180 fs CEP stable pulses of 30 μJ-1 mJ energy at a repetition rate tunable from 1 to 200 kHz. The bandwidth of the feedback loop was extended by a factor of 5 using a specially designed high-pass filter, which resulted in a dramatic decrease of CEP jitter below 0.45 rad after the amplifier.     

Phase diagrams of the mixed spin-1 and spin-1/2 Ising-Heisenberg model on the diamond-like decorated Bethe lattice

The ground-state and finite-temperature behavior of the mixed spin-1 and spin-1/2 Ising-Heisenberg model on the diamond-like decorated Bethe lattice is investigated within the framework of two rigorous methods: the decoration-iteration transformation and exact recursion relations. The model under consideration describes a hybrid classical-quantum system consisting of the Ising and Heisenberg spins, which interact among themselves either through the Ising or XXZ Heisenberg nearest-neighbor interaction. Both sublattice magnetizations of the Ising and Heisenberg spins are exactly calculated with the aim to examine phase diagrams, thermal variations of the total and sublattice magnetizations. The finite-temperature phase diagrams form continuous (second-order) phase transition lines only, which exhibit a small reentrant region if the diamond-like decorated Bethe lattice with a sufficiently high coordination number is considered.     

Singular densities,test particles and generalized Hamiltonian systems in general relativity

We derive the motion equations and the structure equations of neutral and charged test particles, starting from the gravitational field equations. The method consists in the application of conservation laws to singular tensor densities, which represent regions of strong matter concentration. Moreover, a Hamiltonian formulation of the particle equations is given, in the form of implicit differential equations generated by Hamiltonian Morse families.     

The fekete-szegö problem for close-to-convex functions with respect to the koebe function

An analytic function f   in the unit disk D :={z ∈ ? : |z| < 1}$\mathbb{D}\hspace{0.17em}:=\left\{z\hspace{0.17em}\in \hspace{0.17em}?\hspace{0.17em}:\hspace{0.17em}\left|z\right|\hspace{0.17em}<\hspace{0.17em}1\right\}$, standardly normalized, is called close-to-convex with respect to the Koebe function k(z) := z/(1−z)², z ∈ D$k\left(z\right)\hspace{0.17em}:=\hspace{0.17em}z/{\left(1-z\right)}^2,\hspace{0.17em}z\hspace{0.17em}\in \hspace{0.17em}\mathbb{D}$ if there exists δ∈(-π/2,π/2) such that Re{eiδ(1−z)²f^′(z)} > 0, ∈ D$\text{Re}\left\{{\text{e}}^{\text{i}\delta }{\left(1-z\right)}^2{f}^{\prime }\left(z\right)\right\}\hspace{0.17em}>\hspace{0.17em}0,\hspace{0.17em}\in \hspace{0.17em}\mathbb{D}$. For the class C(k) of all close-to-convex functions with respect to k, related to the class of functions convex in the positive direction of the imaginary axis, the Fekete-Szegö problem is studied.     

Isomorphic scheduling problems

We consider general properties of isomorphic scheduling problems that constitute a new class of pairs of mutually related scheduling problems. Any such a pair is composed of a scheduling problem with fixed job processing times and its time-dependent counterpart with processing times that are proportional-linear functions of the job starting times. In order to introduce the class formally, first we formulate a generic scheduling problem with fixed job processing times and define isomorphic problems by a one-to-one transformation of instances of the generic problem into instances of time-dependent scheduling problems with proportional-linear job processing times. Next, we prove basic properties of isomorphic scheduling problems and show how to convert polynomial algorithms for scheduling problems with fixed job processing times into polynomial algorithms for proportional-linear counterparts of the original problems. Finally, we show how are related approximation algorithms for isomorphic problems. Applying the results, we establish new worst-case results for time-dependent parallel-machine scheduling problems and prove that many single- and dedicated-machine time-dependent scheduling problems with proportional-linear job processing times are polynomially solvable.     

Total Vertex Irregularity Strength of Dense Graphs

Consider a graph of minimum degree δ and order n. Its total vertex irregularity strength is the smallest integer k for which one can find a weighting such that for every pair of vertices of G. We prove that the total vertex irregularity strength of graphs with is bounded from above by . One of the cornerstones of the proof is a random ordering of the vertices generated by order statistics.     

Embeddable quantum homogeneous spaces

We discuss various notions generalizing the concept of a homogeneous space to the setting of locally compact quantum groups. On the von Neumann algebra level we recall an interesting duality for such objects studied earlier by M. Izumi, R. Longo, S. Popa for compact Kac algebras and by M. Enock in the general case of locally compact quantum groups. A definition of a quantum homogeneous space is proposed along the lines of the pioneering work of Vaes on induction and imprimitivity for locally compact quantum groups. The concept of an embeddable quantum homogeneous space is selected and discussed in detail as it seems to be the natural candidate for the quantum analog of classical homogeneous spaces. Among various examples we single out the quantum analog of the quotient of the Cartesian product of a quantum group with itself by the diagonal subgroup, analogs of quotients by compact subgroups as well as quantum analogs of trivial principal bundles. The former turns out to be an interesting application of the duality mentioned above.     

Quasi-Banach spaces of almost universal disposition

We show that for each p∈(0,1]$p\in (0,1]$ there exists a separable p  -Banach space _Gp${\mathbb{G}}_p$ of almost universal disposition, that is, having the following extension property: for each ε>0$\epsilon >0$ and each isometric embedding g:X→Y$g:X\to Y$, where Y is a finite-dimensional p-Banach space and X   is a subspace of _Gp${\mathbb{G}}_p$, there is an ε  -isometry f:Y→_Gp$f:Y\to {\mathbb{G}}_p$ such that x=f(g(x))$x=f(g(x))$ for all x∈X$x\in X$.