共查询到20条相似文献,搜索用时 31 毫秒
1.
Mohamed Ben Alaya Thierry Huillet 《Annals of the Institute of Statistical Mathematics》2005,57(4):817-831
With ?(p),p≥0 the Laplace-Stieltjes transform of some infinitely divisible probability distribution, we consider the solutions to the functional equation ?(p-e ?pβΠ i=1 m ?γi (c i p) for somem≥1,c i>0, γ i >0,i=1., …,m, β ε ®. We supply its complete solutions in terms of semistable distributions (the ones obtained whenm=1). We then show how to obtain these solutions as limit laws (r → ∞) of normalized Poisson sums of iid samples when the Poisson intensity λ(r) grows geometrically withr. 相似文献
2.
John A. Ewell 《Journal of Number Theory》1980,12(3):339-342
Starting with Euler's theorem that any odd perfect number n has the form n = pepi2ei … pk2ek, where p, p1,…,pk are distinct odd primes and p ≡ e ≡ 1 (mod 4), we show that extensive subsets of these numbers (so described) can be eliminated from consideration. A typical result says: if pe, pi2ei,…,pr2er are all of the prime-power divisors of such an n with p ≡ pi ≡ 1 (mod 4), then the ordered set {e1,…,er} contains an even number or odd number of odd numbers according as e ≡ pore ≡ p (mod 8). 相似文献
3.
Bounds are given for supinf∥Σpi=1νi∥, where sup is taken over all set systems V1,…, Vp of Rn with 0∈∩pi=1convVi and supv∈Vi∥ν∥?1 for i=1,…, p, and inf is taken over all possible choices νi∈Vi for i=1,…, p. Another similar problem is considered. The bounds are sharp. 相似文献
4.
Géza Kós 《Acta Mathematica Hungarica》2013,140(3):243-247
We prove the following fact: If finitely many elements p 1,p 2,…,p n of a unique factorization domain are given such that the greatest common divisor of each pair (p i ,p j ) can be expressed as a linear combination of p i and p j , then the greatest common divisor of all the p i ’s can also be expressed as a linear combination of p 1,…,p n . We prove an analogous statement in general commutative rings. 相似文献
5.
《Statistics & probability letters》1988,7(3):225-228
This note develops modifications of the chi-square and maximum likelihood tests for the homogeneity of the success probabilities pi of k binomial variables when the number of trials, ni, vary widely and all pi are small. With N = Σni, and letting the ni/N approach fixed fractions, γi may differ. The procedures are appied to the first licensing data on the sensitivility which includes the case where the γi may differ. The procedures are applied to the first licensing data on the sensitivity of the ELISA tests used to screen for the AIDS virus and it is shown that one of the test kits was significantly less sensitive than the others. 相似文献
6.
Edie Stevenson 《Journal of Number Theory》1980,12(3):367-371
Let p be an odd prime, let d be a positive integer such that (d,p?1)=1, let r denote the p-adic valuation of d and let m=1+3+32+…+3r. It is shown that for every p-adic integer n the equation Σi=1mXid=n has a nontrivial p-adic solution. It is also shown that for all p-adic units a1, a2, a3, a4 and all p-adic integers n the equation Σi=14aiXip=n has a nontrivial p-adic solution. A corollary to each of these results is that every p-adic integer is a sum of four pth powers of p-adic integers. 相似文献
7.
8.
A table is presented of various sequences of 3-valent convex polyhedra, a sequence being defined by p3p4???pi??? where pi is the number of faces with i edges. These sequences are given for polyhedra with 6, 7, 8, 9, 10 faces and the sequences where p3=0 are given for polyhedra having 11, 12, 13, 14 faces. The number of polyhedra is also given for each sequence. 相似文献
9.
Let {e n} be the unit vector basis ofl p, l<p<∞, and letx n=anen?bnen+1. Necessary and sufficient conditions are given for the operatorT:l p → span {x n} defined byTe i=xi to be invertible. 相似文献
10.
Ernest Jucovič 《Discrete Mathematics》1973,6(3):249-254
Let pk(P) denote the number of k-gonal faces of the 3-polytope P. Necessary and sufficient conditions are found for a vector (p3, p4,…., pm) to have the following property: There exists a 4-valent 3-polytope P with pi(P)=pi for all i≠4, which has a center, or a line, or a plane of symmetry. 相似文献
11.
A p-cover of is a family of subsets such that ∪ Si = n and |Si ∩ Si| ? p for i ≠ j. We prove that for fixed p, the number of p-cover of n is O(np+1logn). 相似文献
12.
The problem of determining the chromatic numbers of the strong product of cycles is considered. A construction is given proving χ (G) = 2p +1 for a product of p odd cycles of lengths at least 2p +1. Several consequences are discussed. In particular, it is proved that the strong product of p factors has chromatic number at most 2p +1 provided that each factor admits a homomorphism to sufficiently long odd cycle Cmi, mi ≥ 2p +1. 相似文献
13.
《Journal of multivariate analysis》1986,18(1):107-116
We present a new method of computing C. R. Rao's MINQUE in variance component models (y = Xβ + U1ξ1 + … + Upξp), which requires only inversion and storage of ni × ni matrices, where ni is the number of columns in Ui. In many cases most of these matrices are of diagonal form. In particular, the derivation of MINQUE equations for univariate nested classification models does not need any inversion of matrices. 相似文献
14.
Muammer Kula 《Acta Mathematica Hungarica》2012,136(1-2):1-15
An explicit characterization of each of the separation properties?T i , i=0,1, $\mathop {\mathrm {Pre}}\nolimits T_{2}$ , and T 2 at a point p is given in the topological category of Cauchy spaces. Moreover, specific relationships that arise among the various?T i , i=0,1, $\mathop {\mathrm {Pre}}\nolimits T_{2}$ , and T 2 structures at p are examined in this category. Finally, we investigate the relationships between generalized separation properties and separation properties at a point p in this category. 相似文献
15.
Augusto C. Ponce 《Comptes Rendus Mathematique》2003,336(7):571-576
We present some properties of the distributions of the form T=∑i(δpi?δni), with ∑id(pi,ni)<∞, which arise in the 3-d Ginzburg–Landau problem studied by Bourgain, Brezis and Mironescu (C. R. Acad. Sci. Paris, Ser. I 331 (2000) 119–124). We show that there always exists an irreducible representation of T. We also extend a result of Smets (C. R. Acad. Sci. Paris, Ser. I 334 (2002) 371–374) which says that T is a measure iff T can be written as a finite sum of dipoles. To cite this article: A.C. Ponce, C. R. Acad. Sci. Paris, Ser. I 336 (2003). 相似文献
16.
Ehud Friedgut 《Journal of Combinatorial Theory, Series A》2005,111(2):239-244
Let p?1/2 and let μp be the product measure on {0,1}n, where μp(x)=p∑xi(1-p)n-∑xi. Let A⊂{0,1}n be an intersecting family, i.e. for every x,y∈A there exists 1?i?n such that xi=yi=1. Then μp(A)?p. Our proof uses a probabilistic trick first applied by Katona to prove the Erd?s-Ko-Rado theorem. 相似文献
17.
The main idea of this paper is to clarify why it is sometimes incorrect to interpolate inequalities in a “formal” way. For this we consider two Hardy type inequalities, which are true for each parameter α≠0 but which fail for the “critical” point α=0. This means that we cannot interpolate these inequalities between the noncritical points α=1 and α=?1 and conclude that it is also true at the critical point α=0. Why? An accurate analysis shows that this problem is connected with the investigation of the interpolation of intersections (N∩L p(w0), N∩Lp(w1)), whereN is the linear space which consists of all functions with the integral equal to 0. We calculate theK-functional for the couple (N∩L p(w0),N∩L p (w1)), which turns out to be essentially different from theK-functional for (L p(w0), Lp(w1)), even for the case whenN∩L p(wi) is dense inL p(wi) (i=0,1). This essential difference is the reason why the “naive” interpolation above gives an incorrect result. 相似文献
18.
We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi−t is collected. The goal is to find routes for the servers such that total collected revenue is maximized. We study the complexity of different variants of this problem on the line. 相似文献
19.
《Finite Fields and Their Applications》2001,7(1):197-204
Let F be a finite field with q=pf elements, where p is a prime. Let N be the number of solutions (x1,…,xn) of the equation c1xd11+···+cnxdnn=c over the finite fields, where d1∣q−1, ciϵF*(i=1, 2,…,n), and cϵF. In this paper, we prove that if b1 is the least integer such that b1≥∑ni=1 (f/ri) (Di, p−1)/(p−1), then q[b1/f]−1∣N, where ri is the least integer such that di∣pri−1, Didi=pri−1, the (Di, p−1) denotes the greatest common divisor of Di and p−1, [b1/f] denotes the integer part of b1/f. If di=d, then this result is an improvement of the theorem that pb∣N, where b is an integer less than n/d, obtained by J. Ax (1969, Amer. J. Math.86, 255–261) and D. Wan (1988, Proc. AMS103, 1049–1052), under a certain natural restriction on d and n. 相似文献
20.
Younshik Chung 《Journal of Applied Mathematics and Computing》1996,3(1):55-63
LetX 1,...,X p bep(≥ 2) independent random variables, where eachX i has a gamma distribution withk i andθ i . The problem is to simultaneously estimatep gammar parametersθ i under entropy loss where the parameters are believed priori. Hierarchical Bayes (HB) and empirical Bayes(EB) estimators are investigated. Next, computer simulation is studied to compute the risk percentage improvement of the HB, EB and the estimator of Dey et al.(1987) compared to MVUE ofθ. 相似文献