No abstract uploaded!

The problem of inversion of the attenuated X-ray transformation is solved by an explicit formula. Several subsequent results are also given.

Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. In 1975, Erdos raised the problem of determining $f(n)$ (see J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976), p.247, Problem 11). Given a graph $H$, what is the maximum number of edges of a graph with $n$ vertices not containing $H$ as a subgraph? This number is denoted $ex(n,H)$, and is known as the Turan number. Erdos conjectured that there exists a positive constant $c$ such that $ex(n,C_{2k})\geq cn^{1+1/k}$(see P. Erdos, Some unsolved problems in graph theory and combinatorial analysis, Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969) , pp. 97--109, Academic Press, London, 1971). Haj\'{o}s conjectured that every simple even graph on $n$ vertices can be decomposed into at most $n/2$ cycles (see L. Lovasz, On covering of graphs, in: P. Erdos, G.O.H. Katona (Eds.), Theory of Graphs, Academic Press, New York, 1968, pp. 231 - 236 ). We present the problems, conjectures related to these problems and we summarize the know results.

No abstract uploaded!

We study a robust and efficient eigensolver for computing the positive dense spectrum of the two-dimensional transmission eigenvalue problem (TEP) which is derived from the Maxwell’s equation with complex media in pseudo-chiral model and the transverse magnetic mode. The discretized governing equations by the N ́ed ́elec edge element result in a large-scale quadratic eigenvalue problem (QEP). We estimate half of the positive eigenvalues of the QEP are on some interval which forms a dense spectrum of the QEP. The quadratic Jacobi-Davidson method with a so-called non-equivalence deflation technique is proposed to compute the dense spectrum of the QEP. Intensive numerical experiments show that our proposed method makes the convergence efficiently and robustly even it needs to compute more than 5000 desired eigenpairs. Numerical results also illustrate that the computed eigenvalue curves can be approximated by the non- linear functions which can be applied to estimate the density of the eigenvalues for the TEP.