首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are to determine which groups contain a linking system of difference sets, and how large such a system can be. All previous constructive results for linking systems of difference sets are restricted to 2‐groups. We use an elementary projection argument to show that neither the McFarland/Dillon nor the Spence construction of difference sets can give rise to a linking system of difference sets in non‐2‐groups. We make a connection to Kerdock and bent sets, which provides large linking systems of difference sets in elementary abelian 2‐groups. We give a new construction for linking systems of difference sets in 2‐groups, taking advantage of a previously unrecognized connection with group difference matrices. This construction simplifies and extends prior results, producing larger linking systems than before in certain 2‐groups, new linking systems in other 2‐groups for which no system was previously known, and the first known examples in nonabelian groups.  相似文献   

2.
Plateaued functions on finite fields have been studied in many papers in recent years. As a generalization of plateaued functions on finite fields, we introduce the notion of a plateaued function on a finite abelian group. We will give a characterization of a plateaued function in terms of an equation of the matrix associated to the function. Then we establish a one‐to‐one correspondence between the Z 2 ‐valued plateaued functions and partial geometric difference sets (with specific parameters) in finite abelian groups. We will also discuss two general methods (extension and lifting) for the construction of new partial geometric difference sets from old ones in (abelian or nonabelian) finite groups, and construct many partial geometric difference sets and plateaued functions. A one‐to‐one correspondence between partial geometric difference sets (in arbitrary finite groups) and partial geometric designs will be proved.  相似文献   

3.
In this paper, we consider regular automorphism groups of graphs in the RT2 family and the Davis‐Xiang family and amorphic abelian Cayley schemes from these graphs. We derive general results on the existence of non‐abelian regular automorphism groups from abelian regular automorphism groups and apply them to the RT2 family and Davis‐Xiang family and their amorphic abelian Cayley schemes to produce amorphic non‐abelian Cayley schemes.  相似文献   

4.
We show that under the self-conjugacy condition a McFarland difference set withp=2 andf2 in an abelian groupGcan only exist, if the exponent of the Sylow 2-subgroup does not exceed 4. The method also works for oddp(where the exponent bound ispand is necessary and sufficient), so that we obtain a unified proof of the exponent bounds for McFarland difference sets. We also correct a mistake in the proof of an exponent bound for (320, 88, 24)-difference sets in a previous paper.  相似文献   

5.
On a conjecture of Ma   总被引:1,自引:0,他引:1  
In this paper, we prove a result concerning a conjecture of Ma from diophantine equations, which is connected to an open problem on abelian difference sets of multiplier ?1.  相似文献   

6.
给定一个斯泰纳或柯克曼三元系,介绍其大集的生成方法;得到其大集存在条件的判据是一个位差各异的循环数;柯克曼三元系其大集判据是,不能分解的柯克曼三元系有大集,能分解的无大集.  相似文献   

7.
To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. In this article we prove a sufficient numerical condition on the splice diagram for a graph manifold to be a singularity link. We also show that if two manifolds have the same splice diagram, then their universal abelian covers are homeomorphic. To prove the last theorem we have to generalize our notions to orbifolds.  相似文献   

8.
A triple array is a row-column design which carries two balanced incomplete block designs (BIBDs) as substructures. McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005), Section 8, gave one example of a triple array that also carries a third BIBD, formed by its row-column intersections. This triple array was said to be balanced for intersection, and they made a search for more such triple arrays among all potential parameter sets up to some limit. No more examples were found, but some candidates with suitable parameters were suggested. We define the notion of an inner design with respect to a block for a symmetric BIBD and present criteria for when this inner design can be balanced. As triple arrays in the canonical case correspond to SBIBDs, this in turn yields new existence criteria for triple arrays balanced for intersection. In particular, we prove that the residual design of the related SBIBD with respect to the defining block must be quasi-symmetric, and give necessary and sufficient conditions on the intersection numbers. This, together with our parameter bounds enable us to exclude the suggested triple array candidates in McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005) and many others in a wide search. Further we investigate the existence of SBIBDs whose inner designs are balanced with respect to every block. We show as a key result that such SBIBDs must possess the quasi-3 property, and we answer the existence question for all known classes of these designs.  相似文献   

9.
We give a necessary and sufficient condition in terms of a matrix for which all Tate classes are Lefschetz for simple abelian varieties over an algebraic closure of a finite field. As an application, we prove under an assumption that all Tate classes are Lefschetz for simple factors of the Jacobian variety of a Fermat curve of prime degree.  相似文献   

10.
We investigate the continuity of solutions for general nonlinear parabolic equations with non‐standard growth near a nonsmooth boundary of a cylindrical domain. We prove a sufficient condition for regularity of a boundary point.  相似文献   

11.
We investigate group-theoretic “signatures” of odd cycles of a graph, and their connections to topological obstructions to 3-colourability. In the case of signatures derived from free groups, we prove that the existence of an odd cycle with trivial signature is equivalent to having the coindex of the hom-complex at least 2 (which implies that the chromatic number is at least 4). In the case of signatures derived from elementary abelian 2-groups we prove that the existence of an odd cycle with trivial signature is a sufficient condition for having the index of the hom-complex at least 2 (which again implies that the chromatic number is at least 4).  相似文献   

12.
In this paper we either prove the non‐existence or give explicit construction of primitive symmetric (v, k, λ) designs with v=pm<2500, p prime and m>1. The method of design construction is based on an automorphism group action; non‐existence results additionally include the theory of difference sets, multiplier theorems in particular. The research involves programming and wide‐range computations. We make use of software package GAP and the library of primitive groups which it contains. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 141–154, 2010  相似文献   

13.
It is wellknown that the technique of character sums together with the tools of algebraic number theory is the adequate method for the study of difference sets in abelian groups, compare for instance Ott [5] or Turyn [6]. In this paper we use this method to prove a new non-existence theorem for certain difference sets in abelian groups of order rpa rp^a , where r 1 2 r \neq 2 and p are distinct primes.  相似文献   

14.
We develop deformation theory for abelian invariant complexstructures on a nilmanifold, and prove that in this case theinvariance property is preserved by the Kuranishi process. Apurely algebraic condition characterizes the deformations leadingagain to abelian structures, and we prove that such deformationsare unobstructed. Various examples illustrate the resultingtheory, and the behavior possible in three complex dimensions.  相似文献   

15.
Linked systems of symmetric designs are equivalent to 3-class Q-antipodal association schemes. Only one infinite family of examples is known, and this family has interesting origins and is connected to important applications. In this paper, we define linking systems, collections of difference sets that correspond to systems of linked designs, and we construct linking systems in a variety of nonelementary abelian groups using Galois rings, partial difference sets, and a product construction. We include some partial results in the final section.  相似文献   

16.
A semiregular relative difference set (RDS) in a finite group E which avoids a central subgroup C is equivalent to a cocycle which satisfies an additional condition, called orthogonality. However the basic equivalence relation, cohomology, on cocycles, does not preserve orthogonality, leading to the perception that orthogonality is essentially a combinatorial property. We show this perception is false by discovering a natural atomic structure within cohomology classes, which discriminates between orthogonal and non‐orthogonal cocycles. This atomic structure is determined by an action we term the shift action of the group G = E/C on cocycles, which defines a stronger equivalence relation on cocycles than cohomology. We prove that for each triple (C, E, G), the set of equivalence classes of semiregular RDS in E relative to C is in one to one correspondence with the set of shift‐orbits of the (Aut(C) × Aut(G))‐orbits of orthogonal cocycles. This determines a new algorithm for detecting and classifying central semiregular RDS. We demonstrate it, and propose a 7‐parameter classification scheme for equivalence classes of central semiregular relative difference sets. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 330–346, 2000  相似文献   

17.
A back and forth condition on interpretations for those second‐order languages without functional variables whose non‐logical vocabulary is finite and excludes functional constants is presented. It is shown that this condition is necessary and sufficient for the interpretations to be equivalent in the language. When applied to second‐order languages with an infinite non‐logical vocabulary, excluding functional constants, the back and forth condition is sufficient but not necessary. It is shown that there is a class of infinitary second‐order languages whose non‐logical vocabulary is infinite for which the back and forth condition is both necessary and sufficient. It is also shown that some applications of the back and forth construction for second‐order languages can be extended to the infinitary second‐order languages. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

18.
We investigate crossed products of Cuntz algebras by quasi-free actions of abelian groups. We prove that our algebras are AF-embeddable when actions satisfy a certain condition. We also give a necessary and sufficient condition that our algebras become simple and purely infinite, and consequently our algebras are either purely infinite or AF-embeddable when they are simple.  相似文献   

19.
We formulate a version of the Pompeiu problem in the discrete group setting. Necessary and sufficient conditions are given for a finite collection of finite subsets of a discrete abelian group, whose torsion free rank is less than the cardinal of the continuum, to have the Pompeiu property. We also prove a similar result for nonabelian free groups. A sufficient condition is given that guarantees the harmonicity of a function on a nonabelian free group if it satisfies the mean-value property over two spheres.  相似文献   

20.
In this paper, we classify frame wavelet sets and frame scaling function sets in higher dimensions. Firstly, we obtain a necessary condition for a set to be the frame wavelet sets. Then, we present a necessary and sufficient condition for a set to be a frame scaling function set. We give a property of frame scaling function sets, too. Some corresponding examples are given to prove our theory in each section.  相似文献   

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

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