Working group report: Collider Physics

This is summary of the activities of the working group on collider physics in the IXth Workshop on High Energy Physics Phenomenology (WHEPP-9) held at the Institute of Physics, Bhubaneswar, India in January 2006. Some of the work subsequently done on these problems by the subgroups formed during the workshop is included in this report.     

Copper—A “Modern” Bioelement

Copper is a bioessential element in biology with truly unique chemical characteristics in its two relevant oxidation states +I and +II. Significant progress has been made in recent years in the elucidation of the frequently surprising biochemistry of this trace element. Those advances were especially furthered through mutual stimulation involving results from biochemistry, molecular biology, and medicine on one hand and the synthesis as well as the structural and spectroscopic characterization of low molecular weight model complexes on the other. The most notable features of protein-bound active copper are its almost exclusive function in the metabolism of O₂ or N/O compounds (NO, N₂O) and its frequent association with oxidizing organic and inorganic radicals such as tyrosyl, semiquinones, superoxide, or nitrosyl. This unique biological role of copper can be rationalized given its chemical and assumed evolutionary background.     

Packing chromatic number, $$\mathbf (1, 1, 2, 2) $$ ( 1 , 1 , 2 , 2 ) -colorings,and characterizing the Petersen graph

The packing chromatic number $$\chi _{\rho }(G)$$     

Connected Domatic Number in Planar Graphs

A dominating set in a graph G is a connected dominating set of G if it induces a connected subgraph of G. The connected domatic number of G is the maximum number of pairwise disjoint, connected dominating sets in V(G). We establish a sharp lower bound on the number of edges in a connected graph with a given order and given connected domatic number. We also show that a planar graph has connected domatic number at most 4 and give a characterization of planar graphs having connected domatic number 3.     

Limited packings in graphs

We define a k-limited packing in a graph, which generalizes a 2-packing in a graph, and give several bounds on the size of a k-limited packing. One such bound involves the domination number of the graph, and here we show all trees attaining the bound can be built via a simple sequence of operations. We consider graphs where every maximal 2-limited packing is a maximum 2-limited packing, and characterize their structure in a number of cases.     

On the singularity of Green's tensor for a perfectly conducting semi-infinite cone

This paper is intended to clarify a misunderstanding concerningthe source singularity of the electric Green's tensor for aperfectly conducting semi-infinite cone of circular cross-section.Tai's series expansion of the Green's tensor is known to lacka singular term at the source region. Jones has reconstructedthe solution to this problem and has pointed out the differencebetween his result and that of Tai. The aim of our paper isto demonstrate that, although Jones's closed-form solution iscorrect, there is a mistake in his comparison with Tai's seriessolution. We conclude that one of the two additional singularterms that Jones claims as missing from Tai's formula must beomitted. Besides, we compare Jones's closed-form solution withSmyshlyaev's solution to the very same problem. We concludethat the magnetic field expressions given by Jones and Smyshlyaevcoincide, but a singular term is missing from Smyshlyaev's expressionfor the electric field.