首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 171 毫秒
1.
A mapping ƒ : n=1InI is called a bag mapping having the self-identity if for every (x1,…,xn) ε i=1In we have (1) ƒ(x1,…,xn) = ƒ(xi1,…,xin) for any arrangement (i1,…,in) of {1,…,n}; monotonic; (3) ƒ(x1,…,xn, ƒ(x1,…,xn)) = ƒ(x1,…,xn). Let {ωi,n : I = 1,…,n;n = 1,2,…} be a family of non-negative real numbers satisfying Σi=1nωi,n = 1 for every n. Then one calls the mapping ƒ : i=1InI defined as follows an OWA bag mapping: for every (x1,…,xn) ε i=1In, ƒ(x1,…,xn) = Σi=1nωi,nyi, where yi is the it largest element in the set {x1,…,xn}. In this paper, we give a sufficient and necessary condition for an OWA bag mapping having the self-identity.  相似文献   

2.
Let H be a Hopf algebra over a field k and let H AA, h ah.a, be an action of H on a commutative local Noetherian kalgebra (A, m). We say that this action is linearizable if there exists a minimal system x1, …, xn of generators of the maximal ideal m such that h.xi ε kx1 + …+ kxn for all h ε H and i = 1, …, n. In the paper we prove that the actions from a certain class are linearizable (see Theorem 4), and we indicate some consequences of this fact.  相似文献   

3.
Let A = A0A1 be a commutative graded ring such that (i) A0 = k a field, (ii) A = k[A1] and (iii) dimk A1 < ∞. It is well known that the formal power series ∑n = 0 (dimkAnn is of the form (h0 + h1λ + + hsλs)/(1 − λ)dimA with each hiε . We are interested in the sequence (h0, h1,…,hs), called the h-vector of A, when A is a Cohen–Macaulay integral domain. In this paper, after summarizing fundamental results (Section 1), we study h-vectors of certain Gorenstein domains (Section 2) and find some examples of h-vectors arising from integrally closed level domains (Sections 3 and 4).  相似文献   

4.
In this paper we study the existence, the uniqueness, the boundedness and the asymptotic behavior of the positive solutions of the fuzzy difference equation xn+1=∑i=0kAi/xnipi, where k{1,2,…,}, Ai, i{0,1,…,k}, are positive fuzzy numbers, pi, i{0,1,…,k}, are positive constants and xi, i{−k,−k+1,…,0}, are positive fuzzy numbers.  相似文献   

5.
Let C1,…, Cn and C1,…, Cn be two collections of equal disks in the plane, with centers c1,…, cn and c1,…, cn. According to a well-known conjecture of Klee and Wagon (1991), if |cicj| ≥ |cicj| for all i, j, then Area(∩i Ci) ≤ Area(∩i Ci).

We prove this statement in the special case when there is a continuous contraction of {c1,…, cn} onto {c1,…, cn}.  相似文献   


6.
For an integer n3, the crown Sn0 is defined to be the graph with vertex set {x0,x1,…,xn−1,y0,y1,…,yn−1} and edge set {xiyj: 0i,jn−1, ij}. In this paper we give some sufficient conditions for the edge decomposition of the crown into isomorphic cycles.  相似文献   

7.
For a 1-dependent stationary sequence {Xn} we first show that if u satisfies p1=p1(u)=P(X1>u)0.025 and n>3 is such that 88np131, then
P{max(X1,…,Xn)u}=ν·μn+O{p13(88n(1+124np13)+561)}, n>3,
where
ν=1−p2+2p3−3p4+p12+6p22−6p1p2,μ=(1+p1p2+p3p4+2p12+3p22−5p1p2)−1
with
pk=pk(u)=P{min(X1,…,Xk)>u}, k1
and
|O(x)||x|.
From this result we deduce, for a stationary T-dependent process with a.s. continuous path {Ys}, a similar, in terms of P{max0skTYs<u}, k=1,2 formula for P{max0stYsu}, t>3T and apply this formula to the process Ys=W(s+1)−W(s), s0, where {W(s)} is the Wiener process. We then obtain numerical estimations of the above probabilities.  相似文献   

8.
Let (X1, Y1), (X2, Y2),…, (Xn, Yn) be a random sample from a bivariate distribution function F which is in the domain of attraction of a bivariate extreme value distribution function G. This G is characterized by the extreme value indices and its spectral measure or angular measure. The extreme value indices determine both the marginals and the spectral measure determines the dependence structure. In this paper, we construct an empirical measure, based on the sample, which is a consistent estimator of the spectral measure. We also show for positive extreme value indices the asymptotic normality of the estimator under a suitable 2nd order strengthening of the bivariate domain of attraction condition.  相似文献   

9.
The following theorem is proved. If the sets and a εn+1i=1 conv Vi, then there exist elements vi ε Vi (i=1…,n+1) such that a ε conv{v1,…,vn+1}. This is generalization of Carathéodory's theorem. By applying this and similar results some open questions are answered.  相似文献   

10.
An up–down permutation P=(p1,p2,…,pn) is a permutation of the integers 1 to n which satisfies constraints specified by a sequence C=(c1,c2,…,cn−1) of U's and D's of length n−1. If ci is U then pi<pi+1 otherwise pi−1>pi. A loopless algorithm is developed for generating all the up–down permutations satisfying any sequence C. Ranking and unranking algorithms are discussed.  相似文献   

11.
Let X1, X2, …, Xn be i.i.d. d-dimensional random vectors with a continuous density. Let and . In this paper we find that the distribution of Zk (or Yk) can be used for characterizing multivariate normal distribution. This characterization can be employed for testing multivariate normality in terms of the so-called transformation method.  相似文献   

12.
We have considered the problem of the weak convergence, as tends to zero, of the multiple integral processes
in the space , where fL2([0,T]n) is a given function, and {η(t)}>0 is a family of stochastic processes with absolutely continuous paths that converges weakly to the Brownian motion. In view of the known results when n2 and f(t1,…,tn)=1{t1<t2<<tn}, we cannot expect that these multiple integrals converge to the multiple Itô–Wiener integral of f, because the quadratic variations of the η are null. We have obtained the existence of the limit for any {η}, when f is given by a multimeasure, and under some conditions on {η} when f is a continuous function and when f(t1,…,tn)=f1(t1)fn(tn)1{t1<t2<<tn}, with fiL2([0,T]) for any i=1,…,n. In all these cases the limit process is the multiple Stratonovich integral of the function f.  相似文献   

13.
Xiaoyun Lu 《Discrete Mathematics》1992,110(1-3):197-203
There is a so called generalized tic-tac-toe game playing on a finite set X with winning sets A1, A2,…, Am. Two players, F and S, take in turn a previous untaken vertex of X, with F going first. The one who takes all the vertices of some winning set first wins the game. Erd s and Selfridge proved that if |A1|=|A2|==|Am|=n and m<2n−1, then the game is a draw. This result is best possible in the sense that once m=2n−1, then there is a family A1, A2,…, Am so that F can win. In this paper we characterize all those sets A1,…, A2n−1 so that F can win in exactly n moves. We also get similar result in the biased games.  相似文献   

14.
Given \s{Xi, i 1\s} as non-stationary strong mixing (n.s.s.m.) sequence of random variables (r.v.'s) let, for 1 i n and some γ ε [0, 1],
F1(x)=γP(Xi<x)+(1-γ)P(Xix)
and
Ii(x)=γI(Xi<x)+(1-γ)I(Xix)
. For any real sequence \s{Ci\s} satisfying certain conditions, let
.

In this paper an exponential type of bound for P(Dn ), for any >0, and a rate for the almost sure convergence of Dn are obtained under strong mixing. These results generalize those of Singh (1975) for the independent and non-identically distributed sequence of r.v.'s to the case of strong mixing.  相似文献   


15.
Consider the following Itô stochastic differential equation dX(t) = ƒ(θ0, X(t)) dt + dW(t), where (W(t), t 0), is a standard Wiener process in RN. On the basis of discrete data 0 = t0 < t1 < …<tn = T; X(t1),...,X(tn) we would like to estimate the parameter θ0. We shall define the least squares estimator and show that under some regularity conditions, is strongly consistent.  相似文献   

16.
Length-bounded disjoint paths in planar graphs   总被引:1,自引:0,他引:1  
The following problem is considered: given: an undirected planar graph G=(V,E) embedded in , distinct pairs of vertices {r1,s1},…,{rk,sk} of G adjacent to the unbounded face, positive integers b1,…,bk and a function ; find: pairwise vertex-disjoint paths P1,…,Pk such that for each i=1,…,k, Pi is a risi-path and the sum of the l-length of all edges in Pi is at most bi. It is shown that the problem is NP-hard in the strong sense. A pseudo-polynomial-time algorithm is given for the case of k=2.  相似文献   

17.
If are maximal nests on a finite-dimensional Hilbert space H, the dimension of the intersection of the corresponding nest algebras is at least dim H. On the other hand, there are three maximal nests whose nest algebras intersect in the scalar operators. The dimension of the intersection of two nest algebras (corresponding to maximal nests) can be of any integer value from n to n(n+1)/2, where n=dim H. For any two maximal nests there exists a basis {f1,f2,…,fn} of H and a permutation π such that and where Mi=  span{f1,f2,…,fi} and Ni= span{fπ(1),fπ(2),…,fπ(i)}. The intersection of the corresponding nest algebras has minimum dimension, namely dim H, precisely when π(j)=nj+1,1jn. Those algebras which are upper-triangular matrix incidence algebras, relative to some basis, can be characterised as intersections of certain nest algebras.  相似文献   

18.
A (finite or infinite) graph G is strongly dismantlable if its vertices can be linearly ordered x0,…, x so that, for each ordinal β < , there exists a strictly increasing finite sequence (ij)0 j n of ordinals such that i0 = β, in = and xij+1 is adjacent with xij and with all neighbors of xij in the subgraph ofG induced by {xy: β γ }. We show that the Helly number for the geodesic convexity of such a graph equals its clique number. This generalizes a result of Bandelt and Mulder (1990) for dismantlable graphs. We also get an analogous equality dealing with infinite families of convex sets.  相似文献   

19.
Let S=(a1,...,am; b1,...,bn), where a1,...,am and b1,...,bn are two nonincreasing sequences of nonnegative integers. The pair S=(a1,...,am; b1,...,bn) is said to be a bigraphic pair if there is a simple bipartite graph G=(XY, E) such that a1,...,am and b1,...,bn are the degrees of the vertices in X and Y, respectively. Let Z3 be the cyclic group of order 3. Define σ(Z3, m, n) to be the minimum integer k such that every bigraphic pair S=(a1,...,am; b1,...,bn) with am, bn ≥ 2 and σ(S)=a1 +... + amk has a Z3-connected realization. For n=m, Yin[Discrete Math., 339, 2018-2026 (2016)] recently determined the values of σ(Z3, m, m) for m ≥ 4. In this paper, we completely determine the values of σ(Z3, m, n) for m n ≥ 4.  相似文献   

20.
If the edges of a graph G are colored using k colors, we consider the color distribution for this coloring a=(a1,a2,…,ak), in which ai denotes the number of edges of color i for i=1,2,…,k. We find inequalities and majorization conditions on color distributions of the complete bipartite graph Kn,n which guarantee the existence of multicolored subgraphs: in particular, multicolored forests and trees. We end with a conjecture on partitions of Kn,n into multicolored trees.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号