We study the following Maker/Breaker game. Maker and Breaker take turns in choosing vertices from a given n-uniform hypergraph F , with Maker going first. Maker’s goal is to completely occupy a hyperedge and Breaker tries to avoid this. Beck conjectures that if the maximum neighborhood size of F is at most 2 then Breaker has a winning strategy. We disprove this conjecture by establishing an n-u...

A. For f , g ∈ ω let c∀f ,g be the minimal number of uniform g-splitting trees needed to cover the uniform f -splitting tree, i.e., for every branch ν of the f -tree, one of the g-trees contains ν. Let c∃f ,g be the dual notion: For every branch ν, one of the g-trees guesses ν(m) infinitely often. We show that it is consistent that c∃fǫ ,gǫ = c ∀ fǫ ,gǫ = κǫ for continuum many pairwise d...

Nucleotide Excision Repair (NER) is a critical pathway involved in breast cancer (BC). We have previously published that a low DNA repair capacity (DRC) is associated with a higher risk of BC in Puerto Rican women. Let-7b belongs to a miRNA family with tumor suppressor activity that targets oncogenes. We isolated miRNAs from plasma of 153 Puerto Rican women with and without BC. DRC was measured...

The nexin-dynein regulatory complex (N-DRC) is proposed to coordinate dynein arm activity and interconnect doublet microtubules. Here we identify a conserved region in DRC4 critical for assembly of the N-DRC into the axoneme. At least 10 subunits associate with DRC4 to form a discrete complex distinct from other axonemal substructures. Transformation of drc4 mutants with epitope-tagged DRC4 res...

PURPOSE To examine the role of suboptimal DNA repair capacity (DRC) for UV light-induced DNA damage in the development of nonmelanoma skin cancer (NMSC) and tumor progression. EXPERIMENTAL DESIGN We conducted a hospital-based case-control study of 255 patients with newly diagnosed NMSC [146 with basal cell carcinoma (BCC) and 109 with squamous cell carcinoma (SCC)] and 333 cancer-free control...

If a configuration of m triangles in the plane has only n points as vertices, then there must be a set of max { dm/(2n− 5)e Ω(m3/(n6 log n)) triangles having a common intersection. As a consequence the number of halving planes for a three-dimensional point set is O(n log n). For all m and n there exist configurations of triangles in which the largest common intersection involves max {dm/(2n− 5)...

The Database of Ribosomal Cross-links (DRC) was created in 1997. Here we describe new data incorporated into this database and several new features of the DRC. The DRC is freely available via World Wide Web at http://visitweb.com/database/ or http://www. mpimg-berlin-dahlem.mpg.de/ approximately ag_ribo/ag_brimacombe/drc/

Rubber industry has increased the requirements for quality and uniformity of natural rubber produced in Brazil. Technological properties of latex and natural rubber of clones GT 1, PB 235, IAN 873 and RRIM 600 [Hevea brasiliensis (Willd. Former Adr. de Juss.) Muell.Arg] were evaluated by standard methods of the dry rubber content (DRC%), percentage of nitrogen (N%) and percentage of ashes (ASH%...

We show that the number of halving sets of a set of n points in R is O ( n ) , improving the previous bound of [9] with a simpler (albeit similar) proof.

We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4−2/45). This improves the previous bound of O(n4−1/13 4 ). Our main new ingredient is a bound on the maximum number of halving simplices intersecting a fixed 2-plane.