首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 921 毫秒
1.
Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??1 and ??2, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??1 or ??2, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??1 or ??2. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, ti (0 ≤ id) satisfy (s, t2, t3) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006  相似文献   

2.
Let S be a semigroup and s,tS. We say that t is an associate of s if s=sts. If S has a maximal subgroup G such that every element s of S has a unique associate in G, say s , we say that G is an associate subgroup of S and consider the mapping ss as a unary operation on S. In this way, semigroups with an associate subgroup may be identified with unary semigroups satisfying three simple axioms. Among them, only those satisfying the identity (st)=t s , called medial, have a structure theorem, due to Blyth and Martins.  相似文献   

3.
Let A be an Artin group with standard generating set {σ s :sS}. Tits conjectured that the only relations in A amongst the squares of the generators are consequences of the obvious ones, namely that σ s 2 and σ t 2 commute whenever σ s and σ t commute, for s,tS. In this paper we prove Tits’ conjecture for all Artin groups. In fact, given a number m s ≥2 for each sS, we show that the elements {T s s ms :sS} generate a subgroup that has a finite presentation in which the only defining relations are that T s and T t commute if σ s and σ t commute. Oblatum 21-III-2000 & 1-XII-2000?Published online: 5 March 2001  相似文献   

4.
We examine, from a constructive perspective, the relation between the complements of S, T, and ST in X, where X is either a metric space or a normed linear space. The fundamental question addressed is: If x is distinct from each element of ST, if s ? S, and if t ? T, is x distinct from s or from t? Although the classical answer to this question is trivially affirmative, constructive answers involve Markov's principle and the completeness of metric spaces. Mathematics Subject Classification: 03F65, 46S30.  相似文献   

5.
Let S be a compact set in R 2. For S simply connected, S is a union of two starshaped sets if and only if for every F finite, F bdry S, there exist a set G bdry S arbitrarily close to F and points s, t depending on G such that each point of G is clearly visible via S from one of s, t. In the case where S has at most finitely many components, the necessity of the condition still holds while the sufficiency fails.  相似文献   

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

7.
Let S be a simply connected orthogonal polygon in and let P(S) denote the intersection of all maximal starshaped via staircase paths orthogonal subpolygons in S. Our result: if , then there exists a maximal starshaped via staircase paths orthogonal polygon , such that . As a corollary, P(S) is a starshaped (via staircase paths) orthogonal polygon or empty. The results fail without the requirement that the set S is simply connected. Received 1 March 1999.  相似文献   

8.
Let S = (P, B, I) be a generalized quadrangle of order (s, t). For x, y P, x y, let (x, y) be the group of all collineations of S fixing x and y linewise. If z {x, y}, then the set of all points incident with the line xz (resp. yz) is denoted by (resp. ). The generalized quadrangle S = (P, B, I) is said to be (x, y)-transitive, x y, if (x, y) is transitive on each set and . If S = (P, B, I) is a generalized quadrangle of order (s, t), s > 1 and t > 1, which is (x, y)-transitive for all x, y P with x y, then it is proved that we have one of the following: (i) S W(s), (ii) S Q(4, s), (iii) S H(4, s), (iv) S Q(5, s), (v) s = t2 and all points are regular.  相似文献   

9.
Given two graphs G and H, let f(G,H) denote the minimum integer n such that in every coloring of the edges of Kn, there is either a copy of G with all edges having the same color or a copy of H with all edges having different colors. We show that f(G,H) is finite iff G is a star or H is acyclic. If S and T are trees with s and t edges, respectively, we show that 1+s(t?2)/2≤f(S,T)≤(s?1)(t2+3t). Using constructions from design theory, we establish the exact values, lying near (s?1)(t?1), for f(S,T) when S and T are certain paths or star‐like trees. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 1–16, 2003  相似文献   

10.
An abelian *-semigroup S is perfect (resp. Stieltjes perfect) if every positive definite (resp. completely so) function on S admits a unique disintegration as an integral of hermitian multiplicative functions (resp. nonnegative such). We prove that every Stieltjes perfect semigroup is perfect. The converse has been known for semigroups with neutral element, but is here shown to be not true in general. We prove that an abelian *-semigroup S is perfect if for each sS there exist tS and m, n ∈ ℕ0 such that m + n ≥ 2 and s + s* = s* + mt + nt*. This was known only with s = mt + nt* instead. The equality cannot be replaced by s + s* + s = s + s* + mt + nt* in general, but for semigroups with neutral element it can be replaced by s + p(s + s*) = p(s + s*) + mt + nt* for arbitrary p ∈ ℕ (allowed to depend on s).  相似文献   

11.
In this paper we study the possible orders of a non-abelian representation group of a slim dense near hexagon. We prove that if the representation group R of a slim dense near hexagon S is non-abelian, then R is a 2-group of exponent 4 and |R|=2 β , 1+NPdim(S)≤β≤1+dimV(S), where NPdim(S) is the near polygon embedding dimension of S and dimV(S) is the dimension of the universal representation module V(S) of S. Further, if β=1+NPdim(S), then R is necessarily an extraspecial 2-group. In that case, we determine the type of the extraspecial 2-group in each case. We also deduce that the universal representation group of S is a central product of an extraspecial 2-group and an abelian 2-group of exponent at most 4. This work was partially done when B.K. Sahoo was a Research Fellow at the Indian Statistical Institute, Bangalore Center with NBHM fellowship, DAE Grant 39/3/2000-R&D-II, Govt. of India.  相似文献   

12.
Let be a regular near polygon of order (s,t) with s>1 and t3. Let d be the diameter of , and let r:= max{i(ci,ai,bi)=(c1,a1,b1)}. In this note we prove several inequalities for . In particular, we show that s is bounded from above by function in t if We also consider regular near polygons of order (s,3).This work was partly supported by the Grant-in-Aid for Scientific Research (No 14740072), the Ministry of Education, Culture, Sports, Science and Technology, JapanThis work was partly done when the author was at the Com2MaC center at the Pohang University of Science and Technology. He would like to thank the Com2MaC-KOSEF for its support  相似文献   

13.
《Quaestiones Mathematicae》2013,36(3-4):527-536
Abstract

Let K, S, T be subsets of a near-ring R. Then K is (S, T)-distributive if: s(k 1 + k 2)t = sk 1 t + sk 2 t, for each k 1, k 2 ε K, s ε S, t ε T; and K is (S, T)-d.g. on X if K is (S, X)-distributive and T is contained in the additive subgroup generated by X. This paper considers υ-primitivity and the associated ?υ radicals under various such conditions, particularly where S, T, and K are powers of R. Natural examples which illustrate and delimit the theory are given.  相似文献   

14.
A two commodity continuous review inventory system with independent Poisson processes for the demands is considered in this paper. The maximum inventory level for the i-th commodity is fixed asS i (i = 1,2). The net inventory level at timet for the i-th commodity is denoted byI i(t),i = 1,2. If the total net inventory levelI(t) =I 1(t) +I 2(t) drops to a prefixed level s[ \leqslant \tfrac(S1 - 2)2or\tfrac(S2 - 2)2]s[ \leqslant \tfrac{{(S_1 - 2)}}{2}or\tfrac{{(S_2 - 2)}}{2}] , an order will be placed for (S is) units of i-th commodity(i=1,2). The probability distribution for inventory level and mean reorders and shortage rates in the steady state are computed. Numerical illustrations of the results are also provided.  相似文献   

15.
Let S be a simply connected orthogonal polygon in the plane. The set S is a union of two sets which are starshaped via staircase paths (i.e., orthogonally starshaped) if and only if for every three points of S, at least two of these points see (via staircase paths) a common point of S. Moreover, the simple connectedness condition cannot be deleted.  相似文献   

16.
Jung Wook Lim 《代数通讯》2015,43(1):345-356
Let * be a star-operation of finite type on an integral domain D. In this paper, we generalize and study the concept of almost splitting sets. We define a saturated multiplicative subset S of D to be an almost g*-splitting set of D if for each 0 ≠ d ∈ D, there exists an integer n = n(d) ≥1 such that d n  = st for some s ∈ S and t ∈ D with (t, s′)* = D for all s′ ∈ S. Among other things, we prove that every saturated multiplicative subset of D is an almost g*-splitting set if and only if D is an almost weakly factorial domain (AWFD) with *-dim (D) = 1. We also give an example of an almost g*-splitting set which is not a g*-splitting set.  相似文献   

17.
Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t2, t3 and t satisfy s ≥ 2, t2 ≥ 2 and t3t2(t2+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open for the near octagons corresponding with certain values of s, t2 and t3. In the present paper, we will also show the nonexistence of these remaining regular near octagons. MSC2000 05B25, 05E30, 51E12 Postdoctoral Fellow of the Research Foundation - Flanders  相似文献   

18.
Let d≥3. Let H be a d+1-dimensional vector space over GF(2) and {e0,…,ed} be a specified basis of H. We define Supp(t){et1,…,etl}, a subset of a specified base for a non-zero vector t=et1++etl of H, and Supp(0)0/. We also define J(t)Supp(t) if |Supp(t)| is odd, and J(t)Supp(t){0} if |Supp(t)| is even.For s,tH, let {a(s,t)} be elements of H(HH) which satisfy the following conditions: (1) a(s,s)=(0,0), (2) a(s,t)=a(t,s), (3) a(s,t)≠(0,0) if st, (4) a(s,t)=a(s,t) if and only if {s,t}={s,t}, (5) {a(s,t)|tH} is a vector space over GF(2), (6) {a(s,t)|s,tH} generate H(HH). Then, it is known that S{X(s)|sH}, where X(s){a(s,t)|tH{s}}, is a dual hyperoval in PG(d(d+3)/2,2)=(H(HH)){(0,0)}.In this note, we assume that, for s,tH, there exists some xs,t in GF(2) such that a(s,t) satisfies the following equation: Then, we prove that the dual hyperoval constructed by {a(s,t)} is isomorphic to either the Huybrechts’ dual hyperoval, or the Buratti and Del Fra’s dual hyperoval.  相似文献   

19.
Given a digraph D on vertices v1, v2, ?, vn, we can associate a bipartite graph B(D) on vertices s1, s2, ?, sn, t1, t2, ?, tn, where sitj is an edge of B(D) if (vi, vj) is an arc in D. Let OG denote the set of all orientations on the (undirected) graph G. In this paper we will discuss properties of the set S(G) := {β1 (B(D))) | D ? OG}, where β1 is the edge independence number. In the first section we present some background and related concepts. We show that sets of the form S(G) are convex and that max S(G) ≦ 2 min S(G). Furthermore, this completely characterizes such sets. In the second section we discuss some bounds on elements of S(G) in terms of more familiar graphical parameters. The third section deals with extremal problems. We discuss bounds on elements of S(G) if the order and size of G are known, particularly when G is bipartite. In this section we exhibit a relation between max S(G) and the concept of graphical closure. In the fourth and final section we discuss the computational complexity of computing min S(G) and max S(G). We show that the first problem is NP-complete and that the latter is polynomial.  相似文献   

20.
Two Steiner triple systems, S1=(V,ℬ︁1) and S2=(V,ℬ︁2), are orthogonal (S1S2) if ℬ︁1 ∩ ℬ︁2=∅︁ and if {u,ν} ≠ {x,y}, uνw,xyw ∈ ℬ︁1, uνs, xyt ∈ ℬ︁2 then st. The solution to the existence problem for orthogonal Steiner triple systems, (OSTS) was a major accomplishment in design theory. Two orthogonal triple systems are skew-orthogonal (SOSTS, written S1S2) if, in addition, we require uνw, xys ∈ ℬ︁1 and uνt, xyw∈ ℬ︁2 implies st. Orthogonal triple systems are associated with a class of Room squares, with the skew orthogonal triple systems corresponding to skew Room squares. Also, SOSTS are related to separable weakly union-free TTS. SOSTS are much rarer than OSTS; for example SOSTS(ν) do not exist for ν=3,9,15. Furthermore, a fundamental construction for the earlier OSTS proofs when ν ≡ 3 (mod 6) cannot exist. In the case ν≡ 1 ( mod 6) we are able to show existence except possibly for 22 values, the largest of which is 1315. There are at least two non-isomorphic OSTS(19)s one of which is SOSTS(19) and the other not. A SOSTS(27) was found, implying the existence of SOSTS(ν) for ν ≡ 3 (mod 6) with finitely many possible exceptions.  相似文献   

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

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