نتایج جستجو برای: ordered entry
تعداد نتایج: 122054 فیلتر نتایج به سال:
First, a quick review of intervals. We define the following four cases: • The closed interval [a, b] = {t : a ≤ t ≤ b}; The half-open interval (a, b] = {t : a < t ≤ b}; • The half-open interval [a, b) = {t : a ≤ t < b}; The open interval (a, b) = {t : a < t < b}. If a or b is ±∞, use a half-open or open interval. Never write (even implicitly) “t = ∞”–this is uncouth! Now let x(t) be a continuou...
We give an involution on the set of lattice paths from (0, 0) to (a, b) with steps N = (0, 1) and E = (1, 0) that lie between two boundaries T and B, which proves that the statistics ‘number of E steps shared with T ’ and ‘number of E steps shared with B’ have a symmetric joint distribution on this set. This generalizes a result of Deutsch for the case of Dyck paths.
Consider an interval I ⊆ Q . Set S(I) = {m ∈ N : ∃ n ∈ N , mn ∈ I}. This turns out to be a numerical semigroup, and has been the subject of considerable recent investigation (see Chapter 4 of [2] for an introduction). Special cases include modular numerical semigroups (see [4]) where I = [mn , m n−1 ] (m,n ∈ N ), proportionally modular numerical semigroups (see [3]) where I = [mn , m n−s ] (m,n...
and Applied Analysis 3 (a, b), and let g(x) ̸ = 0 on (a, b). If f(x)/g(x) is increasing (decreasing) on (a, b), then so are f (x) − f (a) g (x) − g (a) , f (x) − f (b) g (x) − g (b) . (11) If f(x)/g(x) is strictly monotone, then the monotonicity in the conclusion is also strict. Lemma 6 (see [11, Lemma 1.1]). Suppose that the power series f(x) = ∑ ∞ n=0 a n x n and g(x) = ∑∞ n=0 b n x n hav...
In [1], Agarwal & Andrews studied partitions with "a copies of a," and in [2], Agarwal & Mullen studied partitions with "d(a) copies of a" (where d is the divisor function). In this note, partitions with "M(a) copies of a" are considered; the maximum exponent function, M, is defined by M(a) = max(e l5. .. , e T) if the integer a > 1 has canonical prime-power form a = p^ 1 ... p &r , and Af(l) =...
In a biased weak (a, b) polyform achievement game, the maker and the breaker alternately mark a, b previously unmarked cells on an infinite board, respectively. The maker’s goal is to mark a set of cells congruent to a polyform. The breaker tries to prevent the maker from achieving this goal. A winning maker strategy for the (a, b) game can be built from winning strategies for games involving f...
Consider the set S of points in the plane consisting of the ordered pairs (i, j), where 1 6 i 6 m and 1 6 j 6 n. A problem related to the study of segmentation evaluation of visual images concerns finding a permutation σ of the points of S for which the sum
1. Introducing the birank. A partition is defined as being a nonincreasing sequence of positive integers, λ = (λ1,λ2, . . . ,λr ). The set of all partitions, which includes the empty partition ∅, is denoted by . The sum of the parts of a given partition is called the weight of the partition, wt(λ) = λ1+λ2+···+λr . It is standard notation to write (z;q)∞ := ∏ t≥0(1−zq) and p−k(n) for the coeffic...
R l definable in R such that F (t) = G(t, F (t)) for all t ∈ (a, b) and each component function Gi : R 1+l → R is independent of the last l− i variables (i = 1, . . . , l). If R is o-minimal and F : (a, b) → R is R-Pfaffian, then (R, F ) is o-minimal (Proposition 7). We say that F : R → R is ultimately R-Pfaffian if there exists r ∈ R such that the restriction F ↾(r,∞) is R-Pfaffian. (In genera...
In this paper, the new concept of near PS-compactness in L-topological spaces is introduced. It is defined for any L-subset. Its characterizations and topological properties are systematically studied. And the relationship is exposed between near PScompactness and PS-compactness, and also fuzzy compactness. 2003 Elsevier Inc. All rights reserved.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید