Almost sure estimates for the concentration neighborhood of Sinai’s walk

We consider Sinai’s random walk in random environment. We prove that infinitely often (i.o.) the size of the concentration neighborhood of this random walk is bounded almost surely. We also get that i.o. the maximal distance between two favorite sites is bounded almost surely.     

On the solution of Maxwell's equations in polygonal domains

This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H² when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H², and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

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.     

On the third largest Laplacian eigenvalue of a graph

In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph.     

Tropical Weyl Group Action via Point Configurations and τ-Functions of the q-Painlevé Equations

Starting from certain point sets in the projective plane, we construct a tropical (or subtraction-free birational) representation of Weyl groups over the field of τ-functions. In particular, our construction includes E ₈ ⁽¹⁾ , E ₇ ⁽¹⁾ , E ₆ ⁽¹⁾ and D ₅ ⁽¹⁾ as affine cases; each of them gives rise to the q-difference Painlevé equation.     

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.