Related papers: Formation of fragments in heavy-ion collisions usi…
Theoretical expressions for ionization cross sections by electron impact based on the binary encounter Bethe (BEB) model, valid from ionization threshold up to relativistic energies, are proposed. The new modified BEB (MBEB) and its…
In length-constrained minimum spanning tree (MST) we are given an $n$-node graph $G = (V,E)$ with edge weights $w : E \to \mathbb{Z}_{\geq 0}$ and edge lengths $l: E \to \mathbb{Z}_{\geq 0}$ along with a root node $r \in V$ and a…
In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST problem we want to find the cheapest tree spanning at least…
Kinetic energy spectra and fragment velocity correlations, simulated by means of stochastic mean-field calculations, are successfully confronted with experimental data for single multifragmenting sources prepared at the same excitation…
Numerical simulations of Aluminum (Al) and Tungsten (W) granular composite rings under various dynamic loading conditions caused by explosive loading were examined. Three competing mechanisms of fragmentation were observed: a continuum…
Experimental data related to fragment production in central Au on Au collisions were analyzed in the framework of a modified statistical model which considers cluster production both prior and at the equilibrated stage. The analysis…
Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree spanning trees, which have received significant attention. Let $P =…
To explore the roles of dynamical model and statistical model in the description of multifragmentation in heavy-ion collisions at intermediate energies, the fragments charge distributions of $^{197}$Au+$^{197}$Au at 35 MeV/u are analyzed by…
Parametrizations of fragmentation functions (FFs) from $e^+$-$e^-$ and p-\=p collisions are combined with a parton spectrum model in a pQCD folding integral to produce minimum-bias {\em fragment distributions}. A model of in-medium FF…
We introduce isospin dependence in the cluster recognition algorithms used in the Quantum Molecular Dynamics model to describe fragment formation in heavy ion collisions. This change reduces the yields of emitted nucleons and enhances the…
Algorithms for dynamically maintaining minimum spanning trees (MSTs) have received much attention in both the parallel and sequential settings. While previous work has given optimal algorithms for dense graphs, all existing parallel…
Nuclear collisions at intermediate, relativistic, and ultra-relativistic energies offer unique opportunities to study in detail manifold fragmentation and clustering phenomena in dense nuclear matter. At intermediate energies, the well…
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method…
Experimental studies of fission induced in relativistic nuclear collisions show a systematic enhancement of the excitation energy of the primary fragments by a factor of ~ 2, before their decay by fission and other secondary fragments.…
Invariant cross sections of intermediate mass fragments in peripheral collisions of Au on Au at incident energies between 40 and 150 AMeV have been measured with the 4-pi multi-detector INDRA. The maximum of the fragment production is…
We perform a study of the fragmentation path of excited nuclear sources, within the framework of a stochastic mean-field approach. We consider the reaction $^{129}$Xe + $^{119}$Sn at two beam energies: 32 and 50 MeV/A, for central…
We investigate the fragmentation process of solid materials with crystalline and amorphous phases using the discrete element method. Damage initiates inside spherical samples above the contact zone in a region where the circumferential…
We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical…
We report directed flow ($v_1$) of multistrange baryons ($\Xi$ and $\Omega$) and improved $v_1$ data for $K^{-}$, $\bar{p}$, $\bar{\Lambda}$ and $\phi$ in Au+Au collisions at $\sqrt{s_{\mathrm{NN}}}=$27 and 200 GeV from the STAR experiment…
We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is…