Sentence examples for minimal elements in from inspiring English sources

Then, an incremental manner is employed to update minimal elements in the discernibility matrix at the arrival of an incremental sample.

In this work we present a characterization to the existence of minimal elements in partially ordered sets in terms of fixed point of multivalued maps, see [2].

Note that if there are more than one minimal elements in Δ Lcur, the element with lowest POI label number will be selected.

The mapping F has the maximal and the minimal elements in (D_{1} = [beta I,(I - sum_{i = 1}^{m} A_{i}^A_{i})^{frac{1}{r}} ]), where β is given in Theorem  3.2.

The minimal elements in the chains above satisfy that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$U_k\cap W_l{^{\prime }}\in C(T \cap C(T{^{\prime }})$$\end{document} U k ∩ W l ′ ∈ C (T ) ∩ C (T ′ ).

Since x ∗ is a minimal element in ( V ( G ) ε 0, ≺ ∗ ), we get x = x ∗.

Since x ¯ is minimal element in S ( x 0 ), y 0 = x ¯.

Obviously, (mathbb{T}_{0*}neqemptyset) implies that (mathbb{T}_{0*}) is the minimal element in the family of sets (mathscr{C}).

Since, we can replace by in the above assertions to obtain a minimal element in the sense, where ia defined here as (2.3).

Similarly, we can prove that F has a minimal element in (D_{1}), noting that F is bounded below by the zero matrix.

Then, for each x ∈ X, S ( x ) has a minimal element in S ( x ), where S ( x ) = { y ∈ X : y ⊑ x }.