首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We prove that every [n, k, d] q code with q ≥ 4, k ≥ 3, whose weights are congruent to 0, −1 or −2 modulo q and is extendable unless its diversity is for odd q, where .   相似文献   

2.
A transitive decomposition is a pair where Γ is a graph and is a partition of the arc set of Γ such that there is a subgroup of automorphisms of Γ which leaves invariant and transitively permutes the parts in . In an earlier paper we gave a characterisation of G-transitive decompositions where Γ is the graph product K m × K m and G is a rank 3 group of product action type. This characterisation showed that every such decomposition arose from a 2-transitive decomposition of K m via one of two general constructions. Here we use results of Sibley to give an explicit classification of those which arise from 2-transitive edge-decompositions of K m .   相似文献   

3.
An improved Poincaré inequality and validity of the Palais-Smale condition are investigated for the energy functional on , 1 < p < ∞, where Ω is a bounded domain in , is a spectral (control) parameter, and is a given function, in Ω. Analysis is focused on the case λ = λ1, where −λ1 is the first eigenvalue of the Dirichlet p-Laplacian Δ p on , λ1 > 0, and on the “quadratization” of within an arbitrarily small cone in around the axis spanned by , where stands for the first eigenfunction of Δ p associated with −λ1.  相似文献   

4.
In this paper, we show that if the sum ∑r=1 Ψ(r) diverges, then the set of points (x, z, w) ∈ ℝ × ℂ × ℚp satisfying the inequalities , and for infinitely many integer polynomials P has full measure. With a special choice of parameters v i and λ i , i = 1, 2, 3, we can obtain all the theorems in the metric theory of transcendental numbers which were known in the real, complex, or p-adic fields separately.  相似文献   

5.
We present more general forms of the mean-value theorems established before for multiplicative functions on additive arithmetic semigroups and prove, on the basis of these new theorems, extensions of the Elliott-Daboussi theorem. Let be an additive arithmetic semigroup with a generating set ℘ of primes p. Assume that the number G(m) of elements a in with “degree” (a)=m satisfies
with constants q>1, ρ 1<ρ 2<⋅⋅⋅<ρ r =ρ, ρ≥1, γ>1+ρ. For the main result, let α,τ,η be positive constants such that α>1,τ ρ≥1, and τ α ρ≥1. Then for a multiplicative function f(a) on the following two conditions (A) and (B) are equivalent. These are (A) All four series
converge and
and (B) The order τ ρ mean-value
exists with m f ≠0 and the limit
exists with M v (α)>0.   相似文献   

6.
In the framework of the asymptotic analysis of thin structures, we prove that, up to an extraction, it is possible to decompose a sequence of ‘scaled gradients’ (where is the gradient in the k-dimensional ‘thin variable’ x β) bounded in (1 < p < + ∞) as a sum of a sequence whose p-th power is equi-integrable on Ω and a ‘rest’ that converges to zero in measure. In particular, for k = 1 we recover a well-known result for thin films by Bocea and Fonseca (ESAIM: COCV 7:443–470; 2002).   相似文献   

7.
Let r 1, …, r s be non-zero integers satisfying r 1 + ⋯ + r s = 0. Let G be a finite abelian group with k i |k i-1(2 ≤ in), and suppose that (r i , k 1) = 1(1 ≤ is). Let denote the maximal cardinality of a set which contains no non-trivial solution of r 1 x 1 + ⋯ + r s x s = 0 with . We prove that . We also apply this result to study problems in finite projective spaces.   相似文献   

8.
Let F be a class of functions on a probability space (Ω, μ) and let X 1,...,X k be independent random variables distributed according to μ. We establish an upper bound that holds with high probability on for every t > 0, and that depends on a natural geometric parameter associated with F. We use this result to analyze the supremum of empirical processes of the form for p > 1 using the geometry of F. We also present some geometric applications of this approach, based on properties of the random operator 〈X i , ·〉e i , where are sampled according to an isotropic, log-concave measure on .  相似文献   

9.
For a graph Γ, subgroups , and an edge partition of Γ, the pair is a (G, M)-homogeneous factorisation if M is vertex-transitive on Γ and fixes setwise each part of , while G permutes the parts of transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples. This paper forms part of an ARC Discovery grant of the last two authors. The second author holds an Australian Research Council Australian Research Fellowship.  相似文献   

10.
Let Γ6 be the elliptic curve of degree 6 in PG(5, q) arising from a non-singular cubic curve of PG(2, q) via the canonical Veronese embedding
(1) If Γ6 (equivalently ) has n GF(q)-rational points, then the associated near-MDS code has length n and dimension 6. In this paper, the case q  =  5 is investigated. For q  =  5, the maximum number of GF(q)-rational points of an elliptic curve is known to be equal to ten. We show that for an elliptic curve with ten GF(5)-rational points, the associated near-MDS code can be extended by adding two more points of PG(5, 5). In this way we obtain six non-isomorphic [12, 6]5 codes. The automorphism group of is also considered.   相似文献   

11.
We study the existence and multiplicity of positive solutions for the inhomogeneous Neumann boundary value problems involving the p(x)-Laplacian of the form
where Ω is a bounded smooth domain in , and p(x) > 1 for with and φ ≢ 0 on ∂Ω. Using the sub-supersolution method and the variational method, under appropriate assumptions on f, we prove that, there exists λ* > 0 such that the problem has at least two positive solutions if λ = λ*, has at least one positive solution if λ = λ*, and has no positive solution if λ = λ*. To prove the result we establish a special strong comparison principle for the Neumann problems. The research was supported by the National Natural Science Foundation of China 10371052,10671084).  相似文献   

12.
The concept of a hemisystem of a generalised quadrangle has its roots in the work of B. Segre, and this term is used here to denote a set of points such that every line meets in half of the points of . If one takes the point-line geometry on the points of the hemisystem, then one obtains a partial quadrangle and hence a strongly regular point graph. The only previously known hemisystems of generalised quadrangles of order (q, q 2) were those of the elliptic quadric , q odd. We show in this paper that there exists a hemisystem of the Fisher–Thas–Walker–Kantor generalised quadrangle of order (5, 52), which leads to a new partial quadrangle. Moreover, we can construct from our hemisystem the 3· A 7-hemisystem of , first constructed by Cossidente and Penttila.   相似文献   

13.
In this paper, we consider a set of lines of with the properties that (1) every plane contains 0, 1 or q + 1 elements of , (2) every solid contains no more than q 2 + q + 1 and no less than q + 1 elements of , and (3) every point of is on q + 1 members of , and we show that, whenever (4) q ≠ 2 (respectively, q = 2) and the lines of through some point are contained in a solid (respectively, a plane), then is necessarily the set of lines of a regularly embedded split Cayley generalized hexagon in , with q even. We present examples of such sets not satisfying (4) based on a Singer cycle in , for all q.   相似文献   

14.
A maximal partial Hamming packing of is a family of mutually disjoint translates of Hamming codes of length n, such that any translate of any Hamming code of length n intersects at least one of the translates of Hamming codes in . The number of translates of Hamming codes in is the packing number, and a partial Hamming packing is strictly partial if the family does not constitute a partition of . A simple and useful condition describing when two translates of Hamming codes are disjoint or not disjoint is proved. This condition depends on the dual codes of the corresponding Hamming codes. Partly, by using this condition, it is shown that the packing number p, for any maximal strictly partial Hamming packing of , n = 2 m −1, satisfies . It is also proved that for any n equal to 2 m −1, , there exist maximal strictly partial Hamming packings of with packing numbers n−10,n−9,n−8,...,n−1. This implies that the upper bound is tight for any n = 2 m −1, . All packing numbers for maximal strictly partial Hamming packings of , n = 7 and 15, are found by a computer search. In the case n = 7 the packing number is 5, and in the case n = 15 the possible packing numbers are 5,6,7,...,13 and 14.   相似文献   

15.
For a given hypersurface ψ in PG(n, 2), with equation Q(x) = 0, where Q is a polynomial of (reduced) degree d > 1, a definition is given of the ψ-associate X # of a flat X in PG(n, 2). The definition involves the fully polarized form of the polynomial Q; in the cubic case d = 3 it reads: X # = {z ∈ PG(n, 2) | T(x, y, z) = 0 for all x, yX}, where T(x, y, z) denotes the alternating trilinear form obtained by completely polarizing Q. Some general results, valid for any degree d and projective dimension n, are first expounded. Thereafter several choices of ψ are visited, but for each choice just a few aspects are highlighted. Despite the partial nature of the survey quite a variety of behaviours of the ψ-associate are uncovered. Many of the choices of ψ which are considered are of cubic hypersurfaces in PG(5, 2). If ψ is the Segre variety it is shown that the 48 planes external to fall into eight pairs of ordered triplets {(P 1, R 1, S 1), (P 2, R 2, S 2)} such that and . Further those lines L of PG(5, 2) which are singular, satisfying that is L # = PG(5.2), are in this case shown to form a complete spread of 21 lines. Another result of note arises in the case where ψ is the underlying 35-set of a non-maximal partial spread Σ5 of five planes in PG(5, 2), where it is shown that one plane is singled out by the property that every line is singular.   相似文献   

16.
Let Λ be an algebraic set and let (n is even) be a polynomial mapping such that for each there is r(λ) > 0 such that the mapping g λ  =  g(· , λ) restricted to the sphere S n (r) is an immersion for every 0  <  r  <  r (λ), so that the intersection number I(g λ|S n (r)) is defined. Then is an algebraically constructible function. I. Karolkiewicz and A. Nowel supported by the grant BW/5100-5-0286-7.  相似文献   

17.
In the geometric setting of commuting orthogonal and unitary polarities we construct an infinite family of complete (q + 1)2–spans of the Hermitian surface , q odd. A construction of an infinite family of minimal blocking sets of , q odd, admitting PSL 2(q), is also provided.   相似文献   

18.
The simple incidence structure , formed by the points and the unordered pairs of distinct parallel lines of a finite affine plane of order n > 4, is a 2 – (n 2,2n,2n–1) design with intersection numbers 0,4,n. In this paper, we show that the converse is true, when n ≥ 5 is an odd integer. Supported by M.I.U.R., Università di Palermo.  相似文献   

19.
We construct an embedding of the Ree–Tits generalized octagon defined over a field K in a 51-dimensional projective space over K arising from a 52-dimensional Lie algebra J of type . This construction derives from a quadratic map (related to a ‘standard’ duality of ) from the 26-dimensional module (see K. Coolsaet, Adv Geometry, to appear) into J. (This embedding is full if and only if K is a perfect field.) We provide explicit formulas for the coordinates of the points of the octagon in this embedding, in terms of their Van Maldeghem coordinates. We apply these results to compute the dimensions of subspaces generated by various special subsets of points of the octagon: the sets of points at a fixed distance from a given point or a given line and the Suzuki suboctagons. The results depend on whether K is the field of 2 elements, or not.   相似文献   

20.
Here, we solve non-convex, variational problems given in the form
where u ∈ (W 1,∞(0, 1)) k and is a non-convex, coercive polynomial. To solve (1) we analyse the convex hull of the integrand at the point a, so that we can find vectors and positive values λ1, . . . , λ N satisfying the non-linear equation
Thus, we can calculate minimizers of (1) by following a proposal of Dacorogna in (Direct Methods in the Calculus of Variations. Springer, Heidelberg, 1989). Indeed, we can solve (2) by using a semidefinite program based on multidimensional moments. We dedicate this work to our colleague Jesús Bermejo.  相似文献   

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

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