首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 671 毫秒
1.
It can reflect the nature of approximate reasoning and meet more application expectations to design the approximate reasoning matching schemes and the corresponding algorithms with similarity relation Q instead of equivalence relation R. In this paper, based on similarity relation Q, we introduce type V matching scheme and corresponding approximate reasoning type V Q-algorithm with the given input A* and knowledge AB. Besides, we present completeness of type V and its perfection on knowledge base K in Q-logic ℂ Q in this paper.  相似文献   

2.
Brouwer, Godsil, Koolen and Martin [Width and dual width of subsets in polynomial association schemes, J. Combin. Theory Ser. A 102 (2003) 255-271] introduced the width w and the dual width w* of a subset in a distance-regular graph and in a cometric association scheme, respectively, and then derived lower bounds on these new parameters. For instance, subsets with the property w+w*=d in a cometric distance-regular graph with diameter d attain these bounds. In this paper, we classify subsets with this property in Grassmann graphs, bilinear forms graphs and dual polar graphs. We use this information to establish the Erd?s-Ko-Rado theorem in full generality for the first two families of graphs.  相似文献   

3.
A number of important families of association schemes—such as the Hamming and Johnson schemes—enjoy the property that, in each member of the family, Delsarte t-designs can be characterised combinatorially as designs in a certain partially ordered set attached to the scheme. In this paper, we extend this characterisation to designs in a product association scheme each of whose components admits a characterisation of the above type. As a consequence of our main result, we immediately obtain linear programming bounds for a wide variety of combinatorial objects as well as bounds on the size and degree of such designs analogous to Delsarte's bounds for t-designs in Q-polynomial association schemes.  相似文献   

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

5.
It is proved that ifX is a connected locally continuumwise connected coanalytic nowhere topologically complete space, then the hyperspace 2 X of all nonempty compact subsets ofX is strongly universal in the class of all coanalytic spaces. Moreover, 2 X is homeomorphic to Π2 ifX is a Baire space, and toQ∖Π1 ifX contains a dense absoluteG δ-setGX such that the intersectionGU is connected for any open connectedUX. (Here Π1, Π1X are the standard subsets of the Hilbert cubeQ absorbing for the classes of analytic and coanalytic spaces, respectively.) Similar results are obtained for higher projective classes. Translated fromMatematicheskie Zametki, Vol. 62, No. 1, pp. 35–51, July, 1997. Translated by O. V. Sipacheva  相似文献   

6.
“A Calculus of Sequences” started in 1936 by Ward constitutes the general scheme for extensions of classical operator calculus of Rota—Mullin considered by many afterwards and after Ward. Because of the notation we shall call the Ward's calculus of sequences in its afterwards elaborated form—a ψ-calculus. The ψ-calculus in parts appears to be almost automatic, natural extension of classical operator calculus of Rota—Mullin or equivalently—of umbral calculus of Roman and Rota. At the same time this calculus is an example of the algebraization of the analysis—here restricted to the algebra of polynomials. Many of the results of ψ-calculus may be extended to Markowsky Q-umbral calculus where Q stands for a generalized difference operator, i.e. the one lowering the degree of any polynomial by one. This is a review article based on the recent first author contributions [1]. As the survey article it is supplemented by the short indicatory glossaries of notation and terms used by Ward [2], Viskov [7, 8], Markowsky [12], Roman [28–32] on one side and the Rota-oriented notation on the other side [9–11, 1, 3, 4, 35] (see also [33]).  相似文献   

7.
It is shown that an association schemeY=(X, {R i }0⩽id ), in which the parameters coincide with those of the scheme Her(d, 2) of Hermitian forms ind-dimensional space over GF(22), is isomorphic to Her(d, 2). A principal role in the proof is played by a theorem by P. Terwilliger on the number of 4-vertex configurations of a given type in (P andQ)-polynomial association schemes. Some partial results are obtained in the case of an arbitrary finite field.  相似文献   

8.
We characterize that the image of the embedding of the Q ‐polynomial association scheme into the first eigenspace by primitive idempotent E 1 is a spherical t‐design in terms of the Krein numbers. Furthermore, we show that the strengths of P‐ and Q‐polynomial schemes as spherical designs are bounded by a constant. Copyright © 2011 John Wiley & Sons, Ltd. 19:167‐177, 2011  相似文献   

9.
For a 0-dimensional schemeX on a smooth quadricQ we define a special type of resolution of its ideal sheaf as a locally freeO Q. These resolutions allow to find, for schemes which are generic inQ, the minimal free resolution ofX as a subscheme of ℙ3. For almost all such schemes the graded Betti numbers in ℙ3 depend only on the Hilbert function ofX in ℙ3. Work done with financial support of M.U.R.S.T., while the authors were members of C.N.R.  相似文献   

10.
Let each point of a homogeneous Poisson process in ℝ d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution μ on the positive integers. We consider translation-invariant schemes for perfectly matching the stubs to obtain a simple graph with degree distribution μ. Leaving aside degenerate cases, we prove that for any μ there exist schemes that give only finite components as well as schemes that give infinite components. For a particular matching scheme which is a natural extension of Gale–Shapley stable marriage, we give sufficient conditions on μ for the absence and presence of infinite components.  相似文献   

11.
The notion of designs in an association scheme is defined algebraically by Delsarte [4]. It is known that his definition of designs has a geometric interpretation for known (P andQ)-polynomial association schemes except three examples. In this paper we give a geometric interpretation of designs in an association scheme of alternating bilinear forms, which is one of the three.  相似文献   

12.
We introduce a method for studying commutative association schemes with many vanishing intersection numbers and/or Krein parameters, and apply the method to the P- and Q-polynomial schemes. Let Y denote any commutative association scheme, and fix any vertex x of Y. We introduce a non-commutative, associative, semi-simple -algebra T = T(x) whose structure reflects the combinatorial structure of Y. We call T the subconstituent algebra of Y with respect to x. Roughly speaking, T is a combinatorial analog of the centralizer algebra of the stabilizer of x in the automorphism group of Y.In general, the structure of T is not determined by the intersection numbers of Y, but these parameters do give some information. Indeed, we find a relation among the generators of T for each vanishing intersection number or Krein parameter.We identify a class of irreducible T-moduIes whose structure is especially simple, and say the members of this class are thin. Expanding on this, we say Y is thin if every irreducible T(y)-module is thin for every vertex y of Y. We compute the possible thin, irreducible T-modules when Y is P- and Q-polynomial. The ones with sufficiently large dimension are indexed by four bounded integer parameters. If Y is assumed to be thin, then sufficiently large dimension means dimension at least four.We give a combinatorial characterization of the thin P- and Q-polynomial schemes, and supply a number of examples of these objects. For each example, we show which irreducible T-modules actually occur.We close with some conjectures and open problems.  相似文献   

13.
We endow any proper A-convex H*-algebra (E, τ) with a locally pre-C*-topology. The latter is equivalent to that introduced by the pre C*-norm given by Ptàk function when (E, τ) is a Q-algebra. We also prove that the algebra of complex numbers is the unique proper locally A-convex H*-algebra which is barrelled and Q-algebra.   相似文献   

14.
We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.  相似文献   

15.
A set Δ of vertices of a generalized quadrangle of order (s, t) is said to be a hyperoval if any line intersects Δ in either 0, or 2 points. A hyperoval Δ is called an affine ovoid if |Δ|=2st. It is well known that μ-subgraphs in triangular extensions of generalized quadrangles are hyperovals. In the present paper we prove that ifS is a triangular extension forGQ(s, t) with totally regular point graph Γ such that μ=2st, thens is even, Γ is an τ-antipodal graph of diameter 3 with τ=1+s/2, and eithers=2, ort=s+2. Translated fromMatematicheskie Zametki, Vol. 68, No. 2, pp. 266–271, August, 2000.  相似文献   

16.
This is the continuation of an article from the previous issue. In this part, we focus on the thin P- and Q-polynomial association schemes. We provide some combinatorial characterizations of these objects and exhibit the known examples with diameter at least 6. For each example, we give the irreducible modules for the subconstituent algebra. We close with some conjectures and open problems.  相似文献   

17.
A finite group G is of central type (in the non-classical sense) if it admits a non-degenerate cohomology class [c] ∈ H 2(G, ℂ*) (G acts trivially on ℂ*). Groups of central type play a fundamental role in the classification of semisimple triangular complex Hopf algebras and can be determined by their representation-theoretical properties. Suppose that a finite group Q acts on an abelian group A so that there exists a bijective 1-cocycle π ∈ Z 1(Q,Ǎ), where Ǎ = Hom(A, ℂ*) is endowed with the diagonal Q-action. Under this assumption, Etingof and Gelaki gave an explicit formula for a non-degenerate 2-cocycle in Z 2(G, ℂ*), where G:= A × Q. Hence, the semidirect product G is of central type. In this paper, we present a more general correspondence between bijective and non-degenerate cohomology classes. In particular, given a bijective class [π] ∈ H 1(Q,Ǎ) as above, we construct non-degenerate classes [cπ] ∈ H 2(G,ℂ*) for certain extensions 1 → A → G → Q → 1 which are not necessarily split. We thus strictly extend the above family of central type groups.  相似文献   

18.
The purpose of this paper is to investigate the refinement equations of the form
where the vector of functions ϕ=(ϕ 1..., ϕ r ) T is in (L p (ℝ s )) r , 1⩽p⩽∞, a(α), α∈ℤ s is a finitely supported sequence of r × r matrices called the refinement mask, and M is an s × s integer matrix such that lim→∞ M-n = 0. In order to solve the refinement equation mentioned above, we start with a vector of compactly supported functions φ 0∈(L p (ℝ s )) r and use the iteration schemes f n :=Q a n φ 0, n=1,2,..., where Q n is the linear operator defined on (L p (ℝ s )) r given by
This iteration scheme is called a subdivision scheme or cascade algorithm. In this paper, we characterize the Lp-convergence of subdivision schemes in terms of the p-norm joint spectral radius of a finite collection of some linear operators determined by the sequence a and the set B restricted to a certain invariant subspace, where the set B is a complete set of representatives of the distinct cosets of the quotient group ℤs/Mℤs containing 0.  相似文献   

19.
We study Σ-definability of countable models over hereditarily finite {ie193-01} superstructures over the field ℝ of reals, the field ℂ of complex numbers, and over the skew field ℍ of quaternions. In particular, it is shown that each at most countable structure of a finite signature, which is Σ-definable over {ie193-02} with at most countable equivalence classes and without parameters, has a computable isomorphic copy. Moreover, if we lift the requirement on the cardinalities of the classes in a definition then such a model can have an arbitrary hyperarithmetical complexity, but it will be hyperarithmetical in any case. Also it is proved that any countable structure Σ-definable over {ie193-03}, possibly with parameters, has a computable isomorphic copy and that being Σ-definable over {ie193-04} is equivalent to being Σ-definable over {ie193-05}. Supported by RFBR-DFG, grant No. 06-01-04002 DFGa. __________ Translated from Algebra i Logika, Vol. 47, No. 3, pp. 335–363, May–June, 2008.  相似文献   

20.
For any topological spaceT, S. Mrówka has defined Exp (T) to be the smallest cardinal κ (if any such cardinals exist) such thatT can be embedded as a closed subset of the productN κ of κ copies ofN (the discrete space of cardinality ℵ0). We prove that forQ, the space of the rationals with the inherited topology, Exp (Q) is equal to a certain covering number, and we show that by modifying some earlier work of ours it can be seen that it is consistent with the usual axioms of set theory including the choice that this number equal any uncountable regular cardinal less than or equal to 2 0. Mrówka has also defined and studied the class ℳ={κ: Exp (N κ)=κ} whereN κ is the discrete space of cardinality κ. It is known that the first cardinal not in ℳ must not only be inaccessible but cannot even belong to any of the first ω Mahlo classes. However, it is not known whether every cardinal below 2 0 is contained in ℳ. We prove that if there exists a maximal family of almost-disjoint subsets ofN of cardinality κ, then κ∈ℳ, and we then use earlier work to prove that if it is consistent that there exist cardinals which are not in the first ω Mahlo classes, then it is consistent that there exist such cardinals below 2 0 and that ℳ nevertheless contain all cardinals no greater than 2 0. Finally, we consider the relationship between ℳ and certain “large cardinals”, and we prove, for example, that if μ is any normal measure on a measurable cardinal, then μ(ℳ)=0.  相似文献   

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

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