Search results for "Complement"

showing 10 items of 2113 documents

Longest Motifs with a Functionally Equivalent Central Block

2004

International audience; This paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [Crochemore et al., LATIN 2004] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [Crochemore et al., LATIN 2004] and extend to the case of regular expressions with no Kleene closure or …

Discrete mathematics0303 health sciences[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Block (permutation group theory)0102 computer and information sciences01 natural sciencesCombinatoricsKleene algebra03 medical and health sciencesClosure (mathematics)010201 computation theory & mathematicsAlgorithmicsKleene starRegular expressionTime complexity030304 developmental biologyMathematicsComplement (set theory)
researchProduct

Distance graphs and the T-coloring problem

1999

Abstract The T-coloring problem is, given a graph G = (V, E), a set T of nonnegative integers containing 0, and a ‘span’ bound s ⩾ 0, to compute an integer coloring f of the vertices of G such that |f(ν) − f(w)| ∉ T ∀νw ∈ E and max f − min f ⩽ s. This problem arises in the planning of channel assignments for broadcast networks. When restricted to complete graphs, the T-coloring problem boils down to a number problem which can be solved efficiently for many types of sets T. The paper presents results indicating that this is not the case if the set T is arbitrary. To these ends, the class of distance graphs is introduced, which consists of all graphs G : G ≅ G(A) for some (finite) set of posi…

Discrete mathematics1-planar graphTheoretical Computer ScienceCombinatoricsGraph bandwidthGraph powerDiscrete Mathematics and CombinatoricsCographSplit graphGraph coloringComplement graphUniversal graphMathematicsMathematicsofComputing_DISCRETEMATHEMATICSDiscrete Mathematics
researchProduct

Unitary Groups Acting on Grassmannians Associated with a Quadratic Extension of Fields

2006

Let (V, H) be an anisotropic Hermitian space of finite dimension over the algebraic closure of a real closed field K. We determine the orbits of the group of isometries of (V, H) in the set of K-subspaces of V . Throughout the paper K denotes a real closed field and K its algebraic closure. Then it is well known (see, for example, [4, Chapter 2], [23]; see also [8]) that K = K(i) with i = √−1. Also we let (V,H) be an anisotropic Hermitian space (with respect to the involution underlying the quadratic field extension K/K) of finite dimension n over K. In this context we consider the natural action of the unitary group U = U(V,H) of isometries of (V,H) on the set Xd of all ddimensional K-subs…

Discrete mathematicsClassical groupPure mathematicsDouble cosetProjective unitary groupGeneral Mathematics15A21Unitary matrixSettore MAT/04 - Matematiche ComplementariAlgebraic closure11E39Unitary group51N30Quadratic fieldGeometry of classical groups Canonical forms reductions classificationSpecial unitary groupMathematicsRocky Mountain Journal of Mathematics
researchProduct

On the Soluble Graph of a Finite Simple Group

2013

The maximal independent sets of the soluble graph of a finite simple group G are studied and their independence number is determined. In particular, it is shown that this graph in many cases has an independent set with three vertices.

Discrete mathematicsCombinatoricsAlgebra and Number TheoryGraph powerCycle graphVoltage graphCubic graphStrength of a graphNull graphDistance-regular graphComplement graphMathematicsCommunications in Algebra
researchProduct

About Graph Complements

2020

Summary This article formalizes different variants of the complement graph in the Mizar system [3], based on the formalization of graphs in [6].

Discrete mathematicsComputational Mathematicsgraph complementApplied MathematicsQA1-93905c76Graph (abstract data type)loop68v20MathematicsComplement graphMathematicsofComputing_DISCRETEMATHEMATICSMathematicsFormalized Mathematics
researchProduct

On the regularity of circular splicing languages : A survey and new developments

2009

Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focus on the relationship between regular circular languages and languages generated by finite circular splicing systems. We survey the known results towards a characterization of the intersection between these two classes and provide new contributions on the open problem of finding this characterization. First, we exhibit a non-regular circular language generated by a circular simple system thus disproving a known result in this area. Then we give new results related to a restrictive class of circular splicing systems…

Discrete mathematicsComputer scienceOpen problemINF/01 - INFORMATICAGraph theoryCircular wordMolecular computingComputer Science ApplicationsGraph theoryAutomata theory Circular words Formal languages Graph theory Molecular computing Splicing systemsIntersectionFormal languageTheory of computationGraph (abstract data type)CographFormal languageSplicing systemComplement (set theory)Automata theory
researchProduct

JH-Operators and Occasionally Weakly g-Biased Pairs in Fuzzy Symmetric Spaces

2013

We introduce the notions of $\mathcal{JH}$-operators and occasionally weakly $g$-biased mappings in fuzzy symmetric spaces to prove common fixed point theorems for self-mappings satisfying a generalized mixed contractive condition. We also prove analogous results for two pairs of $\mathcal{JH}$-operators by assuming symmetry only on the set of points of coincidence. These results unify, extend and complement many results existing in the recent literature. We give also an application of our results to product spaces.

Discrete mathematicsJH-operatorPure mathematicsFuzzy metric spacelcsh:QA299.6-433lcsh:AnalysisJH-operatorsOccasionally weakly g-biased pairs.Fuzzy logicCoincidenceFuzzy metric spaceSet (abstract data type)Occasionally weakly g-biased pairs"/>Settore MAT/05 - Analisi MatematicaProduct (mathematics)Common fixed pointSymmetry (geometry)Fuzzy symmetric spaceComplement (set theory)MathematicsJournal of Nonlinear Analysis and Application
researchProduct

P-matrix completions under weak symmetry assumptions

2000

An n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix. In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove that a combinatorially symmetric partial positive P-matrix has a positive P-matrix completion if the graph of its specified entries is an n-cycle. In general, a combinatorially symmetric partial Π-matrix has a Π-matrix completion if the graph of its specified entries is a 1-chordal graph. This condition is also necessary for (weakly) sign-symmetric …

Discrete mathematicsMatrix completionNumerical AnalysisAlgebra and Number TheorySymmetric graphCombinatorial symmetry010102 general mathematicsComparability graphIncidence matrix010103 numerical & computational mathematics01 natural sciencesGraphCombinatoricsVertex-transitive graphP-matrixGraph powerDiscrete Mathematics and CombinatoricsRegular graphAdjacency matrixGeometry and Topology0101 mathematicsComplement graphMathematicsLinear Algebra and its Applications
researchProduct

C-Supplemented subgroups of finite groups

2000

A subgroup H of a group G is said to be c-supplemented in G if there exists a subgroup K of G such that HKa G and H\ K is contained in CoreGOHU .W e follow Hall's ideas to characterize the structure of the finite groups in which every subgroup is c-supplemented. Properties of c-supplemented subgroups are also applied to determine the structure of some finite groups.

Discrete mathematicsNormal subgroupCombinatoricsComplement (group theory)Maximal subgroupSubgroupLocally finite groupGeneral MathematicsCharacteristic subgroupIndex of a subgroupFitting subgroupMathematicsGlasgow Mathematical Journal
researchProduct

Groups whose prime graph on conjugacy class sizes has few complete vertices

2012

Abstract Let G be a finite group, and let Γ ( G ) denote the prime graph built on the set of conjugacy class sizes of G. In this paper, we consider the situation when Γ ( G ) has “few complete vertices”, and our aim is to investigate the influence of this property on the group structure of G. More precisely, assuming that there exists at most one vertex of Γ ( G ) that is adjacent to all the other vertices, we show that G is solvable with Fitting height at most 3 (the bound being the best possible). Moreover, if Γ ( G ) has no complete vertices, then G is a semidirect product of two abelian groups having coprime orders. Finally, we completely characterize the case when Γ ( G ) is a regular …

Discrete mathematicsPrime graphStrongly regular graphAlgebra and Number TheoryNeighbourhood (graph theory)Finite groupsCombinatoricsGraph powerWheel graphBound graphPath graphGraph toughnessConjugacy class sizesComplement graphMathematicsJournal of Algebra
researchProduct