نتایج جستجو برای: strongly j_n
تعداد نتایج: 218533 فیلتر نتایج به سال:
A biplane is a 2-(k(k − 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k = 11, and at least two biplanes with k = 13. It is here shown by exhaustive computer search that the list of five known biplanes with k = 11 is complete. This result further implies that there exists no 3-(57, 12, 2) des...
Higlighting certain similarities between the two-dimensional Luttinger liquid model and the effective fermionic theory obtained from the hypercharge Lagrangian, we argue the case for a new type of Standard Model extension.
Obtaining start-up funding for new product ideas in large corporations is inherently frustrating. We evaluated teams that were successful in obtaining start-up funds from large corporations to determine the importance of the executive champion and team commitment and conflict. We found that the funding level was strongly correlated (R=0.104; p=0.002) with higher levels (β=0.193; p=0.016) of cha...
The existence of a partial quadrangle PQ(s, t, μ) is equivalent to the existence of a diamond-free strongly regular graph SRG(1+s(t+1)+s2t(t+1)/μ, s(t+1), s−1, μ). Let S be a PQ(3, (n + 3)(n2 − 1)/3, n2 + n) such that for every two non-collinear points p1 and p2, there is a point q non-collinear with p1, p2, and all points collinear with both p1 and p2. In this article, we establish that S exis...
In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5. Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph. For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic. In this way, we deal completely with 34 of these parameter se...
Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices
We present 15 new partial difference sets over 4 non-abelian groups of order 100 and 2 new strongly regular graphs with intransitive automorphism groups. The strongly regular graphs and corresponding partial difference sets have the following parameters: (100,22,0,6), (100,36,14,12), (100,45,20,20), (100,44,18,20). The existence of strongly regular graphs with the latter set of parameters was a...
This paper discusses novel research conducted to study the direct impact of learner’s affective changes on the value of a well established EEG-mental engagement index. An acquisition protocol for recording the electrical activity of the human brain, known as electroencephalography or EEG, was implemented in a learning environment specifically constructed for emotional elicitation. Data was coll...
c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
We present an algorithm for a construction of strongly regular families of trian-gulations for planar domains with a piecewise smooth boundary. Some additional properties of resulting triangulations are considered.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید