arXiv subjects
Publications and source records attributed to V. Ejov.
We consider a finite state, finite action, zero-sum stochastic games with data defining the game lying in the ordered field of algebraic numbers. In both the discounted and the limiting average versions of these games we prove that the value vector also lies in the same field of algebraic numbers. In a prescribed sense, our results settle a problem that has remained open since, at least, 1991.
The results of data handling for E-184 experiment obtained with 70 GeV proton beam irradiation of active target with carbon, silicon and lead plates are presented. Two-prongs neutral charmed D0 and Ď0 -mesons decays were selected. Signal / background ratio was (51+/-17) / (38+/-13). Registration efficiency for mesons was defined and evaluation for charm production cross section at threshold energy is presented: sigma(cĉ) = 7.1 +/- 2.4(stat.) +/- 1.4(syst.) (μ/nucleon).
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and variance of the exponentials of graph eigenvalues cluster around a line segment that we call a filar. Zooming-in reveals that this cluster splits into smaller segments (filars) labeled by the number of triangles in graphs. Further zooming-in shows that the smaller filars split into subfilars labelled by the number of quadrangles in graphs, etc. We call this fractal structure, discovered in a numerical experiment, a multifilar structure. We also provide a mathematical explanation of this phenomenon based on the Ihara-Selberg trace formula, and compute the coordinates and slopes of all filars in terms of Bessel functions of the first kind.
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the edges incident to them admit a unique coloring) and ``soft'' ones (such that the edges incident to them admit two distinct colorings), and then to perform the coloring. The computational complexity of this algorithm is on a par with (or even below) the fastest known algorithms that find a single 3-edge coloring or a Hamiltonian cycle for a cubic graph.