Search results for "Category theory"
showing 10 items of 1172 documents
A matrix of combinatorial numbers related to the symmetric groups
1979
For permutation groups G of finite degree we define numbers t"B(G)=|G|^-^[email protected]?"R"@?"[email protected]?"1(1a"1(g))^b^"^i, where B=(b"1,...,b"1) is a tuple of non-negative integers and a"1(g) denotes the number of i cycles in the element g. We show that t"B(G) is the number of orbits of G, acting on a set @D"B(G) of tuples of matrices. In the case G=S"n we get a natural interpretation for combinatorial numbers connected with the Stiring numbers of the second kind.
Sensitivity Versus Certificate Complexity of Boolean Functions
2016
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of proving this conjecture would be showing that the certificate complexity is polynomially related to sensitivity. Previously, it has been shown that $$bsf \le Cf \le 2^{sf-1} sf - sf-1$$. In this work, we give a better upper bound of $$bsf \le Cf \le \max \left 2^{sf-1}\left sf-\frac{1}{3}\right , sf\right $…
The terminal hyperspace of homogeneous continua
2010
Abstract We investigate the structure of the collection of terminal subcontinua in homogeneous continua. The main result is a reduction of this structure to six specific types. Three of these types are of one-dimensional spaces, and examples representing these types are known. It is not known whether higher dimensional examples having non-trivial terminal subcontinua and representing the three remaining types exist.
Derived categories of irreducible projective curves of arithmetic genus one
2006
We investigate the bounded derived category of coherent sheaves on irreducible singular projective curves of arithmetic genus one. A description of the group of exact auto-equivalences and the set of all $t$ -structures of this category is given. We describe the moduli space of stability conditions, obtain a complete classification of all spherical objects in this category and show that the group of exact auto-equivalences acts transitively on them. Harder–Narasimhan filtrations in the sense of Bridgeland are used as our main technical tool.
Some remarks on the category SET(L), part III
2004
This paper considers the category SET(L) of L-subsets of sets with a fixed basis L and is a continuation of our previous investigation of this category. Here we study its general properties (e.g., we derive that the category is a topological construct) as well as some of its special objects and morphisms.
Scaling properties of topologically random channel networks
1996
Abstract The analysis deals with the scaling properties of infinite topologically random channel networks (ITRNs) fast introduced by Shreve (1967, J. Geol. , 75: 179–186) to model the branching structure of rivers as a random process. The expected configuration of ITRNs displays scaling behaviour only asymptotically, when the ruler (or ‘yardstick’) length is reduced to a very small extent. The random model can also reproduce scaling behaviour at larger ruler lengths if network magnitude and diameter are functionally related according to a reported deterministic rule. This indicates that subsets of rrRNs can be scaling and, although rrRNs are asymptotically plane-filling due to the law of la…
Polyhedral results for a vehicle routing problem
1991
Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.
Finite groups with some C-normal minimal subgroups
2000
Abstract Let G be a finite group. The question of how the properties of its minimal subgroups influence the structure of G is of considerable interest for some scholars. Several authors have investigated this question by using normal or quasinormal conditions. In this paper we use c -normal condition on minimal subgroups to characterize the structure of G through the theory of formations.
On a Category of Extensional Fuzzy Rough Approximation L-valued Spaces
2016
We establish extensionality of some upper and lower fuzzy rough approximation operators on an L-valued set. Taking as the ground basic properties of these operators, we introduce the concept of an (extensional) fuzzy rough approximation L-valued space. We apply fuzzy functions satisfying certain continuity-type conditions, as morphisms between such spaces, and in the result obtain a category \(\mathcal{FRA}{} \mathbf{SPA}(L)\) of fuzzy rough approximation L-valued spaces. An interpretation of fuzzy rough approximation L-valued spaces as L-fuzzy (di)topological spaces is presented and applied for constructing examples in category \(\mathcal{FRA}{} \mathbf{SPA}(L)\).
Varieties and Covarieties of Languages (Extended Abstract)
2013
AbstractBecause of the isomorphism (X×A)→X≅X→(A→X), the transition structure of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. This algebra-coalgebra duality goes back to Arbib and Manes, who formulated it as a duality between reachability and observability, and is ultimately based on Kalmanʼs duality in systems theory between controllability and observability. Recently, it was used to give a new proof of Brzozowskiʼs minimization algorithm for deterministic automata. Here we will use the algebra-coalgebra duality of automata as a common perspective for the study of both varieties and covarieties, which are …