A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

Dynamic analysis of the double crank mechanism with a 3D translational clearance joint employing a variable stiffness contact force model

Nonlinear Dynamics - Oblique collisions are more likely to happen in the realistic translational joint with clearance, compared to the full front impacts. It can be a quite demanding task to...     

A New Radar-Signal Parameter for Recognition of Wind-Related Weather Hazards

Radiophysics and Quantum Electronics - Wind-related weather hazards remain difficult to recognize targets for weather radars. Methods that use estimates of the width of the reflected-signal...     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.     

Optical Multisensor Systems in Analytical Spectroscopy

Journal of Analytical Chemistry - A review of works in developing optical multisensor systems, a new class of specialized spectroscopic analyzers, is presented. The development and use of such...     

Asymptotic Behavior of Least Energy Solutions for a Fractional Laplacian Eigenvalue Problem on ℝN

Acta Mathematica Sinica, English Series - We are interested in the existence and asymptotic behavior for the least energy solutions of the following fractional eigenvalue problem $$\left({\rm{P}}...     

Numerical Simulation of Physical Fields by the Collocation Method

Russian Physics Journal - The article describes the collocation method for the numerical solution of mathematical physics boundary value problems. By arranging the collocation nodes in a special...