We obtain factorized domain wall partition functions for two sets of trigonometric vertex models: 1. The N-state Deguchi-Akutsu models, for N ∈ {2, 3, 4} (and conjecture the result for all N ≥ 5), and 2. The sl(r+1|s+1) Perk-Schultz models, for {r, s ∈ N}, where (given the symmetries of these models) the result is independent of {r, s}. 0. Introduction Domain wall partition functions (DWPF’s) w...

Double sampling plan is an examination with a certain parameter, so it cannot decide about manufactured products whose portion parameter ( ) is not certain. The main goal of this survey is to introduce double variable plan when  is indefinite to examine manufacturing products when concerned characteristics are normally distributed. Plan parameters are achieved by an optimization manner. Sum of ...

A simple algorithm is presented for evaluating scattering parameters of a two-port network. This technique uses the indefinite admittance matrix to calculate scattering or any other desired set of two-port parameters.

It is shown that a Hirzebruch surface admits a Kähler metric (possibly indefinite) of constant scalar curvature if and only if its degree equals zero. There have been many extensive studies for positive-definite Kähler metrics of constant scalar curvature, especially, Kähler Einstein metrics and scalar-flat Kähler metrics, on existence, uniqueness, obstructions, and relationships with other not...

In this paper, we show that the calibrated method can also be used to detect indefinite minimal Lagrangian submanifolds in C k . We introduce the notion of indefinite special Lagrangian submanifolds in C k and generalize the well-known work of Harvey-Lawson to the indefinite case.

In this paper we investigate several properties of indefinite Kähler manifold of complex dimension n (n > 2) with the Krupka-type curvature tensor, and present several classes of indefinite complex submanifolds of an indefinite complex space form. M.S.C. 2010: 53C40, 53C25.

In this paper, a descent line search scheme is proposed to find local minimum point of non-convex optimization problem with simple constraints. The idea ensures that the escapes saddle points and finally settles for problem. A positive definite scaling matrix formed through symmetric indefinite factorization Hessian objective function at each iteration. numerical illustration provided, global c...