共查询到20条相似文献,搜索用时 31 毫秒
1.
A. D. Forbes M. J. Grannell T. S. Griggs 《Rendiconti del Circolo Matematico di Palermo》1932,56(1):17-32
In [8], Quattrochi and Rinaldi introduced the idea ofn ?1-isomorphism between Steiner systems. In this paper we study this concept in the context of Steiner triple systems. The main result is that for any positive integerN, there existsv 0(N) such that for all admissiblev≥v 0(N) and for each STS(v) (sayS), there exists an STS(v) (sayS′) such that for somen>N, S is strictlyn ?1-isomorphic toS′. We also prove that for all admissiblev≥13, there exist two STS(v)s which are strictly 2?1-isomorphic. Define the distance between two Steiner triple systemsS andS′ of the same order to be the minimum volume of a tradeT which transformsS into a system isomorphic toS′. We determine the distance between any two Steiner triple systems of order 15 and, further, give a complete classification of strictly 2?1-isomorphic and 3?1-isomorphic pairs of STS(15)s. 相似文献
2.
Simona Bonvicini Marco Buratti Gloria Rinaldi Tommaso Traetta 《Designs, Codes and Cryptography》2012,62(1):63-78
A Steiner triple system of order v (briefly STS(v)) is 1-rotational under G if it admits G as an automorphism group acting sharply transitively on all but one point. The spectrum of values of v for which there exists a 1-rotational STS(v) under a cyclic, an abelian, or a dicyclic group, has been established in Phelps and Rosa (Discrete Math 33:57–66, 1981), Buratti (J Combin Des 9:215–226, 2001) and Mishima (Discrete Math 308:2617–2619, 2008), respectively. Nevertheless, the spectrum of values of v for which there exists a 1-rotational STS(v) under an arbitrary group has not been completely determined yet. This paper is a considerable step forward to the solution
of this problem. In fact, we leave as uncertain cases only those for which we have v = (p
3−p)n + 1 ≡ 1 (mod 96) with p a prime,
n \not o 0{n \not\equiv 0} (mod 4), and the odd part of (p
3 − p)n that is square-free and without prime factors congruent to 1 (mod 6). 相似文献
3.
Yuichiro Fujiwara 《Journal of Algebraic Combinatorics》2007,26(4):495-506
In 1973 Paul Erdős conjectured that there is an integer v
0(r) such that, for every v>v
0(r) and v≡1,3 (mod 6), there exists a Steiner triple system of order v, containing no i blocks on i+2 points for every 1<i≤r. Such an STS is said to be r-sparse. In this paper we consider relations of automorphisms of an STS to its sparseness. We show that for every r≥13 there exists no point-transitive r-sparse STS over an abelian group. This bound and the classification of transitive groups give further nonexistence results
on block-transitive, flag-transitive, 2-transitive, and 2-homogeneous STSs with high sparseness. We also give stronger bounds
on the sparseness of STSs having some particular automorphisms with small groups. As a corollary of these results, it is shown
that various well-known automorphisms, such as cyclic, 1-rotational over arbitrary groups, and involutions, prevent an STS
from being high-sparse.
相似文献
4.
Marc Coppens 《Geometriae Dedicata》2007,125(1):25-38
Let X be a smooth irreducible quasi-projective variety of dimension n in P
N
with N ≥ 2n + 2. Let γ be its Gauss map, let be the embedding obtained from the general projection in P
N
and let γ′ be its Gauss map. We say that the general projection preserves the injectivity of the Gauss map if γ(Q) ≠ γ(Q′) implies γ′(Q) ≠ γ′ (Q′). We prove that this property holds in the following cases: N≥ 3n + 1; N ≥ 3n with n ≥ 2; N ≥ 3n−1 with n ≥ 4 and X does not contain a linear (n−1)-space. In case N = 3n−1 and X does contain a linear (n−1)-space (such smooth varieties exist) then the general projection does not preserver the injectivity of the Gauss map. This
shows that there does not exist a straightforward kind of Bertini theorem for properties related to the Gauss map.
The author is affiliated with the University at Leuven as a research fellow. This paper belongs to the FWO-project G.0318.06. 相似文献
5.
Lijun Ji 《Designs, Codes and Cryptography》2007,45(1):39-49
Recently, Franek et al. introduced large sets of v − 1 L-intersecting Steiner triple systems of order v (STS(v)) and gave four constructions for them (Des., Codes and Cryptogr., 26 (2002), 243–256). In this paper, we mainly focus on
large sets of v − 1{0, 1}-intersecting STS(v) and large sets of v + 1{1}-intersecting STS(v). For this purpose, we introduce a concept of L-intersecting partitionable candelabra system (L-PCS) of order v with q(v) subsystems and establish a relationship between L-PCS and large set of q(v)L-intersecting STS(v). Some constructions for L-PCSs are also presented by 3-wise balanced designs. These facilitate the production of some new infinite classes of these large
sets.
Research supported by Tianyuan Mathematics Foundation of NSFC Grant 10526032 and Natural Science Foundation of Universities
of Jiangsu Province Grant 05KJB110111. 相似文献
6.
A minimal defining set of a Steiner triple system on v points (STS(v)) is a partial Steiner triple system contained in only this STS(v), and such that any of its proper subsets is contained in at least two distinct STS(v)s. We consider the standard doubling and tripling constructions for STS(2v+1) and STS(3v) from STS(v) and show how minimal defining sets of an STS(v) gives rise to minimal defining sets in the larger systems. We use this to construct some new families of defining sets.
For example, for Steiner triple systems on 3
n
points, we construct minimal defining sets of volumes varying by as much as 7
n−2
.
Received: September 16, 2000 Final version received: September 13, 2001
RID="*"
ID="*" Research supported by the Australian Research Council A49937047, A49802044 相似文献
7.
Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<(
n
n+x
). Here we prove that the order x Veronese embedding ofP
n
is not weakly (k−1)-defective, i.e. for a general S⊃P
n
such that #(S) = k+1 the projective space | I
2S
(x)| of all degree t hypersurfaces ofP
n
singular at each point of S has dimension (
n
/n+x
)−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I
2S
(x)| has an ordinary double point at each P∈ S and Sing (F)=S.
The author was partially supported by MIUR and GNSAGA of INdAM (Italy). 相似文献
8.
Assume thatf is an integer transcendental solution of the differential equationP
n
(z, f, f′)=P
n−1(z, f, f′, ... f
(p)), whereP
n
andP
n−1 are polynomials in all variables, the degree ofP
n
with respect tof andf′ is equal ton, and the degree ofP
n−1 with respect tof, f′, ... f
(p) is at mostn−1. We prove that the order ρ of growth off satisfies the relation 1/2≤ρ<∞. We also prove that if ρ=1/2, then, for a certain real ν, in the domain {z: ν<argz<ν+2π}/E
*, whereE
* is a certain set of disks with finite sum of radii, the estimate lnf(z)=z
1/2 (β+o(1)), β∈C, holds forz=re
iϕ,r≥r(ϕ)≥0. Furthermore, on the ray {z: argz=ν}, the following relation is true: ln‖f(re
iν)‖=o(r
1/2),r→+∞,r>0,
, where Δ is a certain set on the semiaxisr>0 with mes Δ<∞.
“L'vivs'ka Politekhnika” University, Lvov. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 51, No. 1, pp. 69–77,
January, 1999. 相似文献
9.
Peter Danziger Peter Dukes Terry Griggs Eric Mendelsohn 《Graphs and Combinatorics》2006,22(3):311-329
A Steiner triple system of order v, or STS(v), is a pair (V, ) with V a set of v points and a set of 3-subsets of V called blocks or triples, such that every pair of distinct elements of V occurs in exactly one triple. The intersection problem for STS is to determine the possible numbers of blocks common to two Steiner triple systems STS(u), (U, ), and STS(v), (V, ), with U⊆V. The case where U=V was solved by Lindner and Rosa in 1975. Here, we let U⊂V and completely solve this question for v−u=2,4 and for v≥2u−3.
supported by NSERC research grant #OGP0170220.
supported by NSERC postdoctoral fellowship.
supported by NSERC research grant #OGP007621. 相似文献
10.
For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented.
Received: August 19, 1998 Final version received: May 17, 2000 相似文献
11.
Hao Li 《Graphs and Combinatorics》2000,16(3):319-335
Let G be a 3-connected graph of order n and S a subset of vertices. Denote by δ(S) the minimum degree (in G) of vertices of S. Then we prove that the circumference of G is at least min{|S|, 2δ(S)} if the degree sum of any four independent vertices of S is at least n+6. A cycle C is called S-maximum if there is no cycle C
′ with |C
′∩S|>|C∩S|. We also show that if ∑4
i=1
d(a
i)≥n+3+|⋂4
i=1
N(a
i)| for any four independent vertices a
1, a
2, a
3, a
4 in S, then G has an S-weak-dominating S-maximum cycle C, i.e. an S-maximum cycle such that every component in G−C contains at most one vertex in S.
Received: March 9, 1998 Revised: January 7, 1999 相似文献
12.
Wu Liangsen 《数学学报(英文版)》1992,8(4):406-412
LetA, B be unitalC
*-algebras,D
A
1
the set of all completely positive maps ϕ fromA toM
n
(C), with Tr ϕ(I)≤1(n≥3). If Ψ is an α-invariant affine homeomorphism betweenD
A
1
andD
B
1
with Ψ (0)=0, thenA is*-isomorphic toB.
Obtained results can be viewed as non-commutative Kadison-Shultz theorems.
This work is supported by the National Natural Science Foundation of China. 相似文献
13.
S. P. Zhou 《Israel Journal of Mathematics》1992,78(1):75-83
The present paper gives a converse result by showing that there exists a functionf ∈C
[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE
n
(0)
(f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E
n(f) is the ordinary best polynomial approximation off of degreen. 相似文献
14.
Li Banghe 《Commentarii Mathematici Helvetici》1982,57(1):135-144
Under the assumption of (f, M
n
,N
2n−1) being trivial, the classification of immersions homotopic tof: M
n
→N
2n−1 is obtained in many cases. The triviality of (f, M
n
,P
2n−1) is proved for anyM
n
andf.
LetM, N be differentiable manifolds of dimensionn and2n−1 respectively. For a mapf: M → N, denote byI[M, N]
f
the set of regular homotopy classes of immersions homotopic tof. It has been proved in [1] that, whenn>1,I[M, N]
f
is nonempty for anyf. In this paper we will determine the setI[M, N]
f
in some cases.
For example, ifN=P
2n−1 or more generally, the lens spacesS
m
2n−1
=Z
m
/S
2n−1,M is any orientablen-manifold or nonorientable butn≡0, 1, 3 mod 4, then, for anyf, theI[M, N]
f is determined completely.
WhenN=R
2n−1, the setI[M, N] of regular homotopy classes of all immersions has been enumerated by James and Thomas in [2] and McClendon in [3] forn>3. Applying our results toN=R
2n−1 we obtain their results again, except for the casen≡2 mod 4 andM nonorientable.
Whenn=3, McClendon's results cannot be used. Our results include the casesn=3,M orientable or not (for orientableM, I[M, R5] is known by Wu [4]). 相似文献
15.
LetW be an algebraically closed filed of characteristic zero, letK be an algebraically closed field of characteristic zero, complete for an ultrametric absolute value, and letA(K) (resp. ℳ(K)) be the set of entire (resp. meromorphic) functions inK. For everyn≥7, we show that the setS
n(b) of zeros of the polynomialx
n−b (b≠0) is such that, iff, g ∈W[x] or iff, g ∈A(K), satisfyf
−1(S
n(b))=g
−1(S
n(b)), thenf
n=g
n. For everyn≥14, we show thatS
n(b) is such that iff, g ∈W({tx}) or iff, g ∈ ℳ(K) satisfyf
−1(S
n(b))=g
−1(S
n(b)), then eitherf
n=g
n, orfg is a constant. Analogous properties are true for complex entire and meromorphic functions withn≥8 andn≥15, respectively.
For everyn≥9, we show that the setY
n(c) of zeros of the polynomial
, (withc≠0 and 1) is an ursim ofn points forW[x], and forA(K). For everyn≥16, we show thatY
n(c) is an ursim ofn points forW(x), and for ℳ(K). We follow a method based on thep-adic Nevanlinna Theory and use certain improvement of a lemma obtained by Frank and Reinders. 相似文献
16.
Kewen Zhao 《Monatshefte für Mathematik》2009,20(1):279-293
Let G be a simple graph with n vertices. For any v ? V(G){v \in V(G)} , let N(v)={u ? V(G): uv ? E(G)}{N(v)=\{u \in V(G): uv \in E(G)\}} , NC(G) = min{|N(u) èN(v)|: u, v ? V(G){NC(G)= \min \{|N(u) \cup N(v)|: u, v \in V(G)} and
uv \not ? E(G)}{uv \not \in E(G)\}} , and NC2(G) = min{|N(u) èN(v)|: u, v ? V(G){NC_2(G)= \min\{|N(u) \cup N(v)|: u, v \in V(G)} and u and v has distance 2 in E(G)}. Let l ≥ 1 be an integer. A graph G on n ≥ l vertices is [l, n]-pan-connected if for any u, v ? V(G){u, v \in V(G)} , and any integer m with l ≤ m ≤ n, G has a (u, v)-path of length m. In 1998, Wei and Zhu (Graphs Combinatorics 14:263–274, 1998) proved that for a three-connected graph on n ≥ 7 vertices, if NC(G) ≥ n − δ(G) + 1, then G is [6, n]-pan-connected. They conjectured that such graphs should be [5, n]-pan-connected. In this paper, we prove that for a three-connected graph on n ≥ 7 vertices, if NC
2(G) ≥ n − δ(G) + 1, then G is [5, n]-pan-connected. Consequently, the conjecture of Wei and Zhu is proved as NC
2(G) ≥ NC(G). Furthermore, we show that the lower bound is best possible and characterize all 2-connected graphs with NC
2(G) ≥ n − δ(G) + 1 which are not [4, n]-pan-connected. 相似文献
17.
Guido Cortesani 《Annali dell'Universita di Ferrara》1997,43(1):27-49
Let Ω be an open and bounded subset ofR
n
with locally Lipschitz boundary. We prove that the functionsv∈SBV(Ω,R
m
) whose jump setS
vis essentially closed and polyhedral and which are of classW
k, ∞ (S
v,R
m) for every integerk are strongly dense inGSBV
p(Ω,R
m
), in the sense that every functionu inGSBV
p(Ω,R
m
) is approximated inL
p(Ω,R
m
) by a sequence of functions {v
k{j∈N with the described regularity such that the approximate gradients ∇v
jconverge inL
p(Ω,R
nm
) to the approximate gradient ∇u and the (n−1)-dimensional measure of the jump setsS
v
j converges to the (n−1)-dimensional measure ofS
u. The structure ofS
v can be further improved in casep≤2.
Sunto Sia Ω un aperto limitato diR n con frontiera localmente Lipschitziana. In questo lavoro si dimostra che le funzioniv∈SBV(Ω,R m ) con insieme di saltoS v essenzialmente chiuso e poliedrale che sono di classeW k, ∞ (S v,R m ) per ogni interok sono fortemente dense inGSBV p(Ω,R m ), nel senso che ogni funzioneu∈GSBV p(Ω,R m ) è approssimata inL p(Ω,R m ) da una successione di funzioni {v j}j∈N con la regolaritá descritta tali che i gradienti approssimati ∇v jconvergono inL p(Ω,R nm ) al gradiente approssimato ∇u e la misura (n−1)-dimensionale degli insiemi di saltoS v jconverge alla misura (n−1)-dimensionale diS u. La struttura diS vpuó essere migliorata nel caso in cuip≤2.相似文献
18.
T. Lengyel 《P-Adic Numbers, Ultrametric Analysis, and Applications》2012,4(3):179-186
We analyze some 2-adic properties of the sequence defined by the recurrence Z(1) = 1; Z(n) = Σ k=1 n−1 S(n, k)Z(k), n ≥ 2, which counts the number of ultradissimilarity relations, i.e., ultrametrics on an n-set. We prove the 2-adic growth property ν 2(Z(n)) ≥ ⌈log2 n⌉ −1 and present conjectures on the exact values. 相似文献
19.
Henry Teicher 《Journal of Theoretical Probability》1995,8(4):779-793
Conditions are obtained for (*)E|S
T
|γ<∞, γ>2 whereT is a stopping time and {S
n=∑
1
n
,X
j
ℱ
n
,n⩾1} is a martingale and these ensure when (**)X
n
,n≥1 are independent, mean zero random variables that (*) holds wheneverET
γ/2<∞, sup
n≥1
E|X
n
|γ<∞. This, in turn, is applied to obtain conditions for the validity ofE|S
k,T
|γ<∞ and of the second moment equationES
k,T
2
=σ
2
EΣ
j=k
T
S
k−1,j−1
2
where
and {X
n
, n≥1} satisfies (**) and
,n≥1. The latter is utilized to elicit information about a moment of a stopping rule. It is also shown for i.i.d. {X
n
, n≥1} withEX=0,EX
2=1 that the a.s. limit set of {(n log logn)−k/2
S
k,n
,n≥k} is [0,2
k/2/k!] or [−2
k/2/k!] according ask is even or odd and this can readily be reformulated in terms of the corresponding (degenerate kernel)U-statistic
. 相似文献
20.
LetB
d
be thed-dimensional unit ball and, for an integern, letC
n
={x
1,...,x
n
} be a packing set forB
d
, i.e.,|x
i
−x
j
|≥2, 1≤i<j≤n. We show that for every
a dimensiond(ρ) exists such that, ford≥d(ρ),V(conv(C
n
)+ρB
d
)≥V(conv(S
n
)+ρB
d
), whereS
n
is a “sausage” arrangement ofn balls, holds. This gives considerable improvement to Fejes Tóth's “sausage” conjecture in high dimensions. Further, we prove
that, for every convex bodyK and ρ<1/32d
−2,V(conv(C
n
)+ρK)≥V(conv(S
n
)+ρK), whereC
n
is a packing set with respect toK andS
n
is a minimal “sausage” arrangement ofK, holds. 相似文献