Search results for "Crete"
showing 10 items of 2495 documents
An efficient Gray code algorithm for generating all permutations with a given major index
2014
Abstract In Effler and Ruskey (2003) [1] the authors give an algorithm, which appears to be CAT, for generating permutations with a given major index. In the present paper we give a new algorithm for generating a Gray code for subexcedant sequences. We show that this algorithm is CAT and modify it into a CAT generating algorithm for a Gray code for permutations with a given major index.
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
2013
Abstract Given graphs G and H, a vertex coloring c : V ( G ) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ ( H , G ) , is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G , Σ ( H , G ) , is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for Σ ( H , G ) , discuss the computational complexity of finding this parameter for different choices of H, and prove an exact formulas for some graphs G. For every integer k and for every graph H, we construct families of graphs, G k with the property that k more colors than χ ( …
Products of locally finite groups with min-p
1986
AbstractThe paper is devoted to showing that if the factorized group G = AB is almost solvable, if A and B are π-subgroups with min-p for some prime p in π and also if the hypercenter factor group A/H(A) or B/H(B) has min p for the prime p. then G is a π-group with min-p for the prime p.
Archimedean actions on median pretrees
2001
In this paper we consider group actions on generalized treelike structures (termed ‘pretrees’) defined simply in terms of betweenness relations. Using a result of Levitt, we show that if a countable group admits an archimedean action on a median pretree, then it admits an action by isometries on an [open face R]-tree. Thus the theory of isometric actions on [open face R]-trees may be extended to a more general setting where it merges naturally with the theory of right-orderable groups. This approach has application also to the study of convergence group actions on continua.
On the type of partial t-spreads in finite projective spaces
1985
AbstractA partial t-spread in a projective space P is a set of mutually skew t-dimensional subspaces of P. In this paper, we deal with the question, how many elements of a partial spread L can be contained in a given d-dimensional subspace of P. Our main results run as follows. If any d-dimensional subspace of P contains at least one element of L, then the dimension of P has the upper bound d−1+(d/t). The same conclusion holds, if no d-dimensional subspace contains precisely one element of L. If any d-dimensional subspace has the same number m>0 of elements of L, then L is necessarily a total t-spread. Finally, the ‘type’ of the so-called geometric t-spreads is determined explicitely.
Kolmogorov numberings and minimal identification
1997
Abstract Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions from their graphs. To address certain problems in minimal identification for Godel numberings, Freivalds later considered minimal identification in Kolmogorov numberings. Kolmogorov numberings are in some sense optimal numberings and have some nice properties. We prove certain separation results for minimal identification in every Kolmogorov numbering. In addition we also compare minimal identification in Godel numberings versus minimal identifica…
Kernel theorems in the setting of mixed nonquasi-analytic classes
2008
Abstract Let Ω 1 ⊂ R r and Ω 2 ⊂ R s be nonempty and open. We introduce the Beurling–Roumieu spaces D ( ω 1 , ω 2 } ( Ω 1 × Ω 2 ) , D ( M , M ′ } ( Ω 1 × Ω 2 ) and obtain tensor product representations of them. This leads for instance to kernel theorems of the following type: every continuous linear map from the Beurling space D ( ω 1 ) ( Ω 1 ) (respectively D ( M ) ( Ω 1 ) ) into the strong dual of the Roumieu space D { ω 2 } ( Ω 2 ) (respectively D { M ′ } ( Ω 2 ) ) can be represented by a continuous linear functional on D ( ω 1 , ω 2 } ( Ω 1 × Ω 2 ) (respectively D ( M , M ′ } ( Ω 1 × Ω 2 ) ).
Classification of n-dimensional subvarieties of G(1, 2n) that can be projected to G(1, n + 1)
2005
A structure theorem is given for n-dimensional smooth subvarieties of the Grassmannian G(1, N); with N >= n + 3, that can be isomorphically projected to G(1, n + 1). A complete classification in the cases N = 2n + 1 and N = 2n follows, as a corollary.
The minimum size of fully irregular oriented graphs
2001
Abstract Digraphs in which any two vertices have different pairs of semi-degrees are called fully irregular. For n-vertex fully irregular oriented graphs (i.e. digraphs without loops or 2-dicycles) the minimum size is presented.
Invariant characters and coprime actions on finite nilpotent groups
2000
Suppose that a group A acts via automorphisms on a nilpotent group G having coprime order. Given an A-invariant character \(\chi \in {\rm Irr}(G)\), we show that the A-primitive irreducible characters that induce \(\chi \) from an A-invariant subgroup of G all have equal degree. We use this result to obtain some information about the characters of groups of p-length 1.