Search results for "Combinatorics"
showing 10 items of 1770 documents
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
Gray visiting Motzkins
2002
We present the first Gray code for Motzkin words and their generalizations: k colored Motzkin words and Schroder words. The construction of these Gray codes is based on the observation that a k colored Motzkin word is the shuffle of a Dyck word by a k-ary variation on a trajectory which is a combination. In the final part of the paper we give some algorithmic considerations and other possible applications of the techniques introduced here.
Rational irreducible characters and rational conjugacy classes in finite groups
2007
We prove that a finite group G G has two rational-valued irreducible characters if and only if it has two rational conjugacy classes, and determine the structure of any such group. Along the way we also prove a conjecture of Gow stating that any finite group of even order has a non-trivial rational-valued irreducible character of odd degree.
Complex group algebras of finite groups: Brauer’s Problem 1
2005
Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.
The absolute center of a unicyclic network
1989
Abstract A unicyclic network is one generalization of a tree network. In this paper we examine the problem of finding an absolute center of a unicyclic network. We show that this problem can be solved in linear time with respect to the number of vertices in the network.
Some subgroup embeddings in finite groups: A mini review
2015
[EN] In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied. ª 2014 Production and hosting by Elsevier B.V. on behalf of Cairo University
Protein data condensation for effective quaternary structure classification
2007
Many proteins are composed of two or more subunits, each associated with different polypeptide chains. The number and the arrangement of subunits forming a protein are referred to as quaternary structure. The quaternary structure of a protein is important, since it characterizes the biological function of the protein when it is involved in specific biological processes. Unfortunately, quaternary structures are not trivially deducible from protein amino acid sequences. In this work, we propose a protein quaternary structure classification method exploiting the functional domain composition of proteins. It is based on a nearest neighbor condensation technique in order to reduce both the porti…
Maximum Common Subgraph based locally weighted regression
2012
This paper investigates a simple, yet effective method for regression on graphs, in particular for applications in chem-informatics and for quantitative structure-activity relationships (QSARs). The method combines Locally Weighted Learning (LWL) with Maximum Common Subgraph (MCS) based graph distances. More specifically, we investigate a variant of locally weighted regression on graphs (structures) that uses the maximum common subgraph for determining and weighting the neighborhood of a graph and feature vectors for the actual regression model. We show that this combination, LWL-MCS, outperforms other methods that use the local neighborhood of graphs for regression. The performance of this…
Common fixed points in cone metric spaces for CJM-pairs
2011
Abstract In this paper we introduce some contractive conditions of Meir–Keeler type for two mappings, called f - M K -pair mappings and f - C J M -pair (from Ciric, Jachymski, and Matkowski) mappings, in the framework of regular cone metric spaces and we prove theorems which guarantee the existence and uniqueness of common fixed points. We give also a fixed point result for a multivalued mapping that satisfies a contractive condition of Meir–Keeler type. These results extend and generalize some recent results from the literature. To conclude the paper, we extend our main result to non-regular cone metric spaces by using the scalarization method of Du.
Mond's conjecture for maps between curves
2017
A theorem by D. Mond shows that if f:(C,0)→C2,0 is finite and has has degree one onto its image (Y, 0), then the Ae-codimension is less than or equal to the image Milnor number μI(f), with equality if and only if (Y, 0) is weighted homogeneous. Here we generalize this result to the case of a map germ f:(X,0)→C2,0, where (X, 0) is a plane curve singularity.