Supersymmetry is a fundamental feature of quantum theory described by supersymmetric Hamiltonian comprised several mechanical Hamiltonians with different potentials that allows us to relate information about the states and spectra constituent Hamiltonians. In this paper we reconstruct Ioffe’s set for singular non-separable two-dimensional Morse potential using supersymmetry from non-degenerate ...

A finite family B of balls with respect to an arbitrary norm inRd (d ≥ 2) is called a non-separable family if there is no hyperplane disjoint from ⋃ B that strictly separates some elements of B from all the other elements of B in Rd . In this paper we prove that if B is a non-separable family of balls of radii r1, r2, . . . , rn (n ≥ 2) with respect to an arbitrary norm in Rd (d ≥ 2), then B ca...

We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines. We prove that under the Axiom of Choice non-separable normed spaces cannot even be admissibly represented with respect to any compatible topology (a compatible topology is one which makes all bounded linear function...

This paper provides sufficient conditions for existence of Markovian equilibrium in models with non-paternalistic altruism extending to one generation ahead. When utility is non-separable, we show that each equilibrium savings policy correspondence is increasing everywhere and single-valued, except perhaps on a countable number of points. It is also upper hemi-continuous where it is single valu...

We give a combinatorial equivalent to the existence of a non-free hereditarily separable group of cardinality א1. This can be used, together with a known combinatorial equivalent of the existence of a non-free Whitehead group, to prove that it is consistent that every Whitehead group is free but not every hereditarily separable group is free. We also show that the fact that Z is a p.i.d. with i...

This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the ef ic ient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match t o diagonally orientated image features. In order to demonstrate the proposed method, a simple dictionary is developed and u...

We prove existence theorems for strong solutions of time-dependent mean field games with non-separable Hamiltonian. In a recent announcement, we showed existence of small, strong solutions for mean field games with local coupling. We first generalize that prior work to allow for non-separable Hamiltonians. This proof is inspired by the work of Duchon and Robert on the existence of small-data vo...

In this work we focus on location and approximation of a solution nonlinear integral equations Hammerstein-type when the kernel is non-separable through high order iterative process. For purpose, approximate by means separable then, perform complete study about convergence criteria for approximated obtained to our first problem. Different examples have been tested in apply theoretical results.

Learned image features can provide great accuracy in many Computer Vision tasks. However, when the convolution filters used to learn image features are numerous and not separable, feature extraction becomes computationally demanding and impractical to use in real-world situations. In this thesis work, a method for learning a small number of separable filters to approximate an arbitrary non-sepa...