New star discrepancy bounds for (t,m,s)-nets and (t,s)-sequences

In this paper, we derive new general upper bounds on the star discrepancy of $(t,m,s)$ -nets and $(t,s)$ -sequences. These kinds of point sets are among the most widely used in quasi-Monte Carlo methods for numerical integration. By our new results, we improve on previous discrepancy bounds and prove a conjecture stated by the second author in an earlier paper.     

Construction of hjelmslev planes from (t,k)-nets

A (t, k)-net is an abstract generalization of the incidence structures which occur as the point and line neighborhoods of a finite Hjelmslev plane. A (t, k)-net contains ‘substructures’ which are nets of ordert and degreek. Every (t, r) Hjelmslev plane (brieflyH-plane) can be constructed from a suitable collection of (t, r+1)- and (t, r)-nets. A (t, r)H-plane or (t, k)-net is called extremal provided: each two points which are joined by more than two lines are joined by preciselyt lines and dually. IfB is a ‘properly’ extremal (t, r)H-plane (means both 2 andt≠2 occur among the joining numbers), thent is even; andr=2 orr=1+(t/2). All the 3-uniform [J. Combinat. Theory 9, 267–288 (1970, this Zbl.204, 210)] (4, 2)H-planes are examples. Two further examples are constructed in the paper: an (8, 2) translationH-planeC and an (8, 2) projectiveH-planeD, none of whose affineH-planes are translationH-planes. All point neighborhoods fromC andD and all line neighborhoods fromD are isomorphic to a give (8, 3)-netE;E is constructed by considering the subspaces of a 64-point symplectic geometry overZ ₂.E is also used to answer (affirmatively) the question of the existence of proper fairly near affineH-planes [J. Combinat. Theory 16A, 34–50 (1974)].     

A characterization of 3-nets

Laskar introduced 3-nets as a 3 dimensional analogue to Bruck's notion of net. Affine 3-spaces are an example of 3-nets, and cubic lattice graphs provide another example. Freeman introduced and Laskar extended a class of examples of 3-nets, here called Freeman-Laskar 3-nets. We show that every finite 3-net is either a cubic lattice 3-net or a Freeman-Laskar 3-net. We also show that every infinite 3-net either is a cubic lattice 3-net or arises from a vector space over a skew field.     

The combinatorial structure of (m,n)-convex sets

LetS be a closed subset of a Hausdorff linear topological space,S having no isolated points, and letc _s (m) denote the largest integern for whichS is (m,n)-convex. Ifc _s (k)=0 andc _s (k+1)=1, then $$ c_s \left( m \right) = \sum\limits_{i = 1}^k {\left( {\begin{array}{*{20}c} {\left[ {\frac{{m + k - i}} {k}} \right]} \\ 2 \\ \end{array} } \right)} $$ . Moreover, ifT is a minimalm subset ofS, the combinatorial structure ofT is revealed.     

Finite Dimensional Lie Superalgebras W(m,n,t) and S(m,n,t) of Cartan Type

设Ｌ＝Ｗ或Ｓ，Ｆ是特征数大于２的域．本文证明了Ｆ上的有限维单李超代数Ｌ（ｍ，ｎ，ｔ）的自然滤过是不变的．进而得出了Ｌ（ｍ，ｎ，ｔ）与Ｌ（ｍ′，ｎ′，ｔ′）同构的充要条件是ｍ＝ｍ′，ｎ＝ｎ′和ｔｉ＝τ（ｔ′ｉ），ｉ＝１，２，…，ｍ，这里τ是｛１，２，…，ｍ｝的一个置换．     

A characterization of the primals in PG(m, 2)

The primais of degree r in PG(m, 2) are, for each r m, shown to be characterized by the property that they have odd intersection with every r-flat.     

三路树P(m,n,t)是边幻图的证明(II)

令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图.     

三路树P(m,n,t)是边幻图的证明

文 [1 ]中猜测每一棵树是边幻图 .本文证明了三路树 P( m,n,t) ,当 ( i) n,t为偶数且相等 ;( ii)t=n+1 ;( iii) n为奇数且 t=n+2时为边幻图 .     

A new partial geometry with parameters (s,t,α) = (7,8,4)

A partial geometry with parameters as given in the title is constructed by use of the 240 points closest to the origin in the lattice E₈.     

Multivariate interpolating (m, l, s)-splines

The multivariate interpolating (m, l, s)-splines are a natural generalization of Duchon's thin plate splines (TPS). More precisely, we consider the problem of interpolation with respect to some finite number of linear continuous functionals defined on a semi-Hilbert space and minimizing its semi-norm. The (m, l, s)-splines are explicitly given as a linear combination of translates of radial basis functions. We prove the existence and uniqueness of the interpolating (m, l, s)-splines and investigate some of their properties. Finally, we present some practical examples of (m, l, s)-splines for Lagrange and Hermite interpolation.     

Updated tables of parameters of (T,M, S)-nets

We present an updated survey of the known constructions and bounds for (t, m, s)- nets as well as tables of upper and lower bounds on their parameters for various bases. © 1999 John Wiley & Sons, Inc. J. Cobin Designs 7: 381–393, 1999     

A (2, 11) combinatorial groupoid

The variety of groupoids defined by the identitites (yx)x = xy and ((xy)(yx))(xy) = y has the properties that every groupoid generated by two elements is of order 11. The two generating identities imply others with a wide variety of combinatorial implications.     

Domination of cyclic monotone (s, t)-graphs

The conjecture of zero domination of 0-cyclic monotone graphs is proved (anr-cyclic graph is a cyclic monotone (s, t)-graph exactlyr minimal paths of which have cycles). As a corollary, a formula for computing the reliability of an arbitrary 0-cyclic monotone graph is obtained. It is proved that the problem of determining the domination in the class ofr-cyclic monotone graphs is #P-complete for any fixed integerr≥1. Translated fromMatematicheskie Zametki, Vol. 67, No. 2, pp. 288–294, February, 2000.