Homotopical algebraic geometry I: topos theory

This is the first of a series of papers devoted to lay the foundations of Algebraic Geometry in homotopical and higher categorical contexts. In this first part we investigate a notion of higher topos.For this, we use S-categories (i.e. simplicially enriched categories) as models for certain kind of ∞-categories, and we develop the notions of S-topologies, S-sites and stacks over them. We prove in particular, that for an S-category T endowed with an S-topology, there exists a model category of stacks over T, generalizing the model category structure on simplicial presheaves over a Grothendieck site of Joyal and Jardine. We also prove some analogs of the relations between topologies and localizing subcategories of the categories of presheaves, by proving that there exists a one-to-one correspondence between S-topologies on an S-category T, and certain left exact Bousfield localizations of the model category of pre-stacks on T. Based on the above results, we study the notion of model topos introduced by Rezk, and we relate it to our model categories of stacks over S-sites.In the second part of the paper, we present a parallel theory where S-categories, S-topologies and S-sites are replaced by model categories, model topologies and model sites. We prove that a canonical way to pass from the theory of stacks over model sites to the theory of stacks over S-sites is provided by the simplicial localization construction of Dwyer and Kan. As an example of application, we propose a definition of étale K-theory of ring spectra, extending the étale K-theory of commutative rings.     

The existence of weakly periodic Gibbs measures for the Potts model on a Cayley tree

We study the q-state Potts model on a Cayley tree of order k ≥ 2. In the group representation of the Cayley tree for the ferromagnetic Potts model, we single out a set of index-2 subgroups under which each weakly periodic Gibbs measure is translation invariant. For the anti-ferromagnetic Potts model with k ≥ 2 and q ≥ 2, we show that a weakly periodic Gibbs measure that is not translation invariant is not unique.     

Analysis of a two-phase cell division model

In this paper we mainly study an equal mitosis two-phase cell division model. By using the C₀-semigroup theory, we prove that this model is the well-posed in L¹[0, 1] × L¹[0, 1], and exhibits asynchronous exponential growth phenomenon as time goes to infinity. We also give a comparison between this two-phase model with the classical one-phase model. Finally, we briefly study the asymmetric two-phase cell division model, and show that similar results hold for it.     

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.     

On a binary distance model for the minimum linear arrangement problem

The minimum linear arrangement problem consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. The problem is among the classical NP-hard optimization problems and there has been extensive research on exact and approximative algorithms. In this paper, we introduce a new model based on binary variables d _ijk that are equal to 1 if nodes i and j have distance k in the ordering. We analyze this model and point to connections and differences to a model using integer distance variables. Based on computational experiments, we argue that our model is worth further theoretical and practical investigation and that is has potentials yet to be examined.     

Effects of a Degeneracy in the Competition Model: Part II. Perturbation and Dynamical Behaviour

This is the second part of our study on the competition model where the coefficient functions are strictly positive over the underlying spatial region Ω except b(x), which vanishes in a nontrivial subdomain of Ω, and is positive in the rest of Ω. In part I, we mainly discussed the existence of two kinds of steady-state solutions of this system, namely, the classical steady-states and the generalized steady-states. Here we use these solutions to determine the dynamics of the model. We do this with the help of the perturbed model where b(x) is replaced by b(x)+ε, which itself is a classical competition model. This approach also reveals the interesting relationship between the steady-state solutions (both classical and generalized) of the above system and that of the perturbed system.     

One-way multiparty communication lower bound for pointer jumping with applications

In this paper we study the one-way multiparty communication model, in which every party speaks exactly once in its turn. For every k, we prove a tight lower bound of Ω(n ^1/(k?1)}) on the probabilistic communication complexity of pointer jumping in a k-layered tree, where the pointers of the i-th layer reside on the forehead of the i-th party to speak. The lower bound remains nontrivial even for k = (logn)^1/2?? parties, for any constant ? > 0. Previous to our work a lower bound was known only for k =3 (Wigderson, see [7]), and in restricted models for k>3 [2},24,18,4,13]. Our results have the following consequences to other models and problems, extending previous work in several directions. The one-way model is strong enough to capture general (not one-way) multiparty protocols with a bounded number of rounds. Thus we generalize two problem areas previously studied in the 2-party model (cf. [30,21,29]). The first is a rounds hierarchy: we give an exponential separation between the power of r and 2r rounds in general probabilistic k-party protocols, for any k and r. The second is the relative power of determinism and nondeterminism: we prove an exponential separation between nondeterministic and deterministic communication complexity for general k-party protocols with r rounds, for any k,r. The pointer jumping function is weak enough to be a special case of the well-studied disjointness function. Thus we obtain a lower bound of Ω(n ^1/(k?1)) on the probabilistic complexity of k-set disjointness in the one-way model, which was known only for k = 3 parties. Our result also extends a similar lower bound for the weaker simultaneous model, in which parties simultaneously send one message to a referee [12]. Finally, we infer an exponential separation between the power of any two different orders in which parties send messages in the one-way model, for every k. Previous results [29, 7] separated orders based on who speaks first. Our lower bound technique, which handles functions of high discrepancy over cylinder intersections, provides a “party-elimination” induction, based on a restricted form of a direct-product result, specific to the pointer jumping function.     

Optimal manufacturer’s replenishment policies in the EPQ model under two levels of trade credit policy

In 2007, Huang proposed the optimal retailer’s replenishment decisions in the EPQ model under two levels of trade credit policy, in which the supplier offers the retailer a permissible delay period M, and the retailer in turn provides its customer a permissible delay period N (with N < M). In this paper, we extend his EPQ model to complement the shortcoming of his model. In addition, we relax the dispensable assumptions of N < M and others. We then establish an appropriate EPQ model to the problem, and develop the proper theoretical results to obtain the optimal solution. Finally, a numerical example is used to illustrate the proposed model and its optimal solution.     

Un semi-groupe régularisé pour un modèle de Lebowitz–RubinowA regularized semigroup for a Lebowitz–Rubinow's model

In this Note, we complete [1] and we study the Lebowitz–Rubinow's model with the biological law of perfect memory. In this model, each cell is characterized by its cell cycle length l (0?l₁<l<l₂<∞) and its age a (0<a<l). If l₁>0, a complete study of this model can be found in [1]. Here we show that if l₁=0 then this model becomes ill-posed. We use the theory of generalized semigroups to remedy to this model. To cite this article: M. Boulanouar, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 865–868.