Behavior of Andreev states for topological phase transition

Theoretical and Mathematical Physics - We consider three one-dimensional superconducting structures: 1) the one with $$p$$ -wave superconductivity; 2) the main experimental model of a nanowire with...     

Well-posedness of two pseudo-parabolic problems for electrical conduction in heterogeneous media

We prove a well-posedness result for two pseudo-parabolic problems, which can be seen as two models for the same electrical conduction phenomenon in heterogeneous media, neglecting the magnetic field. One of the problems is the concentration limit of the other one, when the thickness of the dielectric inclusions goes to zero. The concentrated problem involves a transmission condition through interfaces, which is mediated by a suitable Laplace-Beltrami type equation.     

Investigation of Relationships between Grain Structure and Inhomogeneous Deformation by Means of Laboratory-Based Multimodal X-Ray Tomography: Strain Accuracy Analysis

Experimental Mechanics - The internal strain distribution developing during plastic deformation is important for understanding the mechanical properties of polycrystalline materials. Such...     

基于不确定控制理论的最优策略研究

本文在不确定理论的框架下,研究一类带背景状态变量的最优控制模型.在乐观值准则下,利用不确定动态规划的方法,证明了不确定最优性原则,得到最优性方程.作为应用,求解一个固定缴费(DC)型养老金的最优投资策略问题,在乐观值准则下,以工资变量为背景状态变量,建立养老金模型.通过求解不确定最优性方程得到最优投资策略和最优支付率.     

Prospects for Solving the Muon Puzzle on the NEVOD-DECOR-TREK Complex

Physics of Atomic Nuclei - The muon puzzle is an excess of muon bundles generated by primary cosmic rays (PCR) at energies above 10 $${}^{17}$$ eV compared to estimations that assume even a heavy...     

Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis

Numerical Algorithms - In this paper, the block generalized product-type bi-conjugate gradient (GPBi-CG) method for solving large, sparse nonsymmetric linear systems of equations with multiple...     

Some Properties of Lattice Ordered Rings

Mathematical Notes -     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.