arXiv subjects

F. Bonomo

Publications and source records attributed to F. Bonomo.

3 recordsLinked to original sources

arXiv2022

Beam characterization by means of emission spectroscopy in the ELISE test facility

The ELISE test facility at IPP Garching hosts a RF H-/D- ion source and an acceleration system. Its target is to demonstrate the performance foreseen for the ITER NBI system in terms of extracted current density (H/D), fraction of co-extracted electrons and pulse duration. The size of the ELISE extraction area is half that foreseen for the ITER NBI. This paper presents a detailed study of the ELISE beam divergence and uniformity. In particular, it was possible to describe the beam as the sum of two components at very different divergence: about 2° vs. 5°÷7°. As test cases, the beam properties have been measured as function of two source parameters. The first one is the current flowing through the grid facing the plasma, the Plasma Grid, in order to generate the magnetic filter field. The second one is the bias current flowing between the Plasma Grid and the source walls. Both the filter field and the bias current influence the fraction of co-extracted electrons, but also the properties of the plasma just in front of the extraction system and the beam properties. The divergence and the uniformity of the beam have been measured by a Beam Emission Spectroscopy (BES) diagnostic; the detailed analysis of the raw spectra collected by BES led to describing the beam with two components of different divergence. This concept has been supported by the information given by thermal imaging of the diagnostic calorimeter. Further support to the proposed beam model has been found in the behavior of the currents flowing in the acceleration system and beamline components; these currents are given by the most divergent (charged) particles of the beam.

physics.plasm-ph↗

arXiv2015

Vertex intersection graphs of paths on a grid: characterization within block graphs

We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, the so called $B_0$-VPG graphs. Recognizing this class is an NP-complete problem. Although, there exists a polynomial time algorithm for recognizing chordal $B_0$-VPG graphs. In this paper, we present a minimal forbidden induced subgraph characterization of $B_0$-VPG graphs restricted to block graphs. As a byproduct, the proof of the main theorem provides an alternative certifying recognition and representation algorithm for $B_0$-VPG graphs in the class of block graphs.

math.CO↗

arXiv2015

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a rectangular grid such that two vertices are adjacent if and only if the corresponding paths share at least one edge of the grid. For a nonnegative integer $k$, $B_k$-EPG graphs are defined as EPG graphs admitting a model in which each path has at most $k$ bends. Circular-arc graphs are intersection graphs of open arcs of a circle. It is easy to see that every circular-arc graph is a $B_4$-EPG graph, by embedding the circle into a rectangle of the grid. In this paper, we prove that every circular-arc graph is $B_3$-EPG, and that there exist circular-arc graphs which are not $B_2$-EPG. If we restrict ourselves to rectangular representations (i.e., the union of the paths used in the model is contained in a rectangle of the grid), we obtain EPR (edge intersection of path in a rectangle) representations. We may define $B_k$-EPR graphs, $k\geq 0$, the same way as $B_k$-EPG graphs. Circular-arc graphs are clearly $B_4$-EPR graphs and we will show that there exist circular-arc graphs that are not $B_3$-EPR graphs. We also show that normal circular-arc graphs are $B_2$-EPR graphs and that there exist normal circular-arc graphs that are not $B_1$-EPR graphs. Finally, we characterize $B_1$-EPR graphs by a family of minimal forbidden induced subgraphs, and show that they form a subclass of normal Helly circular-arc graphs.

math.CO↗