Uniqueness for boundary value problems for second order finite difference equations

We establish maximum principles for second order difference equations and apply them to obtain uniqueness for solutions of some boundary value problems.

First- and second-order stimulus length selectivity in New World monkey striate cortex

Motion is a powerful cue for figure-ground segregation, allowing the recognition of shapes even if the luminance and texture characteristics of the stimulus and background are matched. In order to investigate the neural processes underlying early stages of the cue-invariant processing of form, we compared the responses of neurons in the striate cortex (V1) of anaesthetized marmosets to two types of moving stimuli: bars defined by differences in luminance, and bars defined solely by the coherent motion of random patterns that matched the texture and temporal modulation of the background. A population of form-cue-invariant (FCI) neurons was identified, which demonstrated similar tuning to the length of contours defined by first- and second-order cues. FCI neurons were relatively common in the supragranular layers (where they corresponded to 28% of the recorded units), but were absent from layer 4. Most had complex receptive fields, which were significantly larger than those of other V1 neurons. The majority of FCI neurons demonstrated end-inhibition in response to long first- and second-order bars, and were strongly direction selective, Thus, even at the level of V1 there are cells whose variations in response level appear to be determined by the shape and motion of the entire second-order object, rather than by its parts (i.e. the individual textural components). These results are compatible with the existence of an output channel from V1 to the ventral stream of extrastriate areas, which already encodes the basic building blocks of the image in an invariant manner.

Solvability of singular second order m-point boundary value problems of Dirichlet type

Let f : [0, 1] x R2 -> R be a function satisfying the Caxatheodory conditions and t(1 - t)e(t) epsilon L-1 (0, 1). Let a(i) epsilon R and xi(i) (0, 1) for i = 1,..., m - 2 where 0 < xi(1) < xi(2) < (...) < xi(m-2) < 1 - In this paper we study the existence of C[0, 1] solutions for the m-point boundary value problem [GRAPHICS] The proof of our main result is based on the Leray-Schauder continuation theorem.

Multiplicity results for second-order two-point boundary value problems with nonlinearities across several eigenvalues

We consider the boundary value problems for nonlinear second-order differential equations of the form u '' + a(t)f (u) = 0, 0 < t < 1, u(0) = u (1) = 0. We give conditions on the ratio f (s)/s at infinity and zero that guarantee the existence of solutions with prescribed nodal properties. Then we establish existence and multiplicity results for nodal solutions to the problem. The proofs of our main results are based upon bifurcation techniques. (c) 2004 Elsevier Ltd. All rights reserved.

Multiplicity results for second-order two-point boundary value problems with superlinear or sublinear nonlinearities

We consider boundary value problems for nonlinear second order differential equations of the form u + a(t) f(u) = 0, t epsilon (0, 1), u(0) = u(1) = 0, where a epsilon C([0, 1], (0, infinity)) and f : R --> R is continuous and satisfies f (s)s > 0 for s not equal 0. We establish existence and multiplicity results for nodal solutions to the problems if either f(0) = 0, f(infinity) = infinity or f(0) = infinity, f(0) = 0, where f (s)/s approaches f(0) and f(infinity) as s approaches 0 and infinity, respectively. We use bifurcation techniques to prove our main results. (C) 2004 Elsevier Inc. All rights reserved.

A geometric approach to quantum circuit lower bounds

What is the minimal size quantum circuit required to exactly implement a specified n-qubit unitary operation, U, without the use of ancilla qubits? We show that a lower bound on the minimal size is provided by the length of the minimal geodesic between U and the identity, I, where length is defined by a suitable Finsler metric on the manifold SU(2(n)). The geodesic curves on these manifolds have the striking property that once an initial position and velocity are set, the remainder of the geodesic is completely determined by a second order differential equation known as the geodesic equation. This is in contrast with the usual case in circuit design, either classical or quantum, where being given part of an optimal circuit does not obviously assist in the design of the rest of the circuit. Geodesic analysis thus offers a potentially powerful approach to the problem of proving quantum circuit lower bounds. In this paper we construct several Finsler metrics whose minimal length geodesics provide lower bounds on quantum circuit size. For each Finsler metric we give a procedure to compute the corresponding geodesic equation. We also construct a large class of solutions to the geodesic equation, which we call Pauli geodesics, since they arise from isometries generated by the Pauli group. For any unitary U diagonal in the computational basis, we show that: (a) provided the minimal length geodesic is unique, it must be a Pauli geodesic; (b) finding the length of the minimal Pauli geodesic passing from I to U is equivalent to solving an exponential size instance of the closest vector in a lattice problem (CVP); and (c) all but a doubly exponentially small fraction of such unitaries have minimal Pauli geodesics of exponential length.