Results 31 to 40 of about 1,487,617 (328)

Generalized Drinfeld-Sokolov Reductions and KdV Type Hierarchies [PDF]

open access: yes, 1992
Generalized Drinfeld-Sokolov (DS) hierarchies are constructed through local reductions of Hamiltonian flows generated by monodromy invariants on the dual of a loop algebra.
A.B. Zamolodchikov   +39 more
core   +3 more sources

Gap-labelling conjecture with nonzero magnetic field [PDF]

open access: yes, 2017
Given a constant magnetic field on Euclidean space ${\mathbb R}^p$ determined by a skew-symmetric $(p\times p)$ matrix $\Theta$, and a ${\mathbb Z}^p$-invariant probability measure $\mu$ on the disorder set $\Sigma$ which is by hypothesis a Cantor set ...
Benameur, Moulay Tahar, Mathai, Varghese
core   +3 more sources

Dynamics of competitive systems with a single common limiting factor

open access: yesMathematical Biosciences and Engineering, 2014
The concept of limiting factors (or regulating factors) succeeded in formulating the well-known principle of competitive exclusion.This paper shows that the concept of limiting factors is helpful not only to formulate the competitive exclusion principle,
Ryusuke Kon
doaj   +1 more source

Interfacial Aspects of Metal Matrix Composites Prepared from Liquid Metals and Aqueous Solutions: A Review

open access: yesMetals, 2020
The paper reviews the preparation of the different metallic nanocomposites. In the preparation of composites, especially in the case of nanocomposites, interfacial phenomena play an important role.
Peter Baumli
doaj   +1 more source

P-matrix completions under weak symmetry assumptions

open access: yesLinear Algebra and its Applications, 2000
AbstractAn n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix.In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove
Juan R. Torregrosa   +3 more
openaire   +2 more sources

The Nonsymmetric Flavor Transition Matrix and the Apparent P Violation

open access: yesAdvances in High Energy Physics, 2022
The leptonic mixing parameters of high precision and the next-generation neutrino telescopes make it possible to test new physics in the flavor transition of the high-energy astrophysical neutrinos (HAN).
Shu-Jun Rong, Ding-Hui Xu
doaj   +1 more source

Error bounds for the linear complementarity problem with a P-matrix

open access: yesLinear Algebra and its Applications, 1990
AbstractWe introduce a fundamental quantity associated with a P-matrix and show how this quantity is useful in deriving error bounds for the linear complementarity problem of the P-type. We also obtain (upper and lower) bounds for the quantity introduced.
Jong-Shi Pang, Roy Mathias
openaire   +2 more sources

The P-matrix and a matching radius model for pion-hadron scattering [PDF]

open access: yesPhysics Letters B, 1986
Abstract A matching radius model of pion-hadron scattering is developed by assuming the continuity of the axial current. This model is applied to the simplified situation of a pion scattering off a static empty bag to study the relationship between P -matrix poles and the bag model primitives.
M.J. Iqbal, Byron K. Jennings
openaire   +2 more sources

On the Burer-Monteiro method for general semidefinite programs

open access: yes, 2020
Consider a semidefinite program (SDP) involving an $n\times n$ positive semidefinite matrix $X$. The Burer-Monteiro method uses the substitution $X=Y Y^T$ to obtain a nonconvex optimization problem in terms of an $n\times p$ matrix $Y$.
Cifuentes, Diego
core   +1 more source

Nörlund Matrix Domain on Sequence Spaces of p-adic Numbers [PDF]

open access: yesEurasian Journal of Science and Engineering, 2018
In this paper, we introduce some new sequence spaces p-adic numbers l∞(p) (Nt), c(p)(Nt) and c0(p)(Nt) as Nörlund matrix domain in the sequence spaces l∞(p) , c(p) and c0(p), respectively.
Orhan Tuğ
doaj   +1 more source

Home - About - Disclaimer - Privacy