A volume-preserving counterexample to the Seifert conjecture

We prove that every 3-manifold possesses aC ¹, volume-preserving flow with no fixed points and no closed trajectories. The main construction is a volume-preserving version of the Schweitzer plug. We also prove that every 3-manifold possesses a volume-preserving,C ^∞ flow with discrete closed trajectories and no fixed points (as well as a PL flow with the same geometry), which is needed for the first result. The proof uses a Dehn-twisted Wilson-type plug which also preserves volume. The author was supported by an NSF Postdoctoral Fellowship, grant #DMS-9107908.     

DIFFEOMORPHISMS WITH VARIOUS C1 STABLE PROPERTIES

Let M be a smooth compact manifold and Λ be a compact invariant set.In this article,we prove that,for every robustly transitive set Λ,f|Λ satisfies a C1-genericstable shadowable property (resp.,C1-gene...     

On the regularization of conservative maps

We show that smooth maps are C ¹-dense among C ¹ volume-preserving maps.     

Stable weakly shadowable volume-preserving systems are volume-hyperbolic

We prove that any C1-stable weakly shadowable volume-preserving diffeomorphism defined on a compact manifold displays a dominated splitting E ⊕ F. Moreover, both E and F are volume-hyperbolic. Finally, we prove the version of this result for divergence-free vector fields. As a consequence, in low dimensions, we obtain global hyperbolicity.     

Universal dynamics in a neighborhood of a generic elliptic periodic point

We show that a generic area-preserving two-dimensional map with an elliptic periodic point is C ^ω -universal, i.e., its renormalized iterates are dense in the set of all real-analytic symplectic maps of a two-dimensional disk. The results naturally extend onto Hamiltonian and volume-preserving flows.     

Analytic smoothing of geometric maps with applications to KAM theory

We show that finitely differentiable diffeomorphisms which are either symplectic, volume-preserving, or contact can be approximated with analytic diffeomorphisms that are, respectively, symplectic, volume-preserving or contact. We prove that the approximating functions are uniformly bounded on some complex domains and that the rate of convergence, in Cr-norms, of the approximation can be estimated in terms of the size of such complex domains and the order of differentiability of the approximated function. As an application to this result, we give a proof of the existence, the local uniqueness and the bootstrap of regularity of KAM tori for finitely differentiable symplectic maps. The symplectic maps considered here are not assumed either to be written in action-angle variables or to be perturbations of integrable systems. Our main assumption is the existence of a finitely differentiable parameterization of a maximal dimensional torus that satisfies a non-degeneracy condition and that is approximately invariant. The symplectic, volume-preserving and contact forms are assumed to be analytic.     

AC 1 make or break lemma

Mañé suggested the following question: Consider aC ^r flow on a compact manifold without boundary and suppose that the ω-limit set of a pointp intersets the α-limit set ofq, i.e. ω(p)∩α(q)≠Ø. Can the flow beC ^r-perturbed so that either (a)p is connected toq (p andq in the same orbit) or (b) ω(p)∩α(q)=Ø for the new flow? Here we solve positively a stronger version of this problem forC ¹ small perturbations of the original flow.     

A geometric Gordan-Stiemke theorem

Let C and K be closed cones in Rⁿ. Denote by φ (K∩C) the face of C generated by K ∩ C, by φ(K ∩ D)^D the dual face of φ(K ∩ C) in C¹, and by φ(-K¹ ∩ C¹) the face of C¹ generated by -K¹ ∩ C¹. It is proved that φ(K ∩ C¹) if and only if -C¹ ∩ [span(K ∩ C)] ⊥ ? C¹ + K¹. In particular, the closedness of C¹ + K¹ is a sufficient condition. Our result contains a generalization of the Gordon-Stiemke theorem which appeared in a recent paper of Saunders and Schneider.     

On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries

We consider the set Σ(R,C) of all m×n matrices having 0-1 entries and prescribed row sums R=(r₁,…,rm) and column sums C=(c₁,…,cn). We prove an asymptotic estimate for the cardinality |Σ(R,C)| via the solution to a convex optimization problem. We show that if Σ(R,C) is sufficiently large, then a random matrix D∈Σ(R,C) sampled from the uniform probability measure in Σ(R,C) with high probability is close to a particular matrix Z=Z(R,C) that maximizes the sum of entropies of entries among all matrices with row sums R, column sums C and entries between 0 and 1. Similar results are obtained for 0-1 matrices with prescribed row and column sums and assigned zeros in some positions.     

Inverse minimum cost flow problems under the weighted Hamming distance

Given a network N(V, A, u, c) and a feasible flow x⁰, an inverse minimum cost flow problem is to modify the cost vector as little as possible to make x⁰ form a minimum cost flow of the network. The modification can be measured by different norms. In this paper, we consider the inverse minimum cost flow problems, where the modification of the arcs is measured by the weighted Hamming distance. Both the sum-type and the bottleneck-type cases are considered. For the former, it is shown to be APX-hard due to the weighted feedback arc set problem. For the latter, we present a strongly polynomial algorithm which can be done in O(n · m²).     

Derivations of non-separable C1-algebras

The question of which C¹-algebras have only inner derivations has been considered by a number of authors for 25 years. The separable case is completely solved, so this paper deals only with the non-separable case. In particular, we show that the C¹-tensor product of a von Neumann algebra and an abelian C¹-algebra has only inner derivations. Other special types of C¹-algebras are shown to have only inner derivations as well such as the C¹-tensor product of L(H) (all bounded operators on separable Hilbert space) and any separable C¹-algebra having only inner derivations. Derivations from a smaller C¹-algebra into a larger one are also considered, and this concept is generalized to include derivations between C¹-algebras connected by a ¹-homomorphism. Finally, we consider the general problem of a sequence of linear functionals on a C¹-algebra which converges to zero (in norm) when restricted to any abelian C¹-subalgebra. Does such a sequence converge to zero in norm? The answer is “yes” for normal functionals on L(H), but unknown in general.     

Volume-Preserving Great Circle Flows on the 3-Sphere

In this paper, we study volume-preserving great circle flows on the 3-sphere S³, and introduce a moduli space for these, consisting of distance-decreasing holomorphic maps from connected open subsets of S² to S²; one consequence is that the only volume-preserving great circle flows defined on the entire 3-sphere are those tangent to Hopf fibrations.     

Local Solution and Extension to the Calabi Flow

We consider the local solution of the Calabi flow for rough initial data. In particular, we prove that for any smooth metric, there is a C ^α neighborhood such that the Calabi flow has a short time solution for any C ^α metric in the neighborhood. We also prove that on a compact Kähler surface, if the evolving metrics of the Calabi flow are all L ^∞ equivalent, then the Calabi flow exists for all time and converges to an extremal metric subsequently.     

Geometric Anosov flows of dimension 5

We show that for a smooth Anosov flow on a closed five dimensional manifold, if it has C^∞ Anosov splitting and preserves a C^∞ pseudo-Riemannian metric, then up to a special time change and finite covers, it is C^∞ flow equivalent either to the suspension of a symplectic hyperbolic automorphism of $\text{T}{}^4$, or to the geodesic flow on a three dimensional hyperbolic manifold. To cite this article: Y. Fang, C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

Gradient flows of the entropy for finite Markov chains

Let K be an irreducible and reversible Markov kernel on a finite set X. We construct a metric W on the set of probability measures on X and show that with respect to this metric, the law of the continuous time Markov chain evolves as the gradient flow of the entropy. This result is a discrete counterpart of the Wasserstein gradient flow interpretation of the heat flow in Rn by Jordan, Kinderlehrer and Otto (1998). The metric W is similar to, but different from, the L²-Wasserstein metric, and is defined via a discrete variant of the Benamou-Brenier formula.     

On Reeb components of invariant foliations of projectively Anosov flows

We show that if a C² codimension one foliation on a three-dimensional manifold has a Reeb component and is invariant under a projectively Anosov flow, then it must be a Reeb foliation on S²×S¹.     

Flot de courbure moyenne modifiée avec obstacle conique

A rotationally symmetric, compact, oriented, connected, uniformly convex hypersurface M₀ of , with boundary ∂M₀ in a rotationally symmetric cone S, is evolving under volume-preserving mean curvature flow. Then for n?2, we obtain gradient and curvature estimates, leading to long-time existence of the flow, and convergence to a part of a round sphere.     

Analyzing quadratic unconstrained binary optimization problems via multicommodity flows

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n{0,1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C₂,C₃,C₄,…. It is known that C₂ can be computed by solving a maximum flow problem, whereas the only previously known algorithms for computing require solving a linear program. In this paper we prove that C₃ can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0,1}ⁿ, this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network.     

Flows on open manifolds with positively Lagrange stable trajectories

We give the conditions for a flow generated by a smooth vector field X which guarantee that every smooth vectorfield Y in some C⁰-neighborhood of X defines a flow with positively Lagrange stable trajectories.