Connected and Disconnected Maps
نویسندگان
چکیده
A new relation between morphisms in a category is introduced – roughly speaking (accurately in the categories Set and Top), f ‖ g iff morphisms w : dom(f) → dom(g) never map subobjects of fibres of f non-constantly to fibres of g. (In the algebraic setting replace fibre with kernel.) This relation and a slight weakening of it are used to define “connectedness” versus “disconnectedness” for morphisms. This parallels and generalises the classical treatment of connectedness versus disconnectedness for objects in a category (in terms of constant morphisms). The central items of study are pairs (F ,G) of classes of morphisms which are corresponding fixed points of the polarity induced by the ‖relation. Properties of such pairs are examined and in particular their relation to (pre)factorisation systems is analysed. The main theorems characterise: (a) factorisation systems which factor morphisms through a regular epimorphic “connected” morphism followed by a “disconnected” morphism, and (b) pairs (F ,G) consisting of “connected” versus “disconnected” morphisms which induce a (regular) factorisation system. This suggests a generalisation of the pair (Concordant, Dissonant) of classes of continuous maps which was shown by Collins to yield the factorisation system (Concordant quotient, Dissonant) on Top.
منابع مشابه
Supervisory Control of a Hybrid AC/DC Micro-Grid with Load Shedding Based on the Bankruptcy Problem
In this paper, a supervisory controller is proposed to manage the power flow in a hybrid AC/DC micro-grid for both grid-connected and disconnected modes. When the hybrid AC/DC micro-grid is connected to the utility grid, power surplus or shortage leads to power trade between the micro-grid and the utility grid. In the grid-disconnected mode, the renewable power sources (wind and solar generatio...
متن کاملAlternated Julia Sets and Connectivity Properties
In this paper we present the alternated Julia sets, obtained by alternated iteration of two maps of the quadratic family 2 1 , 1,2 n n i z z c i and prove analytically and computationally that these sets can be connected, disconnected or totally disconnected verifying the known Fatou-Julia theorem in the case of polynomials of degree greater than two. A few examples are presented.
متن کاملLGM: Mining Frequent Subgraphs from Linear Graphs
A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Examples include protein contact maps, RNA secondary structures and predicate-argument structures. Our algorithm, linear graph miner (LGM), leverages the vertex order for efficient enumeration of frequent subgraphs. Based o...
متن کاملCombinatorics of the Toric Hilbert Scheme Diane Maclagan and Rekha R. Thomas
The toric Hilbert scheme is a parameter space for all ideals with the same multi-graded Hilbert function as a given toric ideal. Unlike the classical Hilbert scheme, it is unknown whether toric Hilbert schemes are connected. We construct a graph on all the monomial ideals on the scheme, called the flip graph, and prove that the toric Hilbert scheme is connected if and only if the flip graph is ...
متن کاملCombinatorics of the Toric Hilbert Scheme
The toric Hilbert scheme is a parameter space for all ideals with the same multi-graded Hilbert function as a given toric ideal. Unlike the classical Hilbert scheme, it is unknown whether toric Hilbert schemes are connected. We construct a graph on all the monomial ideals on the scheme, called the flip graph, and prove that the toric Hilbert scheme is connected if and only if the flip graph is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Categorical Structures
دوره 19 شماره
صفحات -
تاریخ انتشار 2011