Search results for "Category theory"

showing 10 items of 1172 documents

Topological structure analysis of chromatin interaction networks.

2019

Abstract Background Current Hi-C technologies for chromosome conformation capture allow to understand a broad spectrum of functional interactions between genome elements. Although significant progress has been made into analysis of Hi-C data to identify biologically significant features, many questions still remain open, in particular regarding potential biological significance of various topological features that are characteristic for chromatin interaction networks. Results It has been previously observed that promoter capture Hi-C (PCHi-C) interaction networks tend to separate easily into well-defined connected components that can be related to certain biological functionality, however, …

Chromatin interaction networksFunctionally related modulesComputer scienceCellStructure (category theory)Topologylcsh:Computer applications to medicine. Medical informaticsBiochemistryGenomeChromosome conformation capture03 medical and health sciences0302 clinical medicineGraph topologyStructural BiologyComponent (UML)medicineHumansGene Regulatory NetworksCell type specificityPromoter Regions GeneticMolecular Biologylcsh:QH301-705.5030304 developmental biologyConnected component0303 health sciencesApplied MathematicsResearchChromatinComputer Science ApplicationsChromatinHematopoiesisIdentification (information)medicine.anatomical_structurelcsh:Biology (General)Gene Expression RegulationTopological graph theorylcsh:R858-859.7DNA microarray030217 neurology & neurosurgeryAlgorithmsBMC bioinformatics
researchProduct

Characteristic Topological Features of Promoter Capture Hi-C Interaction Networks

2020

Current Hi-C technologies for chromosome conformation capture allow to understand a broad spectrum of functional interactions between genome elements. Although significant progress has been made into analysis of Hi-C data to identify the biologically significant features, many questions still remain open. In this paper we describe analysis methods of Hi-C (specifically PCHi-C) interaction networks that are strictly focused on topological properties of these networks. The main questions we are trying to answer are: (1) can topological properties of interaction networks for different cell types alone be sufficient to distinguish between these types, and what the most important of such propert…

Chromosome conformation captureBroad spectrumCurrent (mathematics)Biological significanceComputer scienceStructure (category theory)Topological graph theoryTopologyGenomeAnalysis method
researchProduct

Permutability of injectors with a central socle in a finite solvable group

2017

In response to an Open Question of Doerk and Hawkes [5, IX Section 3, page 615], we shall show that if Zπ is the Fitting class formed by the finite solvable groups whose π-socle is central (where π is a set of prime numbers), then the Zπ-injectors of a finite solvable group G permute with the members of a Sylow basis in G. The proof depends on the properties of certain extraspecial groups [4].

Class (set theory)Algebra and Number Theory010102 general mathematicsSylow theoremsPrime numberBasis (universal algebra)01 natural sciencesFitting subgroupSet (abstract data type)CombinatoricsSection (category theory)Solvable group0103 physical sciences010307 mathematical physics0101 mathematicsMathematicsJournal of Algebra
researchProduct

THE TOPOLOGY OF BASIN BOUNDARIES IN A CLASS OF THREE-DIMENSIONAL DYNAMICAL SYSTEMS

1996

We will develop new methods to determine the topology of the basin boundary in a class of three-dimensional dynamical systems. One approach is to approximate the basin boundary by backward integration. Unfortunately, there are dynamical systems where it is hard to approximate the basin boundary by a numerical backward integration algorithm. We will introduce topological methods which will provide new information about the structure of the basin boundary. The topological invariants which we will use can be numerically computed.

Class (set theory)Dynamical systems theoryComputingMethodologies_SIMULATIONANDMODELINGApplied MathematicsStructure (category theory)Boundary (topology)ComputerApplications_COMPUTERSINOTHERSYSTEMSStructural basinTopologyModeling and SimulationTopological invariantsIntegration algorithmEngineering (miscellaneous)Physics::Atmospheric and Oceanic PhysicsTopology (chemistry)MathematicsInternational Journal of Bifurcation and Chaos
researchProduct

Are locally finite MV-algebras a variety?

2021

We answer Mundici's problem number 3 (D. Mundici. Advanced {\L}ukasiewicz calculus. Trends in Logic Vol. 35. Springer 2011, p. 235): Is the category of locally finite MV-algebras equivalent to an equational class? We prove: (i) The category of locally finite MV-algebras is not equivalent to any finitary variety. (ii) More is true: the category of locally finite MV-algebras is not equivalent to any finitely-sorted finitary quasi-variety. (iii) The category of locally finite MV-algebras is equivalent to an infinitary variety; with operations of at most countable arity. (iv) The category of locally finite MV-algebras is equivalent to a countably-sorted finitary variety. Our proofs rest upon th…

Class (set theory)Pure mathematicsAlgebra and Number Theory06D35 (Primary) 18C05 (Secondary)Duality (mathematics)Mathematics - Category TheoryMathematics - LogicArityMathematical proofComputer Science::Logic in Computer ScienceMathematics::Category TheoryFOS: MathematicsCountable setFinitaryCategory Theory (math.CT)Variety (universal algebra)Logic (math.LO)Categorical variableMathematics
researchProduct

Wellfounded Trees and Dependent Polynomial Functors

2004

We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by in- vestigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class of endofunctors on locally cartesian closed cat- egories.

Class (set theory)Pure mathematicsCartesian closed categoryFunctorType theoryMathematics::Category TheoryComputer Science::Logic in Computer ScienceWellfounded trees locally cartesian closed categories categorical logicTree (set theory)PrewellorderingCategory theoryForgetful functorMathematics
researchProduct

The identity type weak factorisation system

2008

We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the right class of the weak factorisation system. This characterisation is applied to relate identity types and the homotopy theory of groupoids.

Class (set theory)Pure mathematicsGeneral Computer ScienceDependent type theoryHomotopiaType (model theory)Identity (music)Theoretical Computer Science510 - Consideracions fonamentals i generals de les matemàtiquesCombinatorics18C50Mathematics::Category TheoryFOS: MathematicsCategory Theory (math.CT)Univalent foundationsAxiomMathematicsHomotopy03B15; 18C50; 18B40Mathematics - Category TheoryIdentity type weak factorisation systemMathematics - LogicTipus Teoria dels03B15Type theory18B40Homotopy type theoryLogic (math.LO)Weak factorisation systemIdentity typeComputer Science(all)
researchProduct

TOPOLOGICAL QUANTUM DOUBLE

1994

Following a preceding paper showing how the introduction of a t.v.s. topology on quantum groups led to a remarkable unification and rigidification of the different definitions, we adapt here, in the same way, the definition of quantum double. This topological double is dualizable and reflexive (even for infinite dimensional algebras). In a simple case we show, considering the double as the "zero class" of an extension theory, the uniqueness of the double structure as a quasi-Hopf algebra. A la suite d'un précédent article montrant comment l'introduction d'une topologie d'e.v.t. sur les groupes quantiques permet une unification et une rigidification remarquables des différentes définitions,…

Class (set theory)UnificationSimple (abstract algebra)Zero (complex analysis)Structure (category theory)Statistical and Nonlinear PhysicsUniquenessExtension theoryTopologyQuantumMathematical PhysicsMathematicsReviews in Mathematical Physics
researchProduct

Some contributions to the theory of transformation monoids

2019

The aim of this paper is to present some contributions to the theory of finite transformation monoids. The dominating influence that permutation groups have on transformation monoids is used to describe and characterise transitive transformation monoids and primitive transitive transformation monoids. We develop a theory that not only includes the analogs of several important theorems of the classical theory of permutation groups but also contains substantial information about the algebraic structure of the transformation monoids. Open questions naturally arising from the substantial paper of Steinberg [A theory of transformation monoids: combinatorics and representation theory. Electron. J…

Classical theoryTransitive relationPure mathematicsAlgebra and Number TheoryConjectureAlgebraic structure010102 general mathematicsPermutation group01 natural sciencesTransformation (music)Development (topology)Mathematics::Category Theory0103 physical sciencesÀlgebra010307 mathematical physics0101 mathematicsMathematicsJournal of Algebra
researchProduct

Evaluating Bug-Fixing in Software Product Lines

2016

[Background] Bug-fixing could be complex in industrial practice since thousands of products share features in their configuration. Despite the importance and complexity of bug-fixing, there is still a lack of empirical data about the difficulties found in industrial Software Product Lines (SPLs). [Aims] This paper aims to evaluate engineers' performance fixing errors and propagating the fixes to other configured products in the context of an industrial SPL. [Method] We designed and conducted an empirical study to collect data with regard to bug-fixing tasks within the context of a Induction Hob SPL in the BSH group, the largest manufacturer of home appliances in Europe. [Results] We found t…

Cloning (programming)Computer sciencebusiness.industry05 social sciences020207 software engineeringUsabilityContext (language use)02 engineering and technologySoftwareEmpirical researchSoftware_SOFTWAREENGINEERING0502 economics and business0202 electrical engineering electronic engineering information engineeringProduct (category theory)Software product linebusinessSoftware engineeringKnow-how050203 business & managementProceedings of the 10th ACM/IEEE International Symposium on Empirical Software Engineering and Measurement
researchProduct