首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let X be a locally finite tree, and let G=Aut(X). Then G is a locally compact group. We show that if X has more than one end, and if G contains a discrete subgroup such that the quotient graph of groups \\X is infinite but has finite covolume, then G contains a nonuniform lattice, that is, a discrete subgroup such that \G is not compact, yet has a finite G-invariant measure.  相似文献   

2.
Let a ={nlna (n+1)}, where a R. The following results are established: For every &fnof a BV ((- ]2), the triangular partial sums of its Fourier series are uniformly bounded if a = -1, and converge everywhere if a < -1.For every a>0, there exists &fnof a BV ((- ]2) such that the triangular partial sums of its Fourier series are unbounded at the point (0;0).  相似文献   

3.
Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Let 0 > 1 ··· > D denote the eigenvalues of and let q h ij (0 h, i, j D) denote the Krein parameters of . Pick an integer h (1 h D – 1). The representation diagram = h is an undirected graph with vertices 0,1,...,D. For 0 i, j D, vertices i, j are adjacent in whenever i j and q h ij 0. It turns out that in , the vertex 0 is adjacent to h and no other vertices. Similarly, the vertex D is adjacent to D – h and no other vertices. We call 0, D the trivial vertices of . Let l denote a vertex of . It turns out that l is adjacent to at least one vertex of . We say l is a leaf whenever l is adjacent to exactly one vertex of . We show has a nontrivial leaf if and only if is the disjoint union of two paths.  相似文献   

4.
Let G denote a semisimple group, a discrete subgroup, B=G/P the Poisson boundary. Regarding invariants of discrete subgroups we prove, in particular, the following:(1) For any -quasi-invariant measure on B, and any probablity measure on , the norm of the operator () on L 2(B,) is equal to (), where is the unitary representation in L 2(X,), and is the regular representation of .(2) In particular this estimate holds when is Lebesgue measure on B, a Patterson–Sullivan measure, or a -stationary measure, and implies explicit lower bounds for the displacement and Margulis number of (w.r.t. a finite generating set), the dimension of the conformal density, the -entropy of the measure, and Lyapunov exponents of .(3) In particular, when G=PSL2() and is free, the new lower bound of the displacement is somewhat smaller than the Culler–Shalen bound (which requires an additional assumption) and is greater than the standard ball-packing bound.We also prove that ()=G() for any amenable action of G and L 1(G), and conversely, give a spectral criterion for amenability of an action of G under certain natural dynamical conditions. In addition, we establish a uniform lower bound for the -entropy of any measure quasi-invariant under the action of a group with property T, and use this fact to construct an interesting class of actions of such groups, related to 'virtual' maximal parabolic subgroups. Most of the results hold in fact in greater generality, and apply for instance when G is any semi-simple algebraic group, or when is any word-hyperbolic group, acting on their Poisson boundary, for example.  相似文献   

5.
In a variety of statistical problems the estimate n of a parameter is defined as the root of a generalized estimating equation Gn(nn)=0 where n is an estimate of a nuisance parameter . We give sufficient conditions for the asymptotic normality of #x0398;n defined in this way and derive their asymptotic distribution. A circumstance under which the asymptotic distribution of #x0398;n will not be influenced by that of n) is noted. As an example, we consider a covariance structure analysis in which both the population mean and the population fourth-order moment are nuisance parameters. Applications to pseudo maximum likelihood, generalized least squares with estimated weights, and M-estimation with an estimated scale parameter are discussed briefly.  相似文献   

6.
LetG be a vector space over the field of rational numbers andf, g:G -linear mappings. equipped with the usual norm topology. Denote by f , g the initial topologies onG induced byf respectivelyg.Then the following result holds: If there is a nonvoid open setU whose complement contains at least one inner point such thatf –1 U g , then there is ac withf=cg. In particular, iff0, the topologies coincide.Furthermore, a -linear mappingh: (G, f )(G, g ) is continuous if and only if there is a real constantc withg o h=cf.Dedicated to Professor János Aczél on his 60th birthday  相似文献   

7.
For a bounded regular Jordan domain in R 2, we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ,>0 with nonnegative functions qK(). Some estimates on the solution are also given.  相似文献   

8.
Summary Consider a stationary process {X n(), – < n < . If the measure of the process is finite (the measure of the whole sample space finite), it is well known that ergodicity of the process {X n(), - < n < and of each of the subprocesses {X n(), 0 n < , {X n(), – < n 0 are equivalent (see [3]). We shall show that this is generally not true for stationary processes with a sigma-finite measure, specifically for stationary irreducible transient Markov chains. An example of a stationary irreducible transient Markov chain {X n(), - < n <} with {itXn(), 0 n < < ergodic but {X n(), < n 0 nonergodic is given. That this can be the case has already been implicitly indicated in the literature [4]. Another example of a stationary irreducible transient Markov chain with both {X n(), 0 n < and {itX n(),-< < n 0} ergodic but {X n(), - < n < nonergodic is presented. In fact, it is shown that all stationary irreducible transient Markov chains {X n(), - < n < < are nonergodic.This research was supported in part by the Office of Naval Research.John Simon Guggenheim Memorial Fellow.  相似文献   

9.
A quasilinear equation u -x·u/2+f(u)=0 is studied, wheref(u)=–u+u , > 0, 0<. <1, >1 andx R n. The equation arises from the study of blow-up self-similar solutions of the heat equation t =+. We prove the existence and non-existence of ground state for various combination of , and . In particular, we prove that when / < forn=1,2 or / < (n + 2) /(n – 2) forn 3 there exists no non-constant positive radial self-similar solution of the parabolic equation, but for many cases where / > (n + 2)/(n – 2) there exists an infinite number of non-constant positive radial self-similar solutions.  相似文献   

10.
Let X 1,..., Xn be independent random variables such that {Xj 1}=1 and E X j=0 for all j. We prove an upper bound for the tail probabilities of the sum M n=X1+...+ Xn. Namely, we prove the inequality {M nx} 3.7 {Sn x}, where S n=1+...+ n is a sum of centered independent identically distributed Bernoulli random variables such that E S n 2 =ME M n 2 and {k=1}=E S n 2 /(n+E S n 2 ) for all k (we call a random variable Bernoulli if it assumes at most two values). The inequality holds for x at which the survival function x{S nx} has a jump down. For remaining x, the inequality still holds provided that we interpolate the function between the adjacent jump points linearly or log-linearly. If necessary, in order to estimate {S nx} one can use special bounds for binomial probabilities. Up to the factor at most 2.375, the inequality is final. The inequality improves the classical Bernstein, Prokhorov, Bennett, Hoeffding, Talagrand, and other bounds.  相似文献   

11.
Summary We generalise the theory of infinitely divisible positive definite functions f:G on a group G to a theory of infinite divisibility for completely positive mappings : G() taking values in the algebra of bounded operators on some Hilbert space .We prove a structure theorem for normalised infinitely divisible completely positive mappings which shows that the mapping , its Stinespring representation and its Stinespring isometry are of type S (in the sense of Guichardet [Gui]). Furthermore, we prove that a completely positive mapping is infinitely divisible if and only if it is the exponential (as defined in this paper) of a hermitian conditionally completely positive mapping.  相似文献   

12.
The independent domination number i(G) (independent number (G)) is the minimum (maximum) cardinality among all maximal independent sets of G. Haviland (1995) conjectured that any connected regular graph G of order n and degree 1/2n satisfies i(G) 2n/3 1/2. For 1 k l m, the subset graph S m (k, l) is the bipartite graph whose vertices are the k- and l-subsets of an m element ground set where two vertices are adjacent if and only if one subset is contained in the other. In this paper, we give a sharp upper bound for i(S m (k, l)) and prove that if k + l = m then Havilands conjecture holds for the subset graph S m (k, l). Furthermore, we give the exact value of (S m (k, l)).This work was supported by National Natural Sciences Foundation of China (19871036).  相似文献   

13.
It is well known, that for the sums of i.i.d. random variables we have S n/n 0 a.s. iff n=1 1/n P(|S n| > n) < holds for all > 0 (Spitzer's SLLN). The result is also known in separable Banach spaces. It will be shown, that this also holds in nonseparable (= not necessarily separable) Banach spaces without any measurability assumption. In the theory of empirical processes this gives a characterization of Glivenko-Cantelli classes.  相似文献   

14.
Let n be n-dimensional Euclidean space, and let : [0, L] n and : [0, L] n be closed rectifiable arcs in n of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C 2 curves. In this paper we prove the conjecture in general.  相似文献   

15.
Summary Let denote the class of infinite product probability measures = 1× 2× defined on an infinite product of replications of a given measurable space (X, A), and let denote the subset of for which (A) =0 or 1 for each permutation invariant event A. Previous works by Hewitt and Savage, Horn and Schach, Blum and Pathak, and Sendler (referenced in the paper) discuss very restrictive sufficient conditions under which a given member , of belongs to . In the present paper, the class is shown to possess several closure properties. E.g., if and 0 n for some n 1, then 0× 1× 2×.... While the current results do not permit a complete characterization of they demonstrate conclusively that is a much larger subset of than previous results indicated. The interesting special case X={0,1} is discussed in detail.Research supported by the National Science Foundation under grant No. MCS75-07556  相似文献   

16.
LetG be a graph, andk1 an integer. LetU be a subset ofV(G), and letF be a spanning subgraph ofG such that deg F (x)=k for allx V(G)–U. If deg F (x)k for allxU, thenF is called an upper semi-k-regular factor with defect setU, and if deg F (x)k for allxU, thenF is called a lower semi-k-regular factor with defect setU. Now letG=(X, Y;E(G)) be a bipartite graph with bipartition (X,Y) such that X=Yk+2. We prove the following two results.(1) Suppose that for each subsetU 1X such that U 1=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU 1Y, and for each subsetU 2Y such that U 2=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU 2. ThenG has ak-factor.(2) Suppose that for each subsetU 1X such that U 1=X–1/k+1,G has a lower semi-k-regular factor with defect setU 1Y, and for each subsetU 2Y such that U 2=X–1/k+1,G has a lower semi-k-regular factor with defect setXU 2. ThenG has ak-factor.  相似文献   

17.
Suppose that is the set of connected graphs such that a graph G if and only if G satisfies both (F1) if X is an edge cut of G with |X|3, then there exists a vertex v of degree |X| such that X consists of all the edges incident with v in G, and (F2) for every v of degree 3, v lies in a k-cycle of G, where 2k3.In this paper, we show that if G and (G)3, then for every pair of edges e,fE(G), G has a trail with initial edge e and final edge f which contains all vertices of G. This result extends several former results.  相似文献   

18.
LetG be a finite group which is generated by a subsetS of involutions satisfying the theorem of the three reflections: Ifa,b,x,y,z S, ab 1 and ifabx,aby,abz are involutions, thenxyz S. Assume thatS contains three elements which generate a four-group. ThenS is a class of conjugate elements ofG if and only ifG/Z(G) is a non-abelian simple group. Moreover,G/Z(G) is a nonabelian simple group ifG is not isomorphic to any PGL2(n).  相似文献   

19.
We shall give a further application of Hermite-Mahler polynomials to the consideration ofp-adic exponential function. An effective lower bound is obtained for max {| – | p ,P(e )| p }, where is an algebraic number satisfying || p <p –/(p–1), and 0 is ap-adic number with | | p depending on the degree of the polynomialPZ[y]. The bound obtained implies the transcendence ofe if ap-adic number satisfying 0 < || p <p –/(p–1) is algebraic or can be well approximated by algebraic numbers.This work was carried out while the author was a research fellow of the Alexander von Humboldt Foundation.  相似文献   

20.
Letk be an integer withk 2. LetG = (A, B; E) be a 2-connected bipartite graph. Supposed(x) + d(y) k + 1 for every pair of non-adjacent verticesx andy. ThenG contains a cycle of length at leastmin(2a, 2k) wherea = min(|A|,|B|), unlessG is one of some known exceptions. We conjecture that if|A| = |B| andd(x) + d(y) k + 1 for every pair of non-adjacent verticesx andy withx A andy B, thenG contains a cycle of length at leastmin(2a, 2k).  相似文献   

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

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