Thin-type dense sets and related properties

We build on Gruenhage, Natkaniec, and Piotrowski?s study of thin, very thin, and slim dense sets in products, and the related notions of (NC) and (GC) which they introduced. We find examples of separable spaces X such that X² has a thin or slim dense set but no countable one. We characterize ordered spaces that satisfy (GC) and (NC), and we give an example of a separable space which satisfies (GC) but not witnessed by a collection of finite sets. We show that the question of when the topological sum of two countable strongly irresolvable spaces satisfies (NC) is related to the Rudin-Keisler order on βω. We also introduce and study the concepts of <κ-thin and superslim dense sets.     

Generic variables in acyclic cluster algebras

Let Q be an acyclic quiver. We introduce the notion of generic variables for the coefficient-free acyclic cluster algebra A(Q). We prove that the set G(Q) of generic variables contains naturally the set M(Q) of cluster monomials in A(Q) and that these two sets coincide if and only if Q is a Dynkin quiver. We establish multiplicative properties of these generic variables analogous to multiplicative properties of Lusztig’s dual semicanonical basis. This allows to compute explicitly the generic variables when Q is a quiver of affine type. When Q is the Kronecker quiver, the set G(Q) is a Z-basis of A(Q) and this basis is compared to Sherman-Zelevinsky and Caldero-Zelevinsky bases.     

A p-theory of ordered normed spaces

We propose a pair of axioms (O.p.1) and (O.p.2) for 1 ≤ p ≤ ∞ and initiate a study of a (matrix) ordered space with a (matrix) norm, in which the (matrix) norm is related to the (matrix) order. We call such a space a (matricially) order smooth p-normed space. The advantage of studying these spaces over L ^p -matricially Riesz normed spaces is that every matricially order smooth ∞-normed space can be order embedded in some C*-algebra. We also study the adjoining of an order unit to a (matricially) order smooth ∞-normed space. As a consequence, we sharpen Arveson’s extension theorem of completely positive maps. Another combination of these axioms yields an order theoretic characterization of the set of real numbers amongst ordered normed linear spaces.     

Inventory Control for Supply Chains with Service Level Constraints: A Synergy between Large Deviations and Perturbation Analysis

We consider a model of a supply chain consisting of n production facilities in tandem and producing a single product class. External demand is met from the finished goods inventory maintained in front of the most downstream facility (stage 1); unsatisfied demand is backlogged. We adopt a base-stock production policy at each stage of the supply chain, according to which the facility at stage i produces if inventory falls below a certain level w _i and idles otherwise. We seek to optimize the hedging vector w=(w ₁,...,w _n ) to minimize expected inventory costs at all stages subject to maintaining the stockout probability at stage 1 below a prescribed level (service level constraint). We make rather general modeling assumptions on demand and production processes that include autocorrelated stochastic processes. We solve this stochastic optimization problem by combining analytical (large deviations) and sample path-based (perturbation analysis) techniques. We demonstrate that there is a natural synergy between these two approaches.     

A full second order variational model for multiscale texture analysis

We present a second order image decomposition model to perform denoising and texture extraction. We look for the decomposition f=u+v+w where u is a first order term, v a second order term and w the (0 order) remainder term. For highly textured images the model gives a two-scale texture decomposition: u can be viewed as a macro-texture (larger scale) whose oscillations are not too large and w is the micro-texture (very oscillating) that may contain noise. We perform mathematical analysis of the model and give numerical examples.     

Vines and partial transformations

We introduce the partial vine monoid PVn. This monoid is related to the partial transformation semigroup PTn in the same way as the braid group Bn is related to the symmetric group Sn, and contains both the vine monoid [T.G. Lavers, The theory of vines, Comm. Algebra 25 (4) (1997) 1257-1284] and the inverse braid monoid [D. Easdown, T.G. Lavers, The inverse braid monoid, Adv. Math. 186 (2) (2004) 438-455]. We give a presentation for PVn in terms of generators and relations, as well as a faithful representation in a monoid of endomorphisms of a free group. We also derive a new presentation for PTn.     

A model-data weak formulation for simultaneous estimation of state and model bias

We introduce a Petrov–Galerkin regularized saddle approximation which incorporates a “model” (partial differential equation) and “data” (M experimental observations) to yield estimates for both state and model bias. We provide an a priori theory that identifies two distinct contributions to the reduction in the error in state as a function of the number of observations, M: the stability constant increases with M; the model-bias best-fit error decreases with M. We present results for a synthetic Helmholtz problem and an actual acoustics system.     

Topologiesm-Convexes dans les algebres a-convexes

We endow anyA-convex algebra (E, τ) with a multiplicatively-convex topologyM(τ) finer than τ. We then show that this is the weakestm-convex topology finer than τ. We are then led to consider two classes ofA-convex algebras examples and (or) characterizations of which are given.     

Geometric ergodicity of Harris recurrent Marcov chains with applications to renewal theory

Let (X_n) be a positive recurrent Harris chain on a general state space, with invariant probability measure π. We give necessary and sufficient conditions for the geometric convergence of λPⁿf towards its limit π(f), and show that when such convergence happens it is, in fact, uniform over f and in L¹(π)-norm. As a corollary we obtain that, when (Xn) is geometrically ergodic, ∝ π(dx)6Pⁿ(x,·)-π6 converges to zero geometrically fast. We also characterize the geometric ergodicity of (X_n) in terms of hitting time distributions. We show that here the so-called small sets act like individual points of a countable state space chain. We give a test function criterion for geometric ergodicity and apply it to random walks on the positive half line. We apply these results to non-singular renewal processes on [0,∞) providing a probabilistic approach to the exponencial convergence of renewal measures.     

An inductive approach to representations of complex reflection groups G(m, 1, n)

We propose an inductive approach to the representation theory of the chain of complex reflection groups G(m, 1, n). We obtain the Jucys-Murphy elements of G(m, 1, n) from the Jucys-Murphy elements of the cyclotomic Hecke algebra and study their common spectrum using representations of a degenerate cyclotomic affine Hecke algebra. We construct representations of G(m, 1, n) using a new associative algebra whose underlying vector space is the tensor product of the group ring ?G(m, 1, n) with a free associative algebra generated by the standard m-tableaux.     

Functions of bounded characteristic in n-connected domains

In this paper we define a metric d on the Nevanlinna class N(G) of an n-connected domain G. We show that (N, d) is a complete translation invariant metric space in which multiplication by a constant is not continuous. We also show that N(G) is disconnected. Our main theorem characterizes the component of the origin of N(G), extending earlier work of J. Shapiro and A. Shields and of J. Roberts for the unit disk. We use the factorization theorem of R. Coifman and G. Weiss to show that the component of the origin of N(G) is equal to the set of all functions f in N(G) for which the positive part of the singular measure of the least harmonic majorant of log ¦f¦ is continuous.     

Redundant consecutive-k systems

We introduce redundancy into the consecutive-k (-out-of-n) systems which have recently been widely studied. We study three problems: (i) compute the reliabilities for such systems, (ii) assign components with various working probabilities to a given system to maximize its reliability, (iii) select a system under hardware constraints to maximize the reliability.     

Singular perturbations and vanishing passage through a turning point

The paper deals with planar slow-fast cycles containing a unique generic turning point. We address the question on how to study canard cycles when the slow dynamics can be singular at the turning point. We more precisely accept a generic saddle-node bifurcation to pass through the turning point. It reveals that in this case the slow divergence integral is no longer the good tool to use, but its derivative with respect to the layer variable still is. We provide general results as well as a number of applications. We show how to treat the open problems presented in Artés et al. (2009) [1] and Dumortier and Rousseau (2009) [13], dealing respectively with the graphics DI2a and DF1a from Dumortier et al. (1994) [14].     

Strong full bounded solutions of nonlinear parabolic equations with nonlinear boundary conditions

We study the existence of (generalized) bounded solutions existing for all times for nonlinear parabolic equations with nonlinear boundary conditions on a domain that is bounded in space and unbounded in time (the entire real line). We give a counterexample which shows that a (weak) maximum principle does not hold in general for linear problems defined on the entire real line in time. We consider a boundedness condition at minus infinity to establish (one-sided) L^∞-a priori estimates for solutions to linear boundary value problems and derive a weak maximum principle which is valid on the entire real line in time. We then take up the case of nonlinear problems with (possibly) nonlinear boundary conditions. By using comparison techniques, some (delicate) a priori estimates obtained herein, and nonlinear approximation methods, we prove the existence and, in some instances, positivity and uniqueness of strong full bounded solutions existing for all times.     

Geometric three-dimensional assignment problems

We investigate two geometric special cases of the three-dimensional assignment problem: Given are three sets B, R and G (blue, red and green) each containing n grid points in the Euclidean plane. We want to find a partition of B ∪ R ∪ G into n three0colored triangles such that (a) the total circumference of all triangles or (b) the total area of all triangles becomes minimum. Both versions of the problem are proved to be NP-hard.     

Perturbation and bifurcation in a free boundary problem

We study the equation with a discontinuous nonlinearity: ?Δu = λH(u ? 1) (H is Heaviside's unit function) in a square subject to various boundary conditions. We expect to find a curve dividing the harmonic (Δu = 0) region from the superharmonic (Δu = ?λ) region, defined by the equation u(x, y) = 1. This curve is called the free boundary since its location is determined by the solution to the problem. We use the implicit function theorem to study the effect of perturbation of the boundary conditions on known families of solutions. This justifies rigorously a formal scheme derived previously by Fleishman and Mahar. Our method also discovers bifurcations from previously known solution families.     

The pseudo-hyperplanes and homogeneous pseudo-embeddings of AG(n, 4) and PG(n, 4)

We determine all homogeneous pseudo-embeddings of the affine space AG(n, 4) and the projective space PG(n, 4). We give a classification of all pseudo-hyperplanes of AG(n, 4). We also prove that the two homogeneous pseudo-embeddings of the generalized quadrangle Q(4, 3) are induced by the two homogeneous pseudo-embeddings of AG(4, 4) into which Q(4, 3) is fully embeddable.     

On acyclicity of games with cycles

We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (di-graphs) that may contain directed cycles (di-cycles). We assume that all these di-cycles form one outcome c, for example, a draw. We obtain criteria of restricted improvement acyclicity (ri-acyclicity) in two cases: for n=2 and for acyclic di-graphs. We provide several examples that outline the limits of these criteria and show that, essentially, there are no other ri-acyclic cases.We also discuss connections between ri-acyclicity and some open problems related to Nash-solvability.     

Approximation in quantale-enriched categories

Our work is a foundational study of the notion of approximation in Q-categories and in (U,Q)-categories, for a quantale Q and the ultrafilter monad U. We introduce auxiliary, approximating and Scott-continuous distributors, the way-below distributor, and continuity of Q- and (U,Q)-categories. We fully characterize continuous Q-categories (resp. (U,Q)-categories) among all cocomplete Q-categories (resp. (U,Q)-categories) in the same ways as continuous domains are characterized among all dcpos. By varying the choice of the quantale Q and the notion of ideals, and by further allowing the ultrafilter monad to act on the quantale, we obtain a flexible theory of continuity that applies to partial orders and to metric and topological spaces. We demonstrate on examples that our theory unifies some major approaches to quantitative domain theory.