نتایج جستجو برای: s weak
تعداد نتایج: 837826 فیلتر نتایج به سال:
In this paper, we study a generalization of z-ideals in the ring C(X) of continuous real valued functions on a completely regular Hausdorff space X. The notion of a weak ideal and naturally a weak z-ideal and a prime weak ideal are introduced and it turns out that they behave such as z-ideals in C(X).
Non-statistical weak measurements yield weak values that are outside the range of eigenvalues and are not rare, suggesting that weak values are a property of every preand-post-selected ensemble. They also extend the applicability and valid regime of weak values.
in this paper, the notion of injectivity with respect to order dense embeddings in the category of $s$-posets, posets with a monotone action of a pomonoid $s$ on them, is studied. we give a criterion, like the baer condition for injectivity of modules, or skornjakov criterion for injectivity of $s$-sets, for the order dense injectivity. also, we consider such injectivit...
In this paper, the notion of injectivity with respect to order dense embeddings in the category of $S$-posets, posets with a monotone action of a pomonoid $S$ on them, is studied. We give a criterion, like the Baer condition for injectivity of modules, or Skornjakov criterion for injectivity of $S$-sets, for the order dense injectivity. Also, we consider such injectivit...
The linear discrepancy of a poset P is the least k such that there is a linear extension L of P such that if x and y are incomparable, then |hL(x)− hL(y)| ≤ k. Whereas the weak discrepancy is the least k such that there is a weak extension W of P such that if x and y are incomparable, then |hW (x)− hW (y)| ≤ k. This paper resolves a question of Tanenbaum, Trenk, and Fishburn on characterizing w...
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed graph satisfying the weak gap property has O(n) edges and total weight O(log n) · wt(MST (S)), where wt(MST (S)) denotes the weight of a minimum spanning tree of S. We show that 2-optimal TSP tours and greedy spanners sa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید