首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square-type graphs and whose underlying set is a nonelementary abelian 2-group. We give a simple proof of a result of Hamilton that generalizes Brouwer's result. We use multiple distinct quadratic forms to construct amorphic association schemes with a large number of classes.  相似文献   

2.
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.  相似文献   

3.
A partial difference set (PDS) having parameters (n2, r(n?1), n+r2?3r, r2?r) is called a Latin square type PDS, while a PDS having parameters (n2, r(n+1), ?n+r2+3r, r2 +r) is called a negative Latin square type PDS. There are relatively few known constructions of negative Latin square type PDSs, and nearly all of these are in elementary abelian groups. We show that there are three different groups of order 256 that have all possible negative Latin square type parameters. We then give generalized constructions of negative Latin square type PDSs in 2‐groups. We conclude by discussing how these results fit into the context of amorphic association schemes and by stating some open problems. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 266‐282, 2009  相似文献   

4.
5.
A partial difference set having parameters (n 2, r(n − 1), n + r 2 − 3r, r 2r) is called a Latin square type partial difference set, while a partial difference set having parameters (n 2, r(n + 1), − n + r 2 + 3r, r 2 + r) is called a negative Latin square type partial difference set. Nearly all known constructions of negative Latin square partial difference sets are in elementary abelian groups. In this paper, we develop three product theorems that construct negative Latin square type partial difference sets and Latin square type partial difference sets in direct products of abelian groups G and G′ when these groups have certain Latin square or negative Latin square type partial difference sets. Using these product theorems, we can construct negative Latin square type partial difference sets in groups of the form where the s i are nonnegative integers and s 0 + s 1 ≥ 1. Another significant corollary to these theorems are constructions of two infinite families of negative Latin square type partial difference sets in 3-groups of the form for nonnegative integers s i . Several constructions of Latin square type PDSs are also given in p-groups for all primes p. We will then briefly indicate how some of these results relate to amorphic association schemes. In particular, we construct amorphic association schemes with 4 classes using negative Latin square type graphs in many nonelementary abelian 2-groups; we also use negative Latin square type graphs whose underlying sets can be elementary abelian 3-groups or nonelementary abelian 3-groups to form 3-class amorphic association schemes.   相似文献   

6.
7.
8.
In this paper, we give a new class of association schemes whose thin residues are isomorphic to an elementary abelian p-group of order p2. We then study the automorphism groups of these schemes and determine whether these schemes are schurian.  相似文献   

9.
10.
11.
The Ryser Conjecture which states that there is a transversal of size n in a Latin square of odd order n is equivalent to finding a rainbow matching of size n in a properly edge-colored Kn,n using n colors when n is odd. Let δ be the minimum degree of a graph. Wang proposed a more general question to find a function f(δ) such that every properly edge-colored graph of order f(δ) contains a rainbow matching of size δ, which currently has the best bound of f(δ)3.5δ+2 by Lo. Babu, Chandran and Vaidyanathan investigated Wang’s question under a stronger color condition. A strongly edge-colored graph is a properly edge-colored graph in which every monochromatic subgraph is an induced matching. Wang, Yan and Yu proved that every strongly edge-colored graph of order at least 2δ+2 has a rainbow matching of size δ. In this note, we extend this result to graphs of order at least 2δ+1.  相似文献   

12.
The group PGL(2,q) has an embedding into PGL(3,q) such that it acts as the group fixing a nonsingular conic in PG(2,q). This action affords a coherent configuration (q) on the set (q) of non-tangent lines of the conic. We show that the relations can be described by using the cross-ratio. Our results imply that the restrictions +(q) and (q) of (q) to the set +(q) of secant (hyperbolic) lines and to the set (q) of exterior (elliptic) lines, respectively, are both association schemes; moreover, we show that the elliptic scheme (q) is pseudocyclic.We further show that the coherent configurations (q 2) with q even allow certain fusions. These provide a 4-class fusion of the hyperbolic scheme +(q 2), and 3-class fusions and 2-class fusions (strongly regular graphs) of both schemes +(q 2) and (q 2). The fusion results for the hyperbolic case are known, but our approach here as well as our results in the elliptic case are new.  相似文献   

13.
In this paper we enumerate essentially all non-symmetric association schemes with three classes, less than 96 vertices and with a regular group of automorphisms. The enumeration is based on a computer search in Schur rings. The most interesting cases have 64 vertices.In one primitive case and in one imprimitive case where no association scheme was previously known we find several new association schemes. In one other imprimitive case with 64 vertices we find association schemes with an automorphism group of rank 4, which was previously assumed not to be possible.  相似文献   

14.
We extend the enumeration of regular linear spaces in 1 to at most 19 points. In addition, one of the 5 missing cases in the previous list is settled. The number of regular linear spaces of type (15|215,330) is 10,177,328. © 2005 Wiley Periodicals, Inc. J Combin Designs.  相似文献   

15.
By using the links between generalized roundness, negative type inequalities and equivariant Hilbert space compressions, we obtain that the generalized roundness of the usual Cayley graph of finitely generated free groups and free abelian groups of rank  ≥ 2 equals 1. This answers a question of J-F. Lafont and S. Prassidis.   相似文献   

16.
高锁刚  王仰贤 《东北数学》2003,19(3):235-243
By using nondegenerate and degenerate quadrics in projective space over finite fields of characteristic 2, some association schemes were constructed and their parameters were computed by the authors (see Adv. in Math., 3(2000), 120-128 and Acta Math. Appl. Sinica, 1(1999), 96-103). In this note, their polynomial properties, eigenmatrices, imprimitivities, association subschemes and related quotient association schemes are studied.  相似文献   

17.
A ring is said to be right (resp., left) regular-duo if every right (resp., left) regular element is regular. The structure of one-sided regular elements is studied in various kinds of rings, especially, upper triangular matrix rings over one-sided Ore domains. We study the structure of (one-sided) regular-duo rings, and the relations between one-sided regular-duo rings and related ring theoretic properties.  相似文献   

18.
具有某种断面的半群的研究进展   总被引:1,自引:0,他引:1  
汪立民 《数学进展》2002,31(6):485-494
本文综述了几类具有特殊断面的半群的近期研究结果。在介绍逆半群和正则半群的一般结构之后,概述了具有逆断面的正则半群的结构和同余格的研究成果。总结了作为逆断面的推广的可裂断面,纯正断面,正则^*-断面和恰当断面。提出了可以进一步研究的重要的问题。  相似文献   

19.
In this study, a classical spectral-finite difference scheme (SFDS) for the three-dimensional (3D) parabolic equation is reduced by using proper orthogonal decomposition (POD) and singular value decomposition (SVD). First, the 3D parabolic equation is discretized in spatial variables by using spectral collocation method and the discrete scheme is transformed into matrix formulation by tensor product. Second, the classical SFDS is obtained by difference discretization in time-direction. The ensemble of data are comprised with the first few transient solutions of the classical SFDS for the 3D parabolic equation and the POD bases of ensemble of data are generated by using POD technique and SVD. The unknown quantities of the classical SFDS are replaced with the linear combination of POD bases and a reducedorder extrapolation SFDS with lower dimensions and sufficiently high accuracy for the 3D parabolic equation is established. Third, the error estimates between the classical SFDS solutions and the reduced-order extrapolation SFDS solutions and the implementation for solving the reduced-order extrapolation SFDS are provided. Finally, a numerical example shows that the errors of numerical computations are consistent with the theoretical results. Moreover, it is shown that the reduced-order extrapolation SFDS is effective and feasible to find the numerical solutions for the 3D parabolic equation.  相似文献   

20.
Let(X,p,μ)d,θ be a space of homogeneous type,(?) ∈(0,θ],|s|<(?) andmax{d/(d+(?)),d/(d+s+(?))}<q≤∞.The author introduces the new Triebel-Lizorkin spaces (?)_∞q~s(X) and establishes the framecharacterizations of these spaces by first establishing a Plancherel-P(?)lya-type inequalityrelated to the norm of the spaces (?)_∞q~s(X).The frame characterizations of the Besovspace (?)_pq~s(X) with|s|<(?),max{d/(d+(?)),d/(d+s+(?))}<p≤∞ and 0<q≤∞and the Triebel-Lizorkin space (?)_pq~s(X)with|s|<(?),max{d/(d+(?)),d/(d+s+(?))}<p<∞ and max{d/(d+(?)),d/(d+s+(?))}<q≤∞ are also presented.Moreover,the au-thor introduces the new TriebeI-Lizorkin spaces b(?)_∞q~s(X) and H(?)_∞q~s(X) associated to agiven para-accretive function b.The relation between the space b(?)_∞q~s(X) and the spaceH(?)_∞q~s(X) is also presented.The author further proves that if s=0 and q=2,thenH(?)_∞q~s(X)=(?)_∞q~s(X),which also gives a new characterization of the space BMO(X),since (?)_∞q~s(X)=BMO(X).  相似文献   

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

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