Suppression of Chaos and Phase Locking in Two Coupled Nonidentical Neurons under Periodic Input

Dynamical behaviour of two coupled neurons with at least one of them being chaotic is presented. Bifurcation diagrams and Lyapunov exponents are calculated to diagnose the dynamical behaviour of the coupled neurons with the increasing coupling strength. It is found that when the coupling strength increases, a chaotic neuron can be controlled by the coupling between neurons. At the same time, phase locking is studied by the maxima of the differences of instantaneous phases and average frequencies between two coupled neurons, and the inherent connection of phase locking and the suppression of chaos is formulated. It is observed that the onset of phase locking is closely related to the suppression of chaos. Finally, a way for suppression of chaos in two coupled nonidentical neurons under periodic input is suggested.     

On the genericity of chaos

Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).     

On dimensional rigidity of bar-and-joint frameworks

Let V={1,2,…,n}. A mapping p:V→R^r, where p¹,…,pⁿ are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in R^r, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in R^r is said to be dimensionally rigid iff there does not exist a framework G(q) in R^s for s?r+1, such that ∥qⁱ-q^j∥²=∥pⁱ-p^j∥² for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p¹,…,pⁿ of the given r-configuration are in general position, is also investigated.     

Infima and complements in the lattice of quasi-uniformities

We show that the infimum of any family of proximally symmetric quasi-uniformities is proximally symmetric, while the supremum of two proximally symmetric quasi-uniformities need not be proximally symmetric. On the other hand, the supremum of any family of transitive quasi-uniformities is transitive, while there are transitive quasi-uniformities whose infimum with their conjugate quasi-uniformity is not transitive. Moreover we present two examples that show that neither the supremum topology nor the infimum topology of two transitive topologies need be transitive. Finally, we prove that several operations one can perform on and between quasi-uniformities preserve the property of having a complement.     

Normal Bundles to Laufer Rational Curves in Local Calabi–Yau Threefolds

We prove a conjecture by F. Ferrari. Let X be the total space of a nonlinear deformation of a rank two holomorphic vector bundle on a smooth rational curve, such that X has trivial canonical bundle and has sections. Then the normal bundle to such sections is computed in terms of the rank of the Hessian of a suitably defined superpotential at its critical points.     

Algorithms for finding connected separators between antipodal points

A set (or a collection of sets) contained in the Euclidean space Rm is symmetric if it is invariant under the antipodal map. Given a symmetric unicoherent polyhedron X (like an n-dimensional cube or a sphere) and an odd real function f defined on vertices of a certain symmetric triangulation of X, we algorithmically construct a connected symmetric separator of X by choosing a subcollection of the triangulation. Each element of the subcollection contains the vertices v and u such that f(v)f(u)?0.     

On the moduli spaces of multipolygonal linkages in the plane

One can form a polygonal linkage by identifying initial and terminal points of two free linkages. Likewise, one can form a multipolygonal linkage by identifying initial and terminal points of three free linkages. The geometric and topological properties of moduli spaces of multipolygonal linkages in the plane are studied. These spaces are compact algebraic varieties. Some conditions under which these spaces are smooth manifolds, cross products or disjoint unions of moduli spaces of polygonal linkages, or connected, are determined. Dimensions in smooth manifold cases and some Euler characteristics are computed. A classification of generic multiquadrilateral linkages is also made.     

A Note on Log-Convexity of q-Catalan Numbers

The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q = 1, to the Catalan numbers: 1, 1, 2, 5, 14,…, a log-convex sequence. We use a combinatorial interpretation of these polynomials to prove a q-log-convexity result. The sequence of q-Catalan numbers is not q-log-convex in the narrow sense used by other authors, so our work suggests a more flexible definition of q-log convex be adopted. Received January 2, 2007     

Nonminimal sets,their projections and integral representations of stable processes

New criteria are provided for determining whether an integral representation of a stable process is minimal. These criteria are based on various nonminimal sets and their projections, and have several advantages over and shed light on already available criteria. In particular, they naturally lead from a nonminimal representation to the one which is minimal. Several known examples are considered to illustrate the main results. The general approach is also adapted to show that the so-called mixed moving averages have a minimal integral representation of the mixed moving average type.