17,714 Hits in 8.4 sec

The M-theory 3-form and E8 gauge theory [article]

Emanuel Diaconescu, Daniel S. Freed, Gregory Moore
2004 arXiv   pre-print
We give a precise formulation of the M-theory 3-form potential C in a fashion applicable to topologically nontrivial situations.  ...  In our model the 3-form is related to the Chern-Simons form of an E8 gauge field.  ...  The cubic refinement law follows from the simple algebraic identity 1 6 (a + x + y + z) 3 − 1 6 (a + x + y) 3 − 1 6 (a + y + z) 3 − 1 6 (a + x + z) 3 + 1 6 (a + x) 3 + 1 6 (a + y) 3 + 1 6 (a + z) 3 − 1  ... 
arXiv:hep-th/0312069v2 fatcat:pbgoeehxmfac3my34uhuu7b6na

On the existence of cycle frames and almost resolvable cycle systems

H. Cao, M. Niu, C. Tang
2011 Discrete Mathematics  
A k-cycle system of order n whose cycle set can be partitioned into (n − 1)/2 almost parallel classes and a half-parallel class is called an almost resolvable k-cycle system, denoted by k-ARCS(n).  ...  Stinson et al. have resolved the existence of (3, λ)-cycle frames of type g u .  ...  So, we shall investigate the existence of almost resolvable cycle systems in this paper.  ... 
doi:10.1016/j.disc.2011.07.008 fatcat:otexovebjff2vaut72marufziy

Further results on almost resolvable cycle systems and the Hamilton-Waterloo problem

L. Wang, S. Lu, H. Cao
2017 Journal of combinatorial designs (Print)  
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length.  ...  We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the Hamilton-Waterloo problem.  ...  In the last section, we shall present some direct constructions and use these recursive constructions in Section 3 to prove our main results. 2 Almost resolvable k-cycle systems A k-cycle system of order  ... 
doi:10.1002/jcd.21571 fatcat:s6hhqbx7cjepnhthdo4f5wjiwm

More results on cycle frames and almost resolvable cycle systems

Meixin Niu, Haitao Cao
2012 Discrete Mathematics  
A k-cycle system of order n whose cycle set can be partitioned into (n − 1)/2 almost parallel classes and a half-parallel class is called an almost resolvable k-cycle system, denoted by k-ARCS(n).  ...  The existence of (k, λ)-cycle frames of type g u with 3 ≤ k ≤ 6 has been solved completely.  ...  Construction for ARCS In this section, we will use cycle frames to construct almost resolvable k-cycle systems. We first present a general construction for an almost resolvable k-cycle system. Proof.  ... 
doi:10.1016/j.disc.2012.08.002 fatcat:qqqhdler5fbhrn2a6qfjrpjkgm

Experimental and numerical characterization of ion-cyclotron heated protons on the Alcator C-Mod tokamak

V Tang, R R Parker, P T Bonoli, J C Wright, R S Granetz, R W Harvey, E F Jaeger, J Liptac, C L Fiore, M Greenwald, J H Irby, Y Lin (+1 others)
2007 Plasma Physics and Controlled Fusion  
Using a detailed model that accounts for beam, halo, and impurity CX, core proton temperatures of ∼30-120 keV are directly measured for the first time in lower density (n e0 ∼ 0.8 − 1.5 × 10 20 /m 3 )  ...  Alcator C-Mod plasmas using only ∼0.5 MW of ICRF power.  ...  All of these problems can play a role if a typical direct-sight real-time PHA system is used on Alcator C-Mod.  ... 
doi:10.1088/0741-3335/49/6/013 fatcat:sesn4taj6vfgfczz4d4s7diig4

Support sizes of triple systems

Charles J Colbourn, Charles C Lindner
1992 Journal of combinatorial theory. Series A  
The possible numbers of distinct blocks in a triple system of order v and index 1 are determined for all u and all A, with four exceptions when v= 14 and one exception when VE 8 (mod 12).  ...  The spectrum is determined using a number of general tripling constructions for triple systems.  ...  TS(v, A) with respect to two copies of the complete design. 1 TABLE I u I (mod 12) wu, A) (44 S", 3" + 2, S" + 3, . . . . M", A 1, 3, I,9 mu, m, + 4, m, + 6, m, + I, . . . .  ... 
doi:10.1016/0097-3165(92)90017-o fatcat:mpjwvcfrnjbuhmgaccrkvoledi

Equipartite and almost-equipartite gregarious 4-cycle systems

Elizabeth J. Billington, D.G. Hoffman
2008 Discrete Mathematics  
The latter complete multipartite graph, K n(m),t , having n parts of size m and one part of size t, has a gregarious 4-cycle decomposition if and only if (i) n 3, (ii) t m(n − 1)/2 and (iii) a 4-cycle  ...  decomposition exists, that is, either m and t are even or else m and t are both odd and n ≡ 0 (mod 8).  ...  There is a gregarious 4-cycle system of K n(m) where n 4 if and only if (i) m is even or (ii) m is odd and n ≡ 1 (mod 8).  ... 
doi:10.1016/j.disc.2007.07.056 fatcat:svbuumxgtzhghb46t6oiv3hmnu

Steiner systems $S(2,4,v)$ - a survey

Colin Reid, Alex Rosa
2010 Electronic Journal of Combinatorics  
We survey the basic properties and results on Steiner systems $S(2, 4, v)$, as well as open problems.  ...  Novák proves the following results for m(v): m(4) = m(5) = m(6) = 1, m(7) = m(8) = m(9) = 2, m(10) = m(11) = m(12) = 3, m(13) = m(14) = 6, m(36t+ 3) = 36t 2 + t, m(36t+ 6) = 36t 2 + 9t+ 1, m(36t+ 9) =  ...  12) v 2 +v+6 12 where m ≡ 0(mod 3), and α i = 1 for this p i .  ... 
doi:10.37236/39 fatcat:pnaqutsoz5ebhoppf6cm35hnaq

Intertwined Synchronized Systems [article]

D. Ahmadi Dastjerdi, S. Jangjooye Shaldehi
2014 arXiv   pre-print
is a coded system Z generated by {v^1α_1 v^2α_2:v^iα_i∈ V_i, i=1,2} and called the intertwined system.  ...  An asymmetric-RLL(d_1,k_1,d_0,k_0) system is a subshift of {0,1}^ Z with run of 1 and 0 restricted to S=[d_1,k_1]⊆ N_0= N∪{0} and S'=[d_0,k_0]⊆ N_0 respectively.  ...  with m mod T = n j .  ... 
arXiv:1211.2296v4 fatcat:sn5g4al7nncfjma4xs6eyripmy

Zero-sum flows for Steiner triple systems [article]

S. Akbari, A.C. Burgess, P. Danziger, E. Mendelsohn
2015 arXiv   pre-print
3 6 and with a zero-sum 5-flow if v≡ 1 4.  ...  It has been conjectured that every Steiner triple system, STS(v), on v points (v>7) admits a zero-sum 3-flow.  ...  A resolvable TS(v, λ) exists if and only if v ≡ 3 (mod 6), or v ≡ 0 (mod 6) and λ is even, v = 6, [16, 17] .  ... 
arXiv:1502.04096v2 fatcat:q7dq6akllvgxjk7ot6bed7ujva

Observing the continental-scale carbon balance: assessment of sampling complementarity and redundancy in a terrestrial assimilation system by means of quantitative network design

T. Kaminski, P. J. Rayner, M. Voßbeck, M. Scholze, E. Koffi
2012 Atmospheric Chemistry and Physics Discussions  
Here a hybrid approach is necessary, and we recommend its use in the development of integrated carbon observing systems. Atmos. Chem.  ...  This paper investigates the relationship between the heterogeneity of the terrestrial carbon cycle and the optimal design of observing networks to constrain it.  ...  Edited by: M. Heimann  ... 
doi:10.5194/acpd-12-7211-2012 fatcat:sq5h4lhgd5bchlrekfmofaktzu

Optimal Check Digit Systems Based on Modular Arithmetic

Luerbio Faria, Paulo Eustáquio Duarte Pinto, Natália Pedroza
2017 TEMA  
We present the necessary improvements in order to make all systems optimal. We also propose a new optimal system with 3 permutations for systems with modular base 10.  ...  In this article, we discuss check digits systems based on modular arithmetic, which are used worldwide. Check digits were created to eliminate most errors in data input of computational systems.  ...  Hence, the equation of the direct system may be re-written as follows: m−1 i=1 σ i (a i ) mod n = a m .  ... 
doi:10.5540/tema.2017.018.01.0105 fatcat:zbd2nopoqjeubbrhdhec3ajihm

A survey of Kirkman triple systems and related designs

D.R. Stinson
1991 Discrete Mathematics  
They proved that the desired schedule exists if and only if 'u = 3 mod 6.  ...  Since existence of a parallel class in an STS(v) requires that v = 0 mod 3, a necessary condition for the existence of a KTS(v) is v = 3 mod 6.  ...  The spectrum of resolvable coverings is almost completely determined by Assaf, Mendelsohn and Stinson in [3] .  ... 
doi:10.1016/0012-365x(91)90294-c fatcat:rd2luccrfffj3f5yzb4jkgnq7m

Almost resolvable decompositions of 2Kn into cycles of odd length

Katherine Heinrich, C.C Lindner, C.A Rodger
1988 Journal of combinatorial theory. Series A  
We prove that there exists an almost resolvable m-cycle decomposition of 2K" + 1 for all odd ma3 and all S> 1. SC  ...  That is, they constructed what they called an almost resolvable 2-fold triple system of order n for all n = 1 (mod 3).  ...  Ifs E (3, 5) then almost resolvable m-cycle decompositions of 2K, are constructed in Lemma 5.1. 1 3 . n E 1 (mod 2m) The main difference in our construction of almost resolvable m-cycle decompositions  ... 
doi:10.1016/0097-3165(88)90053-2 fatcat:avscrzbknfcjppke5o7hfjf6y4

Aerosol-climate interactions in the Norwegian Earth System Model – NorESM

A. Kirkevåg, T. Iversen, Ø. Seland, C. Hoose, J. E. Kristjánsson, H. Struthers, A. M. L. Ekman, S. Ghan, J. Griesfeller, E. D. Nilsson, M. Schulz
2012 Geoscientific Model Development Discussions  
The global direct radiative forcing (DRF) at the top of the atmosphere has changed from a small positive value to −0.08 W m −2 in CAM4-Oslo.  ...  objective of this study is to document and evaluate recent changes and updates to the module for aerosols and aerosol-cloud-radiation interactions in the atmospheric module CAM4-Oslo of the Norwegian Earth System  ...  -3 ) 0.01 0.1 1 10 Model (μg(SO 4 ) m -3 ) Modelled vs. measured SO 4 Meas. mean: 2.25 Mod. mean: 2.76 Correlation coeff: 0.64 0.5 < Mod.  ... 
doi:10.5194/gmdd-5-2599-2012 fatcat:efxdzqam6zgkblc7eo5pwapbr4
« Previous Showing results 1 — 15 out of 17,714 results