2,522 research outputs found

    Non-uniformizable sets with countable cross-sections on a given level of the projective hierarchy

    Full text link
    We present a model of set theory, in which, for a given n≥2n\ge2, there exists a non-ROD-uniformizable planar lightface Πn1\varPi^1_n set in R×R\mathbb R\times\mathbb R, whose all vertical cross-sections are countable sets (and in fact Vitali classes), while all planar boldface Σn1\bf\Sigma^1_n sets with countable cross-sections are Δn+11\bf\Delta^1_{n+1}-uniformizable. Thus it is true in this model, that the ROD-uniformization principle for sets with countable cross-sections first fails precisely at a given projective level.Comment: A revised version of the originally submitted preprin

    Relation lifting, with an application to the many-valued cover modality

    Get PDF
    We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the "powerset monad" on categories, one is the preservation by T of "exactness" of certain squares. Both characterisations are generalisations of the "classical" results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks. The results presented in this paper enable us to compute predicate liftings of endofunctors of, for example, generalised (ultra)metric spaces. We illustrate this by studying the coalgebraic cover modality in this setting.Comment: 48 pages, accepted for publication in LMC

    Enriched categories as a free cocompletion

    Full text link
    This paper has two objectives. The first is to develop the theory of bicategories enriched in a monoidal bicategory -- categorifying the classical theory of categories enriched in a monoidal category -- up to a description of the free cocompletion of an enriched bicategory under a class of weighted bicolimits. The second objective is to describe a universal property of the process assigning to a monoidal category V the equipment of V-enriched categories, functors, transformations, and modules; we do so by considering, more generally, the assignation sending an equipment C to the equipment of C-enriched categories, functors, transformations, and modules, and exhibiting this as the free cocompletion of a certain kind of enriched bicategory under a certain class of weighted bicolimits.Comment: 80 pages; final journal versio

    Numerics and Fractals

    Full text link
    Local iterated function systems are an important generalisation of the standard (global) iterated function systems (IFSs). For a particular class of mappings, their fixed points are the graphs of local fractal functions and these functions themselves are known to be the fixed points of an associated Read-Bajactarevi\'c operator. This paper establishes existence and properties of local fractal functions and discusses how they are computed. In particular, it is shown that piecewise polynomials are a special case of local fractal functions. Finally, we develop a method to compute the components of a local IFS from data or (partial differential) equations.Comment: version 2: minor updates and section 6.1 rewritten, arXiv admin note: substantial text overlap with arXiv:1309.0243. text overlap with arXiv:1309.024

    IFSM representation of Brownian motion with applications to simulation

    Get PDF
    Several methods are currently available to simulate paths of the Brownian motion. In particular, paths of the BM can be simulated using the properties of the increments of the process like in the Euler scheme, or as the limit of a random walk or via L2 decomposition like the Kac-Siegert/Karnounen-Loeve series. In this paper we first propose a IFSM (Iterated Function Systems with Maps) operator whose fixed point is the trajectory of the BM. We then use this representation of the process to simulate its trajectories. The resulting simulated trajectories are self-affine, continuous and fractal by construction. This fact produces more realistic trajectories than other schemes in the sense that their geometry is closer to the one of the true BM's trajectories. The IFSM trajectory of the BM can then be used to generate more realistic solutions of stochastic differential equations

    String attractors and combinatorics on words

    Get PDF
    The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w[1]w[2] · · · w[n] is a subset Γ of the positions 1, . . ., n, such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the notion of string attractor from a combinatorial point of view, by focusing on several families of finite words. The results presented in the paper suggest that the notion of string attractor can be used to define new tools to investigate combinatorial properties of the words

    Categorical notions of fibration

    Full text link
    Fibrations over a category BB, introduced to category theory by Grothendieck, encode pseudo-functors Bop⇝CatB^{op} \rightsquigarrow {\bf Cat}, while the special case of discrete fibrations encode presheaves Bop→SetB^{op} \to {\bf Set}. A two-sided discrete variation encodes functors Bop×A→SetB^{op} \times A \to {\bf Set}, which are also known as profunctors from AA to BB. By work of Street, all of these fibration notions can be defined internally to an arbitrary 2-category or bicategory. While the two-sided discrete fibrations model profunctors internally to Cat{\bf Cat}, unexpectedly, the dual two-sided codiscrete cofibrations are necessary to model V\cal V-profunctors internally to V\cal V-Cat\bf Cat.Comment: These notes were initially written by the second-named author to accompany a talk given in the Algebraic Topology and Category Theory Proseminar in the fall of 2010 at the University of Chicago. A few years later, the now first-named author joined to expand and improve in minor ways the exposition. To appear on "Expositiones Mathematicae
    • …
    corecore