首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let K be the algebraic closure of a finite field Fq of odd characteristic p. For a positive integer m prime to p, let F=K(x,y) be the transcendence degree 1 function field defined by yq+y=xm+x?m. Let t=xm(q?1) and H=K(t). The extension F|H is a non-Galois extension. Let K be the Galois closure of F with respect to H. By Stichtenoth [20], K has genus g(K)=(qm?1)(q?1), p-rank (Hasse–Witt invariant) γ(K)=(q?1)2 and a K-automorphism group of order at least 2q2m(q?1). In this paper we prove that this subgroup is the full K-automorphism group of K; more precisely AutK(K)=Δ?D where Δ is an elementary abelian p-group of order q2 and D has an index 2 cyclic subgroup of order m(q?1). In particular, m|AutK(K)|>g(K)3/2, and if K is ordinary (i.e. g(K)=γ(K)) then |AutK(K)|>g3/2. On the other hand, if G is a solvable subgroup of the K-automorphism group of an ordinary, transcendence degree 1 function field L of genus g(L)2 defined over K, then |AutK(K)|34(g(L)+1)3/2<682g(L)3/2; see [15]. This shows that K hits this bound up to the constant 682.Since AutK(K) has several subgroups, the fixed subfield FN of such a subgroup N may happen to have many automorphisms provided that the normalizer of N in AutK(K) is large enough. This possibility is worked out for subgroups of Δ.  相似文献   

2.
3.
Let R, S and T be finite sets with |R|=r, |S|=s and |T|=t. A code CR×S×T with covering radius 1 and minimum distance 2 is closely connected to a certain generalized partial Latin rectangle. We present various constructions of such codes and some lower bounds on their minimal cardinality K(r,s,t;2). These bounds turn out to be best possible in many instances. Focussing on the special case t=s we determine K(r,s,s;2) when r divides s, when r=s1, when s is large, relative to r, when r is large, relative to s, as well as K(3r,2r,2r;2). Finally, a table with bounds on K(r,s,s;2) is given.  相似文献   

4.
5.
6.
7.
8.
In this paper, we apply the variational method with Structural Prescribed Boundary Conditions (SPBC) to prove the existence of periodic and quasi-periodic solutions for the planar four-body problem with two pairs of equal masses m1=m3 and m2=m4. A path q(t) on [0,T] satisfies the SPBC if the boundaries q(0)A and q(T)B, where A and B are two structural configuration spaces in (R2)4 and they depend on a rotation angle θ(0,2π) and the mass ratio μ=m2m1R+.We show that there is a region Ω?(0,2π)×R+ such that there exists at least one local minimizer of the Lagrangian action functional on the path space satisfying the SPBC {q(t)H1([0,T],(R2)4)|q(0)A,q(T)B} for any (θ,μ)Ω. The corresponding minimizing path of the minimizer can be extended to a non-homographic periodic solution if θ is commensurable with π or a quasi-periodic solution if θ is not commensurable with π. In the variational method with the SPBC, we only impose constraints on the boundary and we do not impose any symmetry constraint on solutions. Instead, we prove that our solutions that are extended from the initial minimizing paths possess certain symmetries.The periodic solutions can be further classified as simple choreographic solutions, double choreographic solutions and non-choreographic solutions. Among the many stable simple choreographic orbits, the most extraordinary one is the stable star pentagon choreographic solution when (θ,μ)=(4π5,1). Remarkably the unequal-mass variants of the stable star pentagon are just as stable as the equal mass choreographies.  相似文献   

9.
Let p>3 be a prime. For each maximal subgroup H?GL(d,p) with |H|?p3d+1, we construct a d-generator finite p-group G with the property that Aut(G) induces H on the Frattini quotient G/Φ(G) and |G|?pd42. A significant feature of this construction is that |G| is very small compared to |H|, shedding new light upon a celebrated result of Bryant and Kovács. The groups G that we exhibit have exponent p, and of all such groups G with the desired action of H on G/Φ(G), the construction yields groups with smallest nilpotency class, and in most cases, the smallest order.  相似文献   

10.
In this note, we show that given a smooth affine variety X over an algebraically closed field k and an effective (possibly non-reduced) Cartier divisor on it, the Chow group of zero cycles with modulus CH0(X|D) is torsion free, except possibly for p-torsion if the characteristic of k is p>0. This generalizes to the relative setting classical results of Rojtman (for X smooth) and of Levine (for X singular).  相似文献   

11.
12.
13.
In this article, we prove that the compact simple Lie groups SU(n) for n6, SO(n) for n7, Sp(n) for n3, E6,E7,E8, and F4 admit left-invariant Einstein metrics that are not geodesic orbit. This gives a positive answer to an open problem recently posed by Nikonorov.  相似文献   

14.
Let χ range over the (p?1)/2 even Dirichlet characters mod p?3, a prime. Let θ(x,χ) be the associated theta series. It is known that the square mean value of θ(1,χ) is asymptotic to p3/2/42 as p goes to infinity. We prove that the fourth mean value of θ(1,χ) is asymptotic to 316πp2logp as p goes to infinity. We give similar results for mean values of odd Dirichlet characters mod p.  相似文献   

15.
Given a set S of points in the plane representing wireless devices, each point equipped with a directional antenna of radius r and aperture angle α?180°, our goal is to find orientations and a minimum r for these antennas such that the induced communication graph is strongly connected. We show that r=3 if α[180°,240°), r=2 if α[240°,270°), r=2sin(36°) if α[270°,288°), and r=1 if α?288° suffices to establish strong connectivity, assuming that the longest edge in the Euclidean minimum spanning tree of S is 1. These results are worst-case optimal and match the lower bounds presented in [I. Caragiannis, C. Kaklamanis, E. Kranakis, D. Krizanc, A. Wiese, Communication in wireless networks with directional antennae, in: Proc. of the 20th Symp. on Parallelism in Algorithms and Architectures, 2008, pp. 344–351]. In contrast, r=2 is sometimes necessary when α<180°.  相似文献   

16.
For a given graph G and a positive integer r the r-path graph, Pr(G), has for vertices the set of all paths of length r in G. Two vertices are adjacent when the intersection of the corresponding paths forms a path of length r1, and their union forms either a cycle or a path of length r+1 in G. Let Prk(G) be the k-iteration of r-path graph operator on a connected graph G. Let H be a subgraph of Prk(G). The k-history Prk(H) is a subgraph of G that is induced by all edges that take part in the recursive definition of H. We present some general properties of k-histories and give a complete characterization of graphs that are k-histories of vertices of 2-path graph operator.  相似文献   

17.
18.
19.
We consider a real Gaussian process X with unknown smoothness r0N where the mean-square derivative X(r0) is supposed to be Hölder continuous in quadratic mean. First, from the discrete observations X(t1),,X(tn), we study reconstruction of X(t), t[0,1], with X?r(t), a piecewise polynomial interpolation of degree r?1. We show that the mean-square error of interpolation is a decreasing function of r but becomes stable as soon as r?r0. Next, from an interpolation-based empirical criterion, we derive an estimator r? of r0 and prove its strong consistency by giving an exponential inequality for P(r?r0). Finally, we prove the strong convergence of X?r?(t) toward X(t) with a similar rate as in the case ‘r0 known’. To cite this article: D. Blanke, C. Vial, C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

20.
We prove that the moduli spaces of rational curves of degree at most 3 in linear sections of the Grassmannian Gr(2,5) are all rational varieties. We also study their compactifications and birational geometry.  相似文献   

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

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