Reconstruction of a three-dimensional object from a limited range of views

We define the Radon transform and the back projection ^* (adjoint of ) on the space of C^∞ rapidly decreasing functions and on the space of distributions of compact support ′. We show that ^* is a convolution operator. The result is true in the case of full views as well as in the case of a limited range of views. An application to the medical image reconstruction is given.     

A remark on a maximal function over a Cantor set of directions

LetM _e ⁰ be the maximal operator over segments of length 1 with directions belonging to a Cantor set. It has been conjectured that this operator is bounded onL ². We consider a sequence of operators over finite sets of directions converging toM _e ⁰ . We improve the previous estimate for the (L ²,L ²)-norm of these particular operators. We also prove thatM _e ⁰ is bounded from some subsets ofL ² toL ². These subsets are composed of positive functions whose Fourier transforms have a very weak decay or are supported in a vertical strip. Partially supported by Spanish DGICYT grant no. PB90-0187.     

Positivity of the two-particle Hamiltonian on a lattice

We consider a two-particle Hamiltonian on the d-dimensional lattice ℤ^d. We find a sufficient condition for the positivity of a family of operators h(k) appearing after the “separation of the center of mass” of a system of two particles depending on the values of the total quasimomentum k ∈ T^d (where T^d is a d-dimensional torus). We use the obtained result to show that the operator h(k) has positive eigenvalues for nonzero k ∈ T^d. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 153, No. 3, pp. 381–387, December, 2007.     

Convergence analysis of a discontinuous Galerkin method for a sub-diffusion equation

We employ a piecewise-constant, discontinuous Galerkin method for the time discretization of a sub-diffusion equation. Denoting the maximum time step by k, we prove an a priori error bound of order k under realistic assumptions on the regularity of the solution. We also show that a spatial discretization using continuous, piecewise-linear finite elements leads to an additional error term of order h ² max (1,logk ^− 1). Some simple numerical examples illustrate this convergence behaviour in practice. We thank the University of New South Wales for financial support provided by a Faculty Research Grant.     

Proof of a conjecture on a discretized elliptic equation with cubic nonlinearity

We sharpen and prove a conjecture suggested by Chen and Xie, which states that in Galerkineigenfunction discretization for -Δu = u3 , when the finite-dimensional subspace is taken as the eigensubspace corresponding to an N-fold eigenvalue of -Δ, the discretized problem has at least 3N-1 distinct nonzero solutions. We also present a related result on the multiplicities of eigenvalues of -Δ.     

Quantum Dynamics of a Resonator Coupled to a SET

We study the quantum dynamics of a resonator driven by a superconducting single-electron transistor. We prove the existence of the Minimal Quantum Dynamical Semigroup T ^(min){\mathcal {T}^{\,({\rm min})}} solving the evolution equation for the density matrix, then we prove that T ^(min){\mathcal {T}^{\,({\rm min})}} is Markov. Moreover we prove the existence and uniqueness of a faithful normal stationary state and show that the dynamics converges towards this stationary state when time goes to infinity.     

An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in Rn

We consider the problem of projecting a vector on the intersection of a hyperplane and a box in Rⁿ. This paper extends a previous result of Maculan, Minoux, and Plateau (Ref. 1) concerning the projection of a vector on the intersection of a hyperplane and Rⁿ ₊. We present an O(n) time algorithm based on the linear-time median-finding algorithm. This algorithm determines the median of the components of the vector to be projected. Computational results are also presented in order to evaluate the algorithm and its time complexity. We consider two sets of instances which are randomly generated for any given n. The algorithm was successful in solving all the instances in a reasonable time.     

Stability and localization of unbounded solutions of a nonlinear heat equation in a plane

The article investigates unbounded solutions of the equation u _t = div (u ^σgrad u) + u ^β in a plane. We numerically analyze the stability of two-dimensional self-similar solutions (structures) that increase with blowup. We confirm structural stability of the simple structure with a single maximum and metastability of complex structures. We prove structural stability of the radially symmetrical structure with a zero region at the center and investigate its attraction region. We study the effect of various perturbations of the initial function on the evolution of self-similar solutions. We further investigate how arbitrary compact-support initial distributions attain the self-similar mode, including distributions whose support is different from a disk. We show that the self-similar mode described by a simple radially symmetrical structure is achieved only in the central region, while the entire localization region does not have enough time to transform into a disk during blowup. We show for the first time that simple structures may merge into a complex structure, which evolves for a long time according to self-similar law.     

Heat flow and a faster algorithm to compute the surface area of a convex body

We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm for approximating the surface area of a convex body given by a membership oracle. Our method has a complexity of O^*(n⁴), where n is the dimension, compared to O^*(n⁸) for the previous best algorithm. We show that our complexity cannot be improved given the current state‐of‐the‐art in volume estimation. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 43, 407–428, 2013     

Diameter of a direct power of a finite group

We present two conjectures concerning the diameter of a direct power of a finite group. The first conjecture states that the diameter of Gⁿ with respect to each generating set is at most n(|G|?rank(G)); and the second one states that there exists a generating set 𝒜, of minimum size, for Gⁿ such that the diameter of Gⁿ with respect to 𝒜 is at most n(|G|?rank(G)). We will establish evidence for each of the above mentioned conjectures.     

An example of a complete orthonormal system in a Hilbert space of generalized functions

We construct a complete orthonormal system of generalized functions in a Hilbert space W ^?1. We obtain an estimate of the error of approximation in W ^?1, which is expressed in terms of the integral modulus of continuity of a function from L ₂.     

Embedding a polytope in a lattice

We present a special similarity ofR ⁴ⁿ which maps lattice points into lattice points. Applying this similarity, we prove that if a (4n−1)-polytope is similar to a lattice polytope (a polytope whose vertices are all lattice points) inR ⁴ⁿ , then it is similar to a lattice polytope inR ⁴ⁿ⁻¹, generalizing a result of Schoenberg [4]. We also prove that ann-polytope is similar to a lattice polytope in someR ^N if and only if it is similar to a lattice polytope inR ²ⁿ⁺¹, and if and only if sin²(<ABC) is rational for any three verticesA, B, C of the polytope.     

The average rank of a product of transformations

We derive an exact formula for the average rank of a product fg of transformations of an n-element set in terms of the ranks of f and g. We show that if no restrictions are placed on the ranks of f and g, this average rank asymptotically equals n(1−exp (e⁻¹−1)). We show that there exist two transformations which generate a semigroup of nⁿ−(n−1)ⁿ+(n−1) (−1)ⁿ⁺¹+n elements.     

Optimally Cutting a Surface into a Disk

We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this problem is NP-hard in general, even for manifolds without boundary and for punctured spheres. We also describe an algorithm with running time n ^O(g+k), where n is the combinatorial complexity, g is the genus, and k is the number of boundary components of the input surface. Finally, we describe a greedy algorithm that outputs a O(log² g)-approximation of the minimum cut graph in O(g ² n log n) time.     

Meromorphic solutions of a Riccati differential equation with a doubly periodic coefficient

We treat a Riccati differential equation w^′+w²+p(z)=0, where p(z) is a nonconstant doubly periodic meromorphic function. Under certain assumptions, every solution is meromorphic in the whole complex plane. We show that the growth order of it is equal to 2, and examine the frequency of α-points and poles. Furthermore, the number of doubly periodic solutions is discussed.     

Topological rearrangement of a function

We extend our results on weak diffeomorphism classes and decompositions of Sobolev functions to a more general framework. We introduce a family of decompositions of Sobolev functions W₀^1,p rich enough that we conjecture it allows decomposition of all Sobolev functions, not just the “craterless” ones considered in [7]. The associated weak diffeomorphism classes of a W₀^1,p Sobolev function are weakly closed when p ≥ n.     

Analytic continuation of a class of dirichlet series

We consider Dirichlet series of the type Σ(logk)ⁿ(k)(logk)?^-s. We prove the existence of an analytic continuation to the cut plane and give exact information about the singularity. We use this to generalize results, which occur in Ramanujan’s second notebook.     

Identification of a Connection from Cauchy Data on a Riemann Surface with Boundary

We consider a connection ?^X{\nabla^X} on a complex line bundle over a Riemann surface with boundary M ₀, with connection 1-form X. We show that the Cauchy data space of the connection Laplacian (also called magnetic Laplacian) L : = ?^X*?^X + q{L := \nabla^X{^*\nabla^X} + q} , with q a complex-valued potential, uniquely determines the connection up to gauge isomorphism, and the potential q.     

Measures of affinity of a sequence for a number

We define strong and weak affinities of a number a for a sequence (x_k ) denoted by L (a,(x_k )) and U (a, (x_k )) respectively. We show U (a,(x_k )) > 0 if and only if the number a is a statistical limit point of the sequence (x_k ). We consider the distribution of sequences with positive weak and strong measures of affinity within the space l ^∞ of bounded sequences. The main result is that the set of bounded sequences with U (a,(x_k )) > 0, that is, the set of sequences with statistical limit points, is a dense subset in l ^∞ of the first category. We also show the set of sequences with positive strong affinities is a nowhere dense subset of l ^∞.     

The monodromy of a series of hypersurface singularities

Let {f=0} be a hypersurface inC ⁿ⁺¹ with a 1-dimensional singular set Σ. We consider the series of hypersurfaces {f+ɛx ^N=0} wherex is a generic linear form. We derive a formula, which relates the characteristic polynomials of the monodromies off andf+ɛx ^N. Other ingredients in this formula are the horizontal and the vertical monodromies of the transversal (isolated) singularities on each branch of the singular set. We use polar curves and the carrousel method in the proof. The formula is a generalization of the Iomdin formula for the Milnor numbers: μ(f+ɛx ^N )=μ _n (f)−μ _n −1(f)+Ne ₀(Σ)