共查询到20条相似文献,搜索用时 15 毫秒
1.
D. E. Daykin 《Periodica Mathematica Hungarica》1983,14(1):43-47
LetR be the reals ≥ 0. LetF be the set of mapsf: {1, 2, ?,n} →R. Choosew ∈ F withw i = w(i) > 0. PutW i = w1 + ? + wi. Givenf ∈ F, define \(\bar f\) ∈F by $$\bar f\left( i \right) = \frac{{\left\{ {w_i f\left( 1 \right) + \ldots + w_i f\left( i \right)} \right\}}}{{W_i }}.$$ Callf mean increasing if \(\bar f\) is increasing. Letf 1, ?, ft be mean decreasing andf t+1,?: ft+u be mean increasing. Put $$k = W_n^u \min \left\{ {w_i^{u - 1} W_i^{t - u} } \right\}.$$ Then $$k\mathop \sum \limits_{i = 1}^n w_i f_1 \left( i \right) \ldots f_{t + u} \left( i \right) \leqslant \mathop \prod \limits_{j = 1}^{t + u} (\mathop \sum \limits_{i = 1}^n w_i f_1 (i)).$$ 相似文献
2.
L. K. Lauderdale 《Archiv der Mathematik》2013,101(1):9-15
For a finite group G, let m(G) denote the set of maximal subgroups of G and π(G) denote the set of primes which divide |G|. When G is a cyclic group, an elementary calculation proves that |m(G)| = |π(G)|. In this paper, we prove lower bounds on |m(G)| when G is not cyclic. In general, ${|m(G)| \geq |\pi(G)|+p}$ | m ( G ) | ≥ | π ( G ) | + p , where ${p \in \pi(G)}$ p ∈ π ( G ) is the smallest prime that divides |G|. If G has a noncyclic Sylow subgroup and ${q \in \pi(G)}$ q ∈ π ( G ) is the smallest prime such that ${Q \in {\rm syl}_q(G)}$ Q ∈ syl q ( G ) is noncyclic, then ${|m(G)| \geq |\pi(G)|+q}$ | m ( G ) | ≥ | π ( G ) | + q . Both lower bounds are best possible. 相似文献
3.
We denote by G[X, Y] a bipartite graph G with partite sets X and Y. Let d G (v) be the degree of a vertex v in a graph G. For G[X, Y] and ${S \subseteq V(G),}$ we define ${\sigma_{1,1}(S):=\min\{d_G(x)+d_G(y) : (x,y) \in (X \cap S,Y) \cup (X, Y \cap S), xy \not\in E(G)\}}$ . Amar et al. (Opusc. Math. 29:345–364, 2009) obtained σ 1,1(S) condition for cyclability of balanced bipartite graphs. In this paper, we generalize the result as it includes the case of unbalanced bipartite graphs: if G[X, Y] is a 2-connected bipartite graph with |X| ≥ |Y| and ${S \subseteq V(G)}$ such that σ 1,1(S) ≥ |X| + 1, then either there exists a cycle containing S or ${|S \cap X| > |Y|}$ and there exists a cycle containing Y. This degree sum condition is sharp. 相似文献
4.
Let G be a connected graph, let ${X \subset V(G)}$ and let f be a mapping from X to {2, 3, . . .}. Kaneko and Yoshimoto (Inf Process Lett 73:163–165, 2000) conjectured that if |N G (S) ? X| ≥ f (S) ? 2|S| + ω G (S) + 1 for any subset ${S \subset X}$ , then there exists a spanning tree T such that d T (x) ≥ f (x) for all ${x \in X}$ . In this paper, we show a result with a stronger assumption than this conjecture; if |N G (S) ? X| ≥ f (S) ? 2|S| + α(S) + 1 for any subset ${S \subset X}$ , then there exists a spanning tree T such that d T (x) ≥ f (x) for all ${x \in X}$ . 相似文献
5.
LetG be a finite abelian group,G?{Z n, Z2?Z2n}. Then every sequenceA={g 1,...,gt} of $t = \frac{{4\left| G \right|}}{3} + 1$ elements fromG contains a subsequenceB?A, |G|=|G| such that $\sum\nolimits_{g_i \in B^{g_i } } { = 0 (in G)} $ . This bound, which is best possible, extends recent results of [1] and [22] concerning the celebrated theorem of Erdös-Ginzburg-Ziv [21]. 相似文献
6.
LetX be ann-element set and letA and? be families of subsets ofX. We say thatA and? are crosst-intersecting if |A ∩ B| ≥ t holds for all A ∈A and for allB ∈ ?. Suppose thatA and ? are crosst-intersecting. This paper first proves a crosst-intersecting version of Harper's Theorem:
- There are two crosst-intersecting Hamming spheresA 0,? 0 with centerX such that |A| ≤ |A 0| and|?| ≤ |? 0| hold.
- Suppose thatt ≥ 2 and that the pair of integers (|A) is maximal with respect to direct product ordering among pairs of crosst-intersecting families. Then,A and? are Hamming spheres with centerX.
- Ifn + t = 2k ? 1 then |A| |?| ≤ max \(\left\{ {\left( {K_k^n + \left( {_{k - 1}^{n - 1} } \right)} \right)^2 ,K_k^n K_{k - 1}^n } \right\}\) holds, whereK l n is defined as \(\left( {_n^n } \right)\left( {_{n - 1}^n } \right) + \cdots + \left( {_l^n } \right).\)
- Ifn + t = 2k then |A| |? ≤ (K k n )2 holds.
7.
We prove that the fundamental semi-group eit(m 2I+|Δ|)1/2(m = 0) of the Klein-Gordon equation is bounded on the modulation space M ps,q(Rn) for all 0 < p,q ∞ and s ∈ R.Similarly,we prove that the wave semi-group eit|Δ|1/2 is bounded on the Hardy type modulation spaces μsp,q(Rn) for all 0 < p,q ∞,and s ∈ R.All the bounds have an asymptotic factor tn|1/p 1/2| as t goes to the infinity.These results extend some known results for the case of p 1.Also,some applications for the Cauchy problems related to the semi-group eit(m2I+|Δ|)1/2 are obtained.Finally we discuss the optimum of the factor tn|1/p 1/2| and raise some unsolved problems. 相似文献
8.
Björn G. Walther 《Arkiv f?r Matematik》1999,37(2):381-393
For Ξ∈R n ,t∈R andf∈S(R n ) define $\left( {S^2 f} \right)\left( t \right)\left( \xi \right) = \exp \left( {it\left| \xi \right|^2 } \right)\hat f\left( \xi \right)$ . We determine the optimal regularitys 0 such that $\int_{R^n } {\left\| {(S^2 f)[x]} \right\|_{L^2 (R)}^2 \frac{{dx}}{{(1 + |x|)^b }} \leqslant C\left\| f \right\|_{H^s (R^n )}^2 ,s > s_0 } ,$ holds whereC is independent off∈S(R n ) or we show that such optimal regularity does not exist. This problem has been treated earlier, e.g. by Ben-Artzi and Klainerman [2], Kato and Yajima [4], Simon [6], Vega [9] and Wang [11]. Our theorems can be generalized to the case where the exp(it|ξ|2) is replaced by exp(it|ξ|a),a≠2. The proof uses Parseval's formula onR, orthogonality arguments arising from decomposingL 2(R n ) using spherical harmonics and a uniform estimate for Bessel functions. Homogeneity arguments are used to show that results are sharp with respect to regularity. 相似文献
9.
A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7. 相似文献
10.
Let p, n ∈ ? with 2p ≥ n + 2, and let I a be a polyharmonic spline of order p on the grid ? × a? n which satisfies the interpolating conditions $I_{a}\left( j,am\right) =d_{j}\left( am\right) $ for j ∈ ?, m ∈ ? n where the functions d j : ? n → ? and the parameter a > 0 are given. Let $B_{s}\left( \mathbb{R}^{n}\right) $ be the set of all integrable functions f : ? n → ? such that the integral $$ \left\| f\right\| _{s}:=\int_{\mathbb{R}^{n}}\left| \widehat{f}\left( \xi\right) \right| \left( 1+\left| \xi\right| ^{s}\right) d\xi $$ is finite. The main result states that for given $\mathbb{\sigma}\geq0$ there exists a constant c>0 such that whenever $d_{j}\in B_{2p}\left( \mathbb{R}^{n}\right) \cap C\left( \mathbb{R}^{n}\right) ,$ j ∈ ?, satisfy $\left\| d_{j}\right\| _{2p}\leq D\cdot\left( 1+\left| j\right| ^{\mathbb{\sigma}}\right) $ for all j ∈ ? there exists a polyspline S : ? n+1 → ? of order p on strips such that $$ \left| S\left( t,y\right) -I_{a}\left( t,y\right) \right| \leq a^{2p-1}c\cdot D\cdot\left( 1+\left| t\right| ^{\mathbb{\sigma}}\right) $$ for all y ∈ ? n , t ∈ ? and all 0 < a ≤ 1. 相似文献
11.
Dr. J. Hüsler 《Monatshefte für Mathematik》1978,85(1):53-58
Let (A, ≤) be a partially ordered set, {X α} a collection of i. i. d. random variables, indexed byA. Let \(S_\alpha = \sum _{\beta \leqslant \alpha } X_\beta \) , |α|=card {β∈A, β∈α}. We study the convergence rates ofS α/|α|. We derive for a large class of partially ordered sets theorems, like the following one: For suitabler, t with 1/2< <r/t≤1:E|X| t M (|X| t/r )<∞ andEX=μ if and only if $$S_\alpha = \sum _{\beta \leqslant \alpha } X_\beta $$ for all ε>0, where \(M(x) = \sum _{j< x} d(j)\) withd(j)=card {α∈A, |α|=j}. 相似文献
12.
E. A. Grechnikov 《Mathematical Notes》2010,88(5-6):819-826
For the sum S of the Legendre symbols of a polynomial of odd degree n ≥ 3 modulo primes p ≥ 3, Weil’s estimate |S| ≤ (n ? 1) $ \sqrt p $ and Korobov’s estimate $$ \left| S \right| \leqslant (n - 1)\sqrt {p - \frac{{(n - 3)(n - 4)}} {4}} forp \geqslant \frac{{n^2 + 9}} {2} $$ are well known. In this paper, we prove a stronger estimate, namely, $$ \left| S \right| < (n - 1)\sqrt {p - \frac{{(n - 3)(n + 1)}} {4}} $$ . 相似文献
13.
If γ(x)=x+iA(x),tan ?1‖A′‖∞<ω<π/2,S ω 0 ={z∈C}| |argz|<ω, or, |arg(-z)|<ω} We have proved that if φ is a holomorphic function in S ω 0 and \(\left| {\varphi (z)} \right| \leqslant \frac{C}{{\left| z \right|}}\) , denotingT f (z)= ∫?(z-ζ)f(ζ)dζ, ?f∈C 0(γ), ?z∈suppf, where Cc(γ) denotes the class of continuous functions with compact supports, then the following two conditions are equivalent:
- T can be extended to be a bounded operator on L2(γ);
- there exists a function ?1 ∈H ∞(S ω 0 ) such that ?′1(z)=?(z)+?(-z), ?z∈S ω 0 ?z∈S w 0 .
14.
Saharon Shelah 《Israel Journal of Mathematics》1987,60(2):146-166
Let \(\bar B^* \) be a separable reduced (abelian)p-group which is torsion complete. We ask whether for \(G \subseteq \bar B^* \) there is \(H \subseteq _{pr} \bar B^* ,H[p] = G[p]\) ,H[p]=G[p],H not isomorphic toG. IfG is the sum of cyclic groups or is torsion complete, the answer is easily no. For otherG, we prove that the answer is yes assuming G.C.H. Even without G.C.H. the answer is yes if the density character ofG is equal to Min n<ω|p nG|, i.e., $$\mathop {Min}\limits_{n< \omega } |p^n G| = \mathop {Min}\limits_m \mathop \Sigma \limits_{n > m} |(p^n G)[p]/(p^{n + 1} G)[p]|$$ Of course, instead of two non-isomorphic we can get many, but we do not deal much with this. 相似文献
15.
Yilun Shang 《Mathematica Slovaca》2013,63(5):1141-1152
We consider a random subgraph G n (p) of a finite graph family G n = (V n , E n ) formed by retaining each edge of G n independently with probability p. We show that if G n is an expander graph with vertices of bounded degree, then for any c n ∈ (0, 1) satisfying $c_n \gg {1 \mathord{\left/ {\vphantom {1 {\sqrt {\ln n} }}} \right. \kern-0em} {\sqrt {\ln n} }}$ and $\mathop {\lim \sup }\limits_{n \to \infty } c_n < 1$ , the property that the random subgraph contains a giant component of order c n |V n | has a sharp threshold. 相似文献
16.
If $P(z) = \sum\limits_{\nu = 0}^n {c_\nu z^\nu } $ is a polynomial of degree n, then for |β| ≤ 1, it was proved in [4] that $\left| {zP'(z) + n\frac{\beta } {2}P(z)} \right| \leqslant n\left| {1 + \frac{\beta } {2}} \right|\mathop {\max }\limits_{|z| = 1} |P(z)|,|z| = 1 $ In this paper, first we generalize the above result for the s th derivative of polynomials and next we improve the above inequality for polynomials with restricted zeros. 相似文献
17.
P. Katerinis 《Graphs and Combinatorics》1990,6(3):253-258
LetG be a bipartite graph with bipartition (X, Y) andk a positive integer. If (i) $$\left| X \right| = \left| Y \right|,$$ (ii) $$\delta (G) \geqslant \left\lceil {\frac{{\left| X \right|}}{2}} \right\rceil \geqslant k,$$ \(\left| X \right| \geqslant 4k - 4\sqrt k + 1\) when |X| is odd and |X| ≥ 4k ? 2 when |X| is even, thenG has ak-factor. 相似文献
18.
In a bounded simple connected region G ? ?3 we consider the equation $$L\left[ u \right]: = k\left( z \right)\left( {u_{xx} + u_{yy} } \right) + u_{zz} + d\left( {x,y,z} \right)u = f\left( {x,y,z} \right)$$ where k(z)? 0 whenever z ? 0.G is surrounded forz≥0 by a smooth surface Γ0 with S:=Γ0 ? {(x,y,z)|=0} and forz<0 by the characteristic \(\Gamma _2 :---(x^2 + y^2 )^{{\textstyle{1 \over 2}}} + \int\limits_z^0 {(---k(t))^{{\textstyle{1 \over 2}}} dt = 0} \) and a smooth surface Γ1 which intersect the planez=0 inS and where the outer normal n=(nx, ny, nz) fulfills \(k(z)(n_x^2 + n_y^2 ) + n_z^2 |_{\Gamma _1 } > 0\) . Under conditions on Γ1 and the coefficientsk(z), d(x,y,z) we prove the existence of weak solutions for the boundary value problemL[u]=f inG with \(u|_{\Gamma _0 \cup \Gamma _1 } = 0\) . The uniqueness of the classical solution for this problem was proved in [1]. 相似文献
19.
Elena Prestini 《Monatshefte für Mathematik》1990,109(2):135-143
Letf be a radial function and setT * f(x)=sup0<t<1 |T t f(x)|, x ∈ ?n, n≥2, where(Tt f)^ (ξ)=e it|ξ|a \(\hat f\) (ξ),a > 1. We show that, ifB is the ball centered at the origin, of radius 100, then \(\int\limits_B {|T^ * f(x)|} dx \leqslant c(\int {|\hat f(\xi )|^2 (l + |\xi |^s )ds} )^{1/2} \) if and only ifs≥1/4. 相似文献
20.
We determine all connected normal edge-transitive Cayley graphs on non-abelian groups with order 4p,where p is a prime number.As a consequence we prove if |G|=2δp,δ=0,1,2 and p prime,then Γ=Cay(G,S) is a connected normal 1/2 arc-transitive Cayley graph only if G=F4p,where S is an inverse closed generating subset of G which does not contain the identity element of G and F 4p is a group with presentation F4p = a,b|ap=b4=1,b-1ab=aλ,where λ2≡-1(mod p). 相似文献