On Sizes of 1-Cross Intersecting Set Pair Systems

Siberian Mathematical Journal - Let $ \{(A_{i},B_{i})\}_{i=1}^{m} $ be a set pair system. Füredi, Gyárfás, and Király called it $ 1 $ -cross intersecting if $...     

On the Standard Conjecture for Compactifications of Néron Models of Three-Dimensional Abelian Varieties with Multiplications in an Imaginary Quadratic Field

Mathematical Notes -     

Investigation of Thermal Gradient Mechanical Fatigue Test Methods for Nickel-based Superalloys

Experimental Mechanics - Temperature gradients significantly affect the material fatigue process. A reliable and robust test procedure is needed for quantifying the effects of temperature gradients...     

Advances in the computational analysis of SARS-COV2 genome

Nonlinear Dynamics - Given a data-set of Ribonucleic acid (RNA) sequences we can infer the phylogenetics of the samples and tackle the information for scientific purposes. Based on current data and...     

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...     

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.     

Mesomorphism of Dichotomous Compounds; X-Ray Diffraction Analysis of 4-Chlorophenyl Hexadecyl Ether

Crystallography Reports - The crystal and molecular structures of Cl–C6H4–O–C16H33 (I) have been studied, and its differential scanning calorimetry (DSC) study is performed....     

Superquantiles at Work: Machine Learning Applications and Efficient Subgradient Computation

Set-Valued and Variational Analysis - R. Tyrell Rockafellar and his collaborators introduced, in a series of works, new regression modeling methods based on the notion of superquantile (or...     

Correction to: Impact of leg bending in the patient-specific computational fluid dynamics of popliteal stenting

Acta Mechanica Sinica - A Correction to this paper has been published: https://doi.org/10.1007/s10409-021-01066-2     

Crystallographic Parameters of Special Grain Boundaries in Multicrystalline Silicon

Crystallography Reports - The orientation of grains and the special boundaries formed by them in multicrystalline silicon has been studied by electron backscattered diffraction. It is found that...