Foundations for a Theory of Complex Matroids

We explore a combinatorial theory of linear dependency in complex space, complex matroids, with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this theory captures properties of linear dependency, orthogonality, and determinants over ? in much the same way that oriented matroids capture the same properties over ?. In addition, our complex matroids come with a canonical S ¹ action analogous to the action of ?^? on a complex vector space. Our phirotopes (analogs of determinants) are the same as those studied previously by Below, Krummeck, and Richter-Gebert (Discrete and Computational Geometry, Springer, pp.?203?C233, 2003) and Delucchi (Diploma Thesis, ETH Zurich, 2003). We further show that complex matroids cannot have vector axioms analogous to those for oriented matroids.     

A categorical invariant for cubic threefolds

We prove a categorical version of the Torelli theorem for cubic threefolds. More precisely, we show that the non-trivial part of a semi-orthogonal decomposition of the derived category of a cubic threefold characterizes its isomorphism class.     

On one-dimensional continua uniformly approximating planar sets

Consider the class of closed connected sets satisfying length constraint with given l>0. The paper is concerned with the properties of minimizers of the uniform distance F _M of Σ to a given compact set ,

On a stochastic disease model with vaccination

We propose a stochastic disease model where vaccination is included and such that the immunity isn’t permanent. The existence, uniqueness and positivity of the solution and the stability of disease free equilibrium is studied. The numerical simulation is done.     

Three solutions to a perturbed nonlinear discrete Dirichlet problem

Using critical point theory, we study the existence of at least three solutions for a perturbed nonlinear Dirichlet boundary value problem for difference equations depending on two positive parameters.     

Controllability of quasi-linear Hamiltonian NLS equations

We prove internal controllability in arbitrary time, for small data, for quasi-linear Hamiltonian NLS equations on the circle. We use a procedure of reduction to constant coefficients up to order zero and HUM method to prove the controllability of the linearized problem. Then we apply a Nash–Moser–Hörmander implicit function theorem as a black box.