Intermittency in the Slow Particle Emission During Hadron–Nucleus Interactions

The study of the angular distribution of slow particles during high energy hadron-nucleus interaction indicates that emission of slow particles takes place from a thermally non-equilibrated system. This evidence has come out from the presence of intermittency - a phenomenon that reveals a fractal structure and represents a self-similarity in the particle production process. Hence, this study highlights inadequacy of cascade-evaporation model and advocates the need of its refinement.     

Generation of angular momentum of fission fragments in a cluster model

Based on the dinuclear system concept, the role of bending vibrations in creation of the angular momentum of primary fission fragments is investigated. For ²⁵²Cf spontaneous fission, the angular momenta of the fragments are calculated as a function of the neutron multiplicity and compared with available experimental data. Different cluster compositions of the ²⁵²Cf fission modes at the scission point are considered.     

Justification of Averaging Method for Multifrequency Impulsive Systems

We prove new theorems on the justification of the averaging method for multifrequency oscillation systems with pulse influence at fixed times.     

Analysis of Two-Dimensional Optical Fields Using an Additional Shift

A solution to the phase problem in optics is considered within the context of registration and analysis of two-dimensional stationary optical fields transformed by the object under study or fields forming an image. To obtain information on amplitude and phase distributions of the light field analyzed, a method of registration of two intensity distributions is used. The first distribution corresponds directly to the amplitude distribution. The other is formed for the sum of the initial field and the field shifted along a certain direction. The intensity distributions obtained allow one to calculate the two-dimensional structure of the field under study. It is noteworthy that the method requires no iteration procedures in solving the problem. This leads to speeding up of the processing and analysis of the information. Two variants of optical schemes for the analysis of light fields are considered. The first one corresponds to registration of the image of the analyzed plane and the second to registration of the spectrum of the spatial frequencies.     

What is a design? How should we classify them?

Design theory crosses the boundary between mathematics and statistics, and includes a wide range of disparate types of design. In this paper we present a classification scheme which aims to include as many important types as possible, based on a balance among concept, representation and use.     

20-relative neighborhood graphs are hamiltonian

For any two points p and q in the Euclidean plane, define LUN_pq = { v | v ∈ R², d_pv < d_pq and d_qv < d_pq}, where d_uv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUN_pq(V) = V ∩ LUN_pq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUN_pq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUN_pq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn₂) time. Let E_c = {e_pq| p ∈ V and q ∈ V}. Then G_c = (V,E_c) is a complete graph. For any subset F of E_c, define the maximum distance of F as max_epq∈Fd_pq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph G_c whose maximum distance is the minimum among all Hamiltonian cycles in graph G_c. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.     

Note on a conjecture of toft

A conjecture of Toft [17] asserts that any 4-critical graph (or equivalently, every 4-chromatic graph) contains a fully odd subdivision ofK ₄. We show that if a graphG has a degree three nodev such thatG-v is 3-colourable, then eitherG is 3-colourable or it contains a fully oddK ₄. This resolves Toft's conjecture in the special case where a 4-critical graph has a degree three node, which is in turn used to prove the conjecture for line-graphs. The proof is constructive and yields a polynomial algorithm which given a 3-degenerate graph either finds a 3-colouring or exhibits a subgraph that is a fully odd subdivision ofK ₄. (A graph is 3-degenerate if every subgraph has some node of degree at most three.)