Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Almost resolable designs (1)
- Automorphism (1)
- Balanced doubles schedules (1)
- Brun's constant (1)
- Calibration designs (1)
-
- Chordial graphs (1)
- Convection (1)
- Domination (1)
- Gases (1)
- Isomorphism (1)
- Magnetic fields (1)
- Magnetohydrodynamics (1)
- Nested t-designs (1)
- Perpendicular arrays (1)
- Prime numbers (1)
- Semibalanced arrays (1)
- Solar prominences (1)
- Sparse graphs (1)
- Sum of reciprocals (1)
- Team tournaments (1)
- Twin primes (1)
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
A New Error Analysis For Brun's Constant, Thomas R. Nicely
A New Error Analysis For Brun's Constant, Thomas R. Nicely
Virginia Journal of Science
Enumeration of the twin primes, and the sum of their reciprocals, is extended to 3 x 1015, yielding the count π2(3 x 1015) = 3310517800844. A more accurate estimate is obtained for Brun’s constant, B2 = 1.90216 05823 ± 0.00000 00008 . Error analysis is presented to support the contentioli that this estimate produces a 95 % confidence interval for B2. In addition, published values of the count π(x) of primes, obtained previously by indirect means, are verified by direct coiiIit to x = 3 x 1015
Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu
Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu
Computer Science Faculty Publications
We show that a large variety of NP-complete problems can be solved efficiently for graphs with 'few' P4's. We consider domination problems (domination, total domination, independent domination. connected domination and dominating clique), the Steiner tree problem, the vertex ranking problem, the pathwidth problem, the path cover number problem, the hamiltonian circuit problem, the list coloring problem and the precoloring extension problem. We show that all these problems can be solved in linear time for the class of (q,q - 4)-graphs, for every fixed q. These are graphs for which no set of at most q. vertices induces more …
Nested Balanced Incomplete Block Designs, J. P. Morgan, D. A. Preece, D. H. Rees
Nested Balanced Incomplete Block Designs, J. P. Morgan, D. A. Preece, D. H. Rees
Mathematics & Statistics Faculty Publications
If the blocks of a balanced incomplete block design (BIBD) with v treatments and with parameters (v; b1;r;k1) are each partitioned into sub-blocks of size k2, and the b2 =b1k1=k2 sub-blocks themselves constitute a BIBD with parameters (v; b2;r;k2), then the system of blocks, sub-blocks and treatments is, by de4nition, a nested BIBD (NBIBD). Whist tournaments are special types of NBIBD with k1 =2k2= 4. Although NBIBDs were introduced in the statistical literature in 1967 and have subsequently received occasional attention there, …
Mathematical Models Of Quiescent Solar Prominences, Iain Mckaig
Mathematical Models Of Quiescent Solar Prominences, Iain Mckaig
Mathematics & Statistics Theses & Dissertations
Magnetic fields in the solar atmosphere suspend and insulate dense regions of cool plasma known as prominences. The convection zone may be the mechanism that both generates and expels this magnetic flux through the photosphere in order to make these formations possible. The connection is examined here by modeling the convection zone as both one-dimensional, then more realistically, two-dimensional.
First a Dirichlet problem on a semi-infinite strip is solved using conformal mapping and the method of images. The base of the strip represents the photosphere where a current distribution can be given as a boundary condition, and the strip extends …