On subgame perfect equilibria in quantum Stackelberg duopoly with incomplete information

The Li–Du–Massar quantum duopoly model is one of the generally accepted quantum game schemes. It has applications in a wide range of duopoly problems. Our purpose is to study Stackelberg's duopoly with incomplete information in the quantum domain. The result of Lo and Kiang has shown that the correlation of players' quantities caused by the quantum entanglement enhances the first-mover advantage in the game. Our work demonstrates that there is no first-mover advantage if the players' actions are maximally correlated. Furthermore, we proved that the second mover gains a higher equilibrium payoff than the first one.     

Non-singular space-times with a negative cosmological constant: V. Boson stars

We prove existence of large families of solutions of Einstein-complex scalar field equations with a negative cosmological constant, with a stationary or static metric and a time-periodic complex scalar field.     

On exactness and isoperimetric profiles of discrete groups

We introduce a quasi-isometry invariant related to Property A and explore its connections to various other invariants of finitely generated groups. This allows to establish a direct relation between asymptotic dimension on one hand and isoperimetry and random walks on the other. We apply these results to reprove sharp estimates on isoperimetric profiles of some groups and to answer some questions in dimension theory.     

On a nonoverlapping additive Schwarz method for h‐p discontinuous Galerkin discretization of elliptic problems

The condition number of a discontinuous Galerkin finite element discretization preconditioned with a nonoverlapping additive Schwarz method is analyzed. We improve the result of Antonietti and Houston (J Sci Comput 46 (2011), 124–149), where a bound has been proved for a two‐level nonoverlapping additive Schwarz method with coarse problem using polynomials of degree on a coarse mesh size . In a more general framework, where the concurrency of the algorithm is increased by applying solvers on subdomains smaller than the coarse grid cells, we prove that the condition number of the preconditioned system is where is the coarse space element degree polynomial and is the size of subdomain where local problems are solved in parallel. Our result also extends to the case of discontinuous coefficient, piecewise constant on the coarse grid, for a composite continuous–discontinuous Galerkin discretization. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1572–1590, 2016     

SHAH: SHape-Adaptive Haar Wavelets for Image Processing

We propose the shape-adaptive Haar (SHAH) transform for images, which results in an orthonormal, adaptive decomposition of the image into Haar-wavelet-like components, arranged hierarchically according to decreasing importance, whose shapes reflect the features present in the image. The decomposition is as sparse as it can be for piecewise-constant images. It is performed via a stepwise bottom-up algorithm with quadratic computational complexity; however, nearly linear variants also exist. SHAH is rapidly invertible. We show how to use SHAH for image denoising. Having performed the SHAH transform, the coefficients are hard- or soft-thresholded, and the inverse transform taken. The SHAH image denoising algorithm compares favorably to the state of the art for piecewise-constant images. A clear asset of the methodology is its very general scope: it can be used with any images or more generally with any data that can be represented as graphs or networks.     

On α-Limit Sets in Lorenz Maps

The aim of this paper is to show that α-limit sets in Lorenz maps do not have to be completely invariant. This highlights unexpected dynamical behavior in these maps, showing gaps existing in the literature. Similar result is obtained for unimodal maps on [0,1]. On the basis of provided examples, we also present how the performed study on the structure of α-limit sets is closely connected with the calculation of the topological entropy.     

The location of the zeros of the higher order derivatives of a polynomial

Let be a complex polynomial of degree having zeros in a disk . We deal with the problem of finding the smallest concentric disk containing zeros of . We obtain some estimates on the radius of this disk in general as well as in the special case, where zeros in are isolated from the other zeros of . We indicate an application to the root-finding algorithms.

     

Multi-dimensional scalar balance laws with discontinuous flux

We consider scalar balance laws with a dissipative source term. The flux function may be discontinuous with respect to both the space variable x and the unknown quantity u. We formulate the definition of entropy weak solutions and provide existence and uniqueness to the considered problem. The problem is formulated in the framework of multi-valued mappings. The notion of entropy measure-valued solutions is used to prove the so-called contraction principle and comparison principle.     

Isoperimetric Inequalities and Imbedding Theorems in Irregular Domains

The paper proves several weighted imbedding theorems for domainswith fractal boundaries. The weights considered are distancesto the boundary to certain powers, and the domains are so-calleds-John domains. The paper also proves, in the general setting,that the existence of an imbedding implies compactness of theimbedding for lower exponents. Moreover, following Maz'ya, thepaper reformulates the imbedding theorems in the language oflocal isoperimetric and capacity estimates.