Sur des notions de n—categorie et n—groupoide non strictes via des ensembles multi-simpliciaux (On the notions of a nonstrict n–category and n–groupoid via multisimplicial sets)

In this paper we first give a simplicial approach to the definition of a nonstrict n–category that we call a n–nerve following the idea that a category could be interpreted as a simplicial set (its nerve). Then we prove that for n=2 our construction is equivalent to the usual nonstrict 2–category (bicategory). Next,we give a simplicial definition of a nonstrict n–groupoïd, and we associate to any topological space a n–groupoïd n (X) which generalises the famous Poincaré groupoïd 1 (X) and embodies the n–truncated homotopy type of . Conversely, we construct for each n–groupoïd a geometric realisation and we show that the functors geometric realisation and Poincaré n–groupoïd induce an equivalence between the category of n–groupoids and the category of n–truncated topological spaces, when we localise both categories by weak equivalence.     

Structural stability of (C, A)-marked subspaces

Given an observable pair of matrices (C, A) we consider the manifold of (C, A)-invariant subspaces having a fixed Brunovsky-Kronecker structure. Using Arnold techniques we obtain the explicit form of a miniversal deformation of a marked (C, A)-invariant subspace with respect to the usual equivalence relation. As an application, we obtain the dimension of the orbit and we characterize the structurally stable subspaces (those with open orbit).     

Polynomial reduction of time-space scheduling to time scheduling

We study the University Course Timetabling Problem (UCTP). In particular we deal with the following question: is it possible to decompose UCTP into two problems, namely, (i) a time scheduling, and (ii) a space scheduling. We have arguments that it is not possible. Therefore we study UCTP with the assumption that each room belongs to exactly one type of room. A type of room is a set of rooms, which have similar properties. We prove that in this case UCTP is polynomially reducible to time scheduling. Hence we solve UCTP with the following method: at first we solve time scheduling and subsequently we solve space scheduling with a polynomial O(n³) algorithm. In this way we obtain a radical (exponential) speed-up of algorithms for UCTP. The method was applied at P.J. Šafárik University.     

Bidimensional shallow water model with polynomial dependence on depth through vorticity

In this paper, we obtain a bidimensional shallow water model with polynomial dependence on depth. With this aim, we introduce a small non-dimensional parameter ε and we study three-dimensional Euler equations in a domain depending on ε (in such a way that, when ε becomes small, the domain has small depth). Then, we use asymptotic analysis to study what happens when ε approaches to zero. Asymptotic analysis allows us to obtain a new bidimensional shallow water model that not only computes the average velocity (as the classical model does) but also provides the horizontal velocity at different depths. This represents a significant improvement over the classical model. We must also remark that we obtain the model without making assumptions about velocity or pressure behavior (only the usual ansatz in asymptotic analysis). Finally, we present some numerical results showing that the new model is able to approximate the non-constant in depth solutions to Euler equations, whereas the classical model can only obtain the average velocity.     

The evolution dam problem for a compressible fluid with nonlinear Darcy's law and Dirichlet boundary condition

In this paper, we consider the evolution dam problem (P) related to a compressible fluid flow governed by a generalized nonlinear Darcy's law with Dirichlet boundary conditions on some part of the boundary. We establish existence of a solution for this problem. We choose a convenient regularized problem (P_?) for which we prove the existence and uniqueness of solution using the comparison Lemma 2.1 and the Schauder fixed‐point theorem. Then, we pass to the limit, when ? goes to 0, to get a solution for our problem. Moreover, we will see another approach for the incompressible case where we pass to the limit in (P), when α goes to 0, to get a solution.     

An application of matrix computations to classical second-order optimality conditions

For finite dimensional optimization problems with equality and inequality constraints, a weak constant rank condition (WCR) was introduced by Andreani–Martinez–Schuverdt (AMS) (Optimization 5–6:529–542, 2007) to study classical necessary second-order optimality conditions. However, this condition is not easy to check. Using a polynomial and matrix computation tools, we can substitute it by a weak constant rank condition (WCRQ) for an approximated problem and we present a method for checking points that satisfy WCRQ. We extend the result of (Andreani et al. in Optimization 5–6:529–542, 2007), we show that WCR can be replaced by WCRQ and we prove that these two conditions are independent.     

Polynomiality of Hurwitz numbers,Bouchard–Mariño conjecture,and a new proof of the ELSV formula

In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formula). Then, using this polynomiality we give a new proof of the Bouchard–Mariño conjecture. After that, using the correspondence between the Givental group action and the topological recursion coming from matrix models, we prove the equivalence of the Bouchard–Mariño conjecture and the ELSV formula (it is a refinement of an argument by Eynard).     

Nonlocal vertex algebras generated by formal vertex operators

This is the first paper in a series to study vertex algebra-like objects arising from infinite-dimensional quantum groups (quantum affine algebras and Yangians). In this paper we lay the foundations for this study. For any vector space W, we study what we call quasi compatible subsets of Hom (W,W((x))) and we prove that any maximal quasi compatible subspace has a natural nonlocal (namely noncommutative) vertex algebra structure with W as a natural faithful quasi module in a certain sense, and that any quasi compatible subset generates a nonlocal vertex algebra with W as a quasi module. In particular, taking W to be a highest weight module for a quantum affine algebra we obtain a nonlocal vertex algebra with W as a quasi module. We also formulate and study a notion of quantum vertex algebra and we give general constructions of nonlocal vertex algebras, quantum vertex algebras and their modules.     

The small quantum cohomology of a weighted projective space, a mirror D-module and their classical limits

We first describe a mirror partner (B-model) of the small quantum orbifold cohomology of weighted projective spaces (A-model) in the framework of differential equations: we attach to the A-model (resp. B-model) a quantum differential system (that is a trivial bundle equipped with a suitable flat meromorphic connection and a flat bilinear form) and we give an explicit isomorphism between these two quantum differential systems. On the A-side (resp. on the B-side), the quantum differential system alluded to is naturally produced by the small quantum cohomology (resp. a solution of the Birkhoff problem for the Brieskorn lattice of a Landau–Ginzburg model). Then we study the degenerations of these quantum differential systems and we apply our results to the construction of (classical, limit, logarithmic) Frobenius manifolds.     

Computing Syzygies by Faug��re��s F5 algorithm

In this paper, we introduce a new algorithm for computing a set of generators for the syzygies on a sequence of polynomials. For this, we extend a given sequence of polynomials to a Gr?bner basis using Faugère??s F₅ algorithm (A new efficient algorithm for computing Gr?bner bases without reduction to zero (F ₅). ISSAC, ACM Press, pp 75?C83, 2002). We show then that if we keep all the reductions to zero during this computation, then at termination (by adding principal syzygies) we obtain a basis for the module of syzygies on the input polynomials. We have implemented our algorithm in the computer algebra system Magma, and we evaluate its performance via some examples.     

Modal Meinongianism for Fictional Objects

Drawing on different suggestions from the literature, we outline a unified metaphysical framework, labeled as Modal Meinongian Metaphysics (MMM), combining Meinongian themes with a non-standard modal ontology. The MMM approach is based on (1) a comprehension principle (CP) for objects in unrestricted, but qualified form, and (2) the employment of an ontology of impossible worlds, besides possible ones. In §§1–2, we introduce the classical Meinongian metaphysics and consider two famous Russellian criticisms, namely (a) the charge of inconsistency and (b) the claim that naïve Meinongianism allows one to prove that anything exists. In §3, we have impossible worlds enter the stage and provide independent justification for their use. In §4, we introduce our revised comprehension principle: our CP has no restriction on the (sets of) properties that can characterize objects, but parameterizes them to worlds, therefore having modality explicitly built into it. In §5, we propose an application of the MMM apparatus to fictional objects and defend the naturalness of our treatment against alternative approaches. Finally, in §6, we consider David Lewis’ notorious objection to impossibilia, and provide a reply to it by resorting to an ersatz account of worlds.     

Categorical Geometry and Integration Without Points

The theory of integration over infinite-dimensional spaces is known to encounter serious difficulties. Categorical ideas seem to arise naturally on the path to a remedy. Such an approach was suggested and initiated by Segal in his pioneering article (Segal, Bull Am Math Soc 71:419–489, 1965). In our paper we follow his ideas from a different perspective, slightly more categorical, and strongly inspired by the point-free topology. First, we develop a general (point-free) concept of measurability (extending the standard Lebesgue integration when applying to the classical σ-algebra). Second (and here we have a major difference from the classical theory), we prove that every finite-additive function μ with values in [0,1] can be extended to a measure on an abstract σ-algebra; this correspondence is functorial and yields uniqueness. As an example we show that the Segal space can be characterized by completely canonical data. Furthermore, from our results it follows that a satisfactory point-free integration arises everywhere where we have a finite-additive probability function on a Boolean algebra.     

Numerical experimentation with a human migration model

In this paper, we develop a human migration model with a conjectural variations equilibrium (CVE). In contrast to previous works we extend the model to the case where the conjectural variations coefficients may be not only constants, but also (continuously differentiable) functions of the total population at the destination and of the group’s fraction in it. Moreover, we allow these functions to take distinct values at the abandoned location and at the destination. As an experimental verification of the proposed model, we develop a specific form of the model based upon relevant population data of a three-city agglomeration at the boundary of two Mexican states: Durango (Dgo.) and Coahuila (Coah.). Namely, we consider the 1980–2000 dynamics of population growth in the three cities: Torreón (Coah.), Gómez Palacio (Dgo.) and Lerdo (Dgo.), and propose utility functions of four various kinds for each of the three cities. After having collected necessary information about the average movement and transportation (i.e., migration) costs for each pair of the cities, we apply the above-mentioned human migration model to this example. Numerical experiments have been conducted with interesting results concerning the probable equilibrium states revealed.     

Degenerate two-phase incompressible flow II: regularity, stability and stabilization

In this paper, we analyze a coupled system of highly degenerate elliptic-parabolic partial differential equations for two-phase incompressible flow in porous media. This system involves a saturation and a global pressure (or a total flow velocity). First, we show that the saturation is Hölder continuous both in space and time and the total velocity is Hölder continuous in space (uniformly in time). Applying this regularity result, we then establish the stability of the saturation and pressure with respect to initial and boundary data, from which uniqueness of the solution to the system follows. Finally, we establish a stabilization result on the asymptotic behavior of the saturation and pressure; we prove that the solution to the present system converges (in appropriate norms) to the solution of a stationary system as time goes to infinity. An example is given to show typical regularity of the saturation.     

(ω,c)-asymptotically periodic functions,first-order Cauchy problem,and Lasota-Wazewska model with unbounded oscillating production of red cells

In this paper, we study a new class of functions, which we call (ω,c)-asymptotically periodic functions. This collection includes asymptotically periodic, asymptotically antiperiodic, asymptotically Bloch-periodic, and unbounded functions. We prove that the set conformed by these functions is a Banach space with a suitable norm. Furthermore, we show several properties of this class of functions as the convolution invariance. We present some examples and a composition result. As an application, we prove the existence and uniqueness of (ω,c)-asymptotically periodic mild solutions to the first-order abstract Cauchy problem on the real line. Also, we establish some sufficient conditions for the existence of positive (ω,c)-asymptotically periodic solutions to the Lasota-Wazewska equation with unbounded oscillating production of red cells.     

On smooth foliations with Morse singularities

Let M be a smooth manifold and let F be a codimension one, C^∞ foliation on M, with isolated singularities of Morse type. The study and classification of pairs (M,F) is a challenging (and difficult) problem. In this setting, a classical result due to Reeb (1946) [11] states that a manifold admitting a foliation with exactly two center-type singularities is a sphere. In particular this is true if the foliation is given by a function. Along these lines a result due to Eells and Kuiper (1962) [4] classifies manifolds having a real-valued function admitting exactly three non-degenerate singular points. In the present paper, we prove a generalization of the above mentioned results. To do this, we first describe the possible arrangements of pairs of singularities and the corresponding codimension one invariant sets, and then we give an elimination procedure for suitable center-saddle and some saddle-saddle configurations (of consecutive indices).In the second part, we investigate if other classical results, such as Haefliger and Novikov (Compact Leaf) theorems, proved for regular foliations, still hold true in presence of singularities. At this purpose, in the singular set, Sing(F) of the foliation F, we consider weakly stable components, that we define as those components admitting a neighborhood where all leaves are compact. If Sing(F) admits only weakly stable components, given by smoothly embedded curves diffeomorphic to S¹, we are able to extend Haefliger?s theorem. Finally, the existence of a closed curve, transverse to the foliation, leads us to state a Novikov-type result.     

Existence and convergence theorems for generalized hybrid mappings in uniformly convex metric spaces

In this paper, we show a relationship between strictly convexity of type (I) and (II) defined by Takahashi and Talman, and we prove that any uniformly convex metric space is strictly convex of type (II). Continuity of the convex structure is also shown on a compact domain. Then, we prove the existence of a minimum point of a convex, lower semicontinuous and d-coercive function defined on a nonempty closed convex subset of a complete uniformly convex metric space. By using this property, we prove fixed point theorems for (α, β)-generalized hybrid mappings in uniformly convex metric spaces. Using this result, we also obtain a common fixed point theorem for a countable commutative family of (α, β)-generalized hybrid mappings in uniformly convex metric spaces. Finally, we establish strong convergence of a Mann type iteration to a fixed point of (α, β)-generalized hybrid mapping in a uniformly convex metric space without assuming continuity of convex structure. Our results can be applied to obtain the existence and convergence theorems for (α, β)-generalized hybrid mappings in Hilbert spaces, uniformly convex Banach spaces and CAT(0) spaces.     

Graphs with bounded induced distance

In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in every connected induced subgraph of G is at most k times their distance in G. These graphs can model communication networks in which node failures may occur: at a given time, if sender and receiver are still connected, any message can be delivered through a path (that, due to node failures, could be longer than the shortest one) the length of which is at most k times the best possible. In this work we first provide two characterizations of graphs belonging to BID(k): one based on the stretch number (a new invariant introduced here), and the other based on cycle-chord conditions. After that, we investigate classes with order k⩽2. In this context, we note that the class BID(1) is the well known class of distance-hereditary graphs, and we show that 3/2 is a lower bound for the order k of graphs that are not distance-hereditary. Then, we characterize graphs in BID(3/2) by means of forbidden induced subgraphs, and we also show that graphs in BID(2) have a more complex characterization. We prove that the recognition problem for the generic class BID(k) is Co-NP-complete. Finally, we show that the split composition can be used to generate graphs in BID(k).     

Produit de bivecteurs et quaternions complexes

First we calculate the product of two bivectors in vectorial spaceR(p, q) (p andq are integers such thatp+q=n). Second we prove that this product is a quaternion forR(3, 0) and we generalize to finite number of bivectors. Third we prove that this product is a biquaternion forR(1, 3) and we genaralize in the same way. Fourth we prove that some complex quaternions can be connected with real Clifford algebra by choosing correctly the usual imaginary.