A note on 3-blocked designs

A blocking set of a design different from a 2-(λ + 2, λ + 1, λ) design has at least 3 points. The aim of this note is to establish which 2-(v, k, λ) designs D with r ≥ 2λ may contain a blocking 3-set. The main results are the following. If D contains a blocking 3-set, then D is one of the following designs: a 2-(2λ + 3, λ + 1, λ), a 2-(2λ + 1), λ + 1, λ), a 2-(2λ - 1, λ, λ), a 2-(4λ + 3, 2λ + 1, λ) Hadamard design with λ odd, or a 2-(4λ - 1, 2λ, λ) Hadamard design. Moreover a blocking 3-set in a 2-(4λ + 3, 2λ + 1, λ) Hadamard design exists if and only if there is a line with three points. In the case of 2- (4λ - 1, 2λ, λ) Hadamard design with λ odd, we give necessary and sufficient conditions for the existence of a blocking 3-set, while in the case λ even, a necessary condition is given. © 1997 John Wiley & Sons, Inc.     

A note on the tameness of hyperbolic 3-manifolds

Among other related results we prove that a hyperbolic 3-manifold which admits an exhaustion by nested cores is tame.     

A note on the 3-rank of quadratic fields

The difference between the 3-rank of the ideal class group of an imaginary quadratic field and that of the associated real quadratic field is equal to 0 or 1. In this note, we give an infinite family of examples in each case.Received: 9 September 2002     

A note on a spanning 3-tree

A tree T is called a k-tree, if the maximum degree of T is at most k. In this paper, we prove that if G is an n-connected graph with independence number at most n + m + 1 (n≥1,n≥m≥0), then G has a spanning 3-tree T with at most m vertices of degree 3.     

A note on 3+1 dimensionality

A recent paper by Castro and Granik based on the work of El Naschie has given a rationale for the three dimensionality of our physical space within the framework of Cantorian fractal space-time using similar ideas of quantized fractal space-time and non-commutativity. We also deduce the same result. Interestingly, this is also seen to provide a rationale for an unproven conjecture of Poincaré.     

A note on the Chern-Simons invariant of hyperbolic 3-manifolds

In this note we study how the Chern-Simons invariant behaves when two hyperbolic 3-manifolds are glued together along incompressible
thrice-punctured spheres. Such an operation produces many hyperbolic 3-manifolds with different numbers of cusps sharing the same volume and the same Chern-Simons invariant. The results in this note, combined with those of Meyerhoff and Ruberman, give an algorithm for determining the unknown constant in Neumann's simplicial formula for the Chern-Simons invariant of hyperbolic 3-manifolds.

     

A note on the genus of 3-manifolds with boundary

Summary In this paper we prove that the minimum among all regular genera of the graphs representing a 3-manifold with boundaryM ³ can always be obtained by a crystallization. As a consequence, we also prove that every 3-coloured graph representing ∂M ³ is the boundary of a 4-coloured graph which representsM ³ and whose genus equals the regular genus ofM ³.

---

Riassunto In questo lavoro si prova che ogni 3-varietà con bordoM ³ ammette sempre una cristallizzazione di genere minimo. Come conseguenza, si ottiene che ogni grafo 3-colorato che rappresenta ∂M ³ è il bordo di un grafo 4-colorato che rappresentaM ³, il cui genere è uguale al genere regolare diM ³.

---

---

Work performed under the auspices of the G.N.S.A.G.A.-C.N.R., and within the Project ?Geometria delle varietà differenziabili?, supported by M.P.I. of Italy.     

A note on hyperbolic 3-manifolds of the same volume

We describe a method for constructing an arbitrary number of closed hyperbolic 3-manifolds of the same volume. In fact we prove that many hyperbolic 3-manifolds of finite volume have an arbitrary number of non-homeomorphic finite convering spaces of the same degree and hence the same volume. This applies, for example, to all hyperbolic 3-manifolds whose universal covering group is a subgroup of finite index in a Coxeter group generated by the reflections in the faces of a hyperbolic Coxeter polyhedron. It also applies to all hyperbolic 3-manifolds of finite volume with at least one cusp.     

A note on Hempel-McMillan coverings of 3-manifolds

Motivated by the concept of A-category of a manifold introduced by Clapp and Puppe, we give a different proof of a (slightly generalized) Theorem of Hempel and McMillan: If M is a closed 3-manifold that is a union of three open punctured balls then M is a connected sum of S³ and S²-bundles over S¹.     

A note on $$AP_3$$ A P 3 -covering sequences

Periodica Mathematica Hungarica - For a given integer $$k\ge 3$$ , a sequence A of nonnegative integers is called an  $$AP_k$$ -covering sequence if there exists an integer $$n_0$$ such...     

A note on rigidity of 3-Sasakian manifolds

Making use of the relations among 3-Sasakian manifolds, hypercomplex manifolds and quaternionic Kähler orbifolds, we prove that complete 3-Sasakian manifolds are rigid.

     

A note on “Optimal resource allocation for security in reliability systems”

In a recent paper by Azaiez and Bier [Azaiez, M.N., Bier, V.M., 2007. Optimal resource allocation for security in reliability systems. European Journal of Operational Research 181, 773–786], the problem of determining resource allocation in series-parallel systems (SPSs) is considered. The results for this problem are based on the results for the least-expected cost failure-state diagnosis problem. In this note, it is demonstrated that the results for the least-expected cost failure-state diagnosis problem for SPSs in Azaiez and Bier (2007) are incorrect. In addition relevant results that were not cited in the paper are summarized.     

A note on 3-Steiner intervals and betweenness

The geodesic and geodesic interval, namely the set of all vertices lying on geodesics between a pair of vertices in a connected graph, is a part of folklore in metric graph theory. It is also known that Steiner trees of a (multi) set with k (k>2) vertices, generalize geodesics. In Brešar et al. (2009) [1], the authors studied the k-Steiner intervals S(u₁,u₂,…,u_k) on connected graphs (k≥3) as the k-ary generalization of the geodesic intervals. The analogous betweenness axiom (b2) and the monotone axiom (m) were generalized from binary to k-ary functions as follows. For any u₁,…,u_k,x,x₁,…,x_k∈V(G) which are not necessarily distinct, The authors conjectured in Brešar et al. (2009) [1] that the 3-Steiner interval on a connected graph G satisfies the betweenness axiom (b2) if and only if each block of G is geodetic of diameter at most 2. In this paper we settle this conjecture. For this we show that there exists an isometric cycle of length 2k+1, k>2, in every geodetic block of diameter at least 3. We also introduce another axiom (b2(2)), which is meaningful only to 3-Steiner intervals and show that this axiom is equivalent to the monotone axiom.     

A note on the maximum genus of 3-edge-connected nonsimple graphs

Let G be a 3-edge-connected graph (possibly with multiple edges or loops), and let γM(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γM(G)≥β(G)/3 can be proved and this answers a question posed by Chen, et al. in 1996.     

A note on the Picard number of singular Fano 3-folds

Using a construction due to C. Casagrande and further developed by the author (Int. Math. Res. Notices, 2012), we prove that the Picard number of a non-smooth Fano 3-fold with isolated factorial canonical singularities is at most 6.     

A note on the acyclic 3-choosability of some planar graphs

An acyclic coloring of a graph G is a coloring of its vertices such that: (i) no two adjacent vertices in G receive the same color and (ii) no bicolored cycles exist in G. A list assignment of G is a function L that assigns to each vertex v∈V(G) a list L(v) of available colors. Let G be a graph and L be a list assignment of G. The graph G is acyclically L-list colorable if there exists an acyclic coloring ? of G such that ?(v)∈L(v) for all v∈V(G). If G is acyclically L-list colorable for any list assignment L with |L(v)|≥k for all v∈V(G), then G is said to be acyclically k-choosable. Borodin et al. proved that every planar graph with girth at least 7 is acyclically 3-choosable (Borodin et al., submitted for publication [4]). More recently, Borodin and Ivanova showed that every planar graph without cycles of length 4 to 11 is acyclically 3-choosable (Borodin and Ivanova, submitted for publication [7]). In this note, we connect these two results by a sequence of intermediate sufficient conditions that involve the minimum distance between 3-cycles: we prove that every planar graph with neither cycles of lengths 4 to 7 (resp. to 8, to 9, to 10) nor triangles at distance less than 7 (resp. 5, 3, 2) is acyclically 3-choosable.     

A note on entropy of 3-buffer flow model

In this note we investigate a discrete time dynamical system defined on an equilateral triangle, which arises in studies of a 3-buffer flow model for manufacturing systems, and present an estimate of the entropy of this model.