Searcharxiv⌕ Search

arXiv subjects

J. J. P. Veerman

Publications and source records attributed to J. J. P. Veerman.

At least 37 records · Page 2Linked to original sources

A New Method for Multi-Bit and Qudit Transfer Based on Commensurate Waveguide Arrays

The faithful state transfer is an important requirement in the construction of classical and quantum computers. While the high-speed transfer is realized by optical-fibre interconnects, its implementation in integrated optical circuits is affected by cross-talk. The cross-talk between densely packed optical waveguides limits the transfer fidelity and distorts the signal in each channel, thus severely impeding the parallel transfer of states such as classical registers, multiple qubits and qudits. Here, we leverage on the suitably engineered cross-talk between waveguides to achieve the parallel transfer on optical chip. Waveguide coupling coefficients are designed to yield commensurate eigenvalues of the array and hence, periodic revivals of the input state. While, in general, polynomially complex, the inverse eigenvalue problem permits analytic solutions for small number of waveguides. We present exact solutions for arrays of up to nine waveguides and use them to design realistic buses for multi-(qu)bit and qudit transfer. Advantages and limitations of the proposed solution are discussed in the context of available fabrication techniques.

math-ph↗

Classification of Minimal Separating Sets in Low Genus Surfaces

Consider a surface $S$ and let $M\subset S$. If $S\setminus M$ is not connected, then we say $M$ \emph{separates} $S$, and we refer to $M$ as a \emph{separating set} of $S$. If $M$ separates $S$, and no proper subset of $M$ separates $S$, then we say $M$ is a \emph{minimal separating set} of $S$. In this paper we use methods of computational combinatorial topology to classify the minimal separating sets of the orientable surfaces of genus $g=2$ and $g=3$. The classification for genus 0 and 1 was done in earlier work, using methods of algebraic topology.

math.CO↗

Social Balance and the Bernoulli Equation

Since the 1940's there has been an interest in the question why social networks often give rise to two antagonistic factions. Recently a dynamical model of how and why such a balance might occur was developed. This note provides an introduction to the notion of social balance and a new (and simplified) analysis of that model. This new analysis allows us to choose general initial conditions, as opposed to the symmetric ones previously considered. We show that for general initial conditions, four factions will evolve instead of two. We characterize the four factions, and we give an idea of their relative sizes.

physics.soc-ph↗

Spectra of Tridiagonal Matrices

We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary conditions, we mean the first and last row of the matrix. For large $n$, we show there are up to $4$ eigenvalues, the so-called \emph{special eigenvalues}, whose behavior depends sensitively on the boundary conditions. The other eigenvalues, the so-called \emph{regular eigenvalues} vary very little as function of the boundary conditions. For large $n$, we determine the regular eigenvalues up to ${\cal O}(n^{-2})$, and the special eigenvalues up to ${\cal O}(κ^n)$, for some $κ\in (0,1)$. The components of the eigenvectors are determined up to ${\cal O}(n^{-1})$. The matrices we study have important applications throughout the sciences. Among the most common ones are arrays of linear dynamical systems with nearest neighbor coupling, and discretizations of second order linear partial differential equations. In both cases, we give examples where specific choices of boundary conditions substantially influence leading eigenvalues, and therefore the global dynamics of the system.

math.NA↗

Dynamics of locally coupled agents with next nearest neighbor interaction

We consider large but finite systems of identical agents on the line with up to next nearest neighbor asymmetric coupling. Each agent is modelled by a linear second order differential equation, linearly coupled to up to four of its neighbors. The only restriction we impose is that the equations are decentralized. In this generality we give the conditions for stability of these systems. For stable systems, we find the response to a change of course by the leader. This response is at least linear in the size of the flock. Depending on the system parameters, two types of solutions have been found: damped oscillations and reflectionless waves. The latter is a novel result and a feature of systems with at least next nearest neighbor interactions. Analytical predictions are tested in numerical simulations.

math.DS↗

Transients of platoons with asymmetric and different Laplacians

We consider an asymmetric control of platoons of identical vehicles with nearest-neighbor interaction. Recent results show that if the vehicle uses different asymmetries for position and velocity errors, the platoon has a short transient and low overshoots. In this paper we investigate the properties of vehicles with friction. To achieve consensus, an integral part is added to the controller, making the vehicle a third-order system. We show that the parameters can be chosen so that the platoon behaves as a wave equation with different wave velocities. Simulations suggest that our system has a better performance than other nearest-neighbor scenarios. Moreover, an optimization-based procedure is used to find the controller properties.

eess.SY↗

On a Convex Set with Nondifferentiable Metric Projection

A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to obtain a convex set with smooth boundary which possesses the same property.

math.OC↗

Transients in the Synchronization of Oscillator Arrays

The purpose of this note is threefold. First we state a few conjectures that allow us to rigorously derive a theory which is asymptotic in N (the number of agents) that describes transients in large arrays of (identical) linear damped harmonic oscillators in R with completely decentralized nearest neighbor interaction. We then use the theory to establish that in a certain range of the parameters transients grow linearly in the number of agents (and faster outside that range). Finally, in the regime where this linear growth occurs we give the constant of proportionality as a function of the signal velocities (see [3]) in each of the two directions. As corollaries we show that symmetric interactions are far from optimal and that all these results independent of (reasonable) boundary conditions.

math.DS↗

Signal Velocity in Oscillator Networks

We investigate a system of coupled oscillators on the circle, which arises from a simple model for behavior of large numbers of autonomous vehicles. The model considers asymmetric, linear, decentralized dynamics, where the acceleration of each vehicle depends on the relative positions and velocities between itself and a set of local neighbors. We first derive necessary and sufficient conditions for asymptotic stability, then derive expressions for the phase velocity of propagation of disturbances in velocity through this system. We show that the high frequencies exhibit damping, which implies existence of well-defined signal velocities $c_+>0$ and $c_-<0$ such that low frequency disturbances travel through the flock as $f(x-c_+t)$ in the direction of increasing agent numbers and $f(x-c_-t)$ in the other.

math.DS↗

Tridiagonal Matrices and Boundary Conditions

We describe the spectra of certain tridiagonal matrices arising from differential equations commonly used for modeling flocking behavior. In particular we consider systems resulting from allowing an arbitrary boundary condition for the end of a one dimensional flock. We apply our results to demonstrate how asymptotic stability for consensus and flocking systems depends on the imposed boundary condition.

math.CA↗

On Rank Driven Dynamical Systems

We investigate a class of models related to the Bak-Sneppen model, initially proposed to study evolution. The BS model is extremely simple and yet captures some forms of "complex behavior" such as self-organized criticality that is often observed in physical and biological systems. In this model, random fitnesses in $[0,1]$ are associated to agents located at the vertices of a graph $G$. Their fitnesses are ranked from worst (0) to best (1). At every time-step the agent with the worst fitness and some others \emph{with a priori given rank probabilities} are replaced by new agents with random fitnesses. We consider two cases: The \emph{exogenous case} where the new fitnesses are taken from an a priori fixed distribution, and the \emph{endogenous case} where the new fitnesses are taken from the current distribution as it evolves. We approximate the dynamics by making a simplifying independence assumption. We use Order Statistics and Dynamical Systems to define a \emph{rank-driven dynamical system} that approximates the evolution of the \emph{distribution} of the fitnesses in these rank-driven models, as well as in the Bak-Sneppen model. For this simplified model we can find the limiting marginal distribution as a function of the initial conditions. Agreement with experimental results of the BS model is excellent.

math.DS↗

Stability of Large Flocks: an Example

The movement of a flock with a single leader (and a directed path from it to every agent) can be stabilized. Nonetheless for large flocks perturbations in the movement of the leader may grow to a considerable size as they propagate throughout the flock and before they die out over time. As an example we consider a string of N+1 oscillators moving in the line. Each one `observes' the relative velocity and position of only its nearest neighbors. This information is then used to determine its own acceleration. Now we fix all parameters except the number of oscillators. We then show (within a certain class of systems) that a perturbation in the leader's orbit is almost always amplified exponentially in N as it propagates towards the outlying members of the flock. The only exception is when there is a symmetry present in the interaction: in that case the growth of the perturbation is linear in N.

nlin.PS↗

Impulse Stability of Large Flocks: an Example

Consider a string of N+1 damped oscillators moving on the line of which the motion of the first (called the "leader") is independent of the others. Each of the followers `observes' the relative velocity and position of only its nearest neighbors. Inasmuch as these are different from 0, this information is then used to determine its own acceleration. Fix all parameters except the number N in such a way that the system is asymptotically stable. Now as N tends tends we consider the following problem. At t=0 the leader gets kicked and starts moving with unit velocity away from the flock. Due to asymptotic stability the followers will eventually fall in behind the leader and travel each at its own predetermined distance from the leader. In this note we conjecture that before equilibrium ensues, the perturbations to the orbit of the last oscillator grow exponentially in N except when there is a symmetry in the interactions and the growth is then linear in N. There are two cases. We prove the conjecture in one case, and give a strong heuristic argument in the other.

nlin.PS↗

Eisenstein Series and String Thresholds

We investigate the relevance of Eisenstein series for representing certain $G(Z)$-invariant string theory amplitudes which receive corrections from BPS states only. $G(Z)$ may stand for any of the mapping class, T-duality and U-duality groups $Sl(d,Z)$, $SO(d,d,Z)$ or $E_{d+1(d+1)}(Z)$ respectively. Using $G(Z)$-invariant mass formulae, we construct invariant modular functions on the symmetric space $K\backslash G(R)$ of non-compact type, with $K$ the maximal compact subgroup of $G(R)$, that generalize the standard non-holomorphic Eisenstein series arising in harmonic analysis on the fundamental domain of the Poincaré upper half-plane. Comparing the asymptotics and eigenvalues of the Eisenstein series under second order differential operators with quantities arising in one- and $g$-loop string amplitudes, we obtain a manifestly T-duality invariant representation of the latter, conjecture their non-perturbative U-duality invariant extension, and analyze the resulting non-perturbative effects. This includes the $R^4$ and $R^4 H^{4g-4}$ couplings in toroidal compactifications of M-theory to any dimension $D\geq 4$ and $D\geq 6$ respectively.

hep-th↗

Single-particle model for a granular ratchet

A simple model for a granular ratchet corresponding to a single grain bouncing off a vertically vibrating sawtooth-like base is studied. Depending on the vibration strength, the sawtooth roughness and the restitution coefficient, horizontal transport in both the preferred and unfavoured directions is observed. A phase diagram indicating the regions in parameter space where each of the three possible regimes (no current, normal current, and current reversal) occurs is presented.

cond-mat.soft↗

Geometrical model for a particle on a rough inclined surface

A simple geometrical model is presented for the gravity-driven motion of a single particle on a rough inclined surface. Adopting a simple restitution law for the collisions between the particle and the surface, we arrive at a model in which the dynamics is described by a one-dimensional map. This map is studied in detail and it is shown to exhibit several dynamical regimes (steady state, chaotic behavior, and accelerated motion) as the model parameters vary. A phase diagram showing the corresponding domain of existence for these regimes is presented. The model is also found to be in good qualitative agreement with recent experiments on a ball moving on a rough inclined line.

cond-mat.soft↗

Hausdorff dimension of boundaries of self-affine tiles in R^n

We present a new method to calculate the Hausdorff dimension of a certain class of fractals: boundaries of self-affine tiles. Among the interesting aspects are that even if the affine contraction underlying the iterated function system is not conjugated to a similarity we obtain an upper- and lower-bounds for its Hausdorff dimension. In fact, we obtain the exact value for the dimension if the moduli of the eigenvalues of the underlying affine contraction are all equal (this includes Jordan blocks). The tiles we discuss play an important role in the theory of wavelets. We calculate the dimension for a number of examples.

math.DS↗