Results 1  10
of
10
Palindromic Permutations and Generalized Smarandache Palindromic Permutations ∗†
, 2006
"... The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups Sn of degree n. It is shown that in Sn, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S2 an ..."
Abstract
 Add to MetaCart
The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups Sn of degree n. It is shown that in Sn, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S2
ON TWO SUBSETS OF GENERALIZED SMARANDACHE PALINDROMES
"... Two subsets of generalized Smarandache palindromes are constructed to determine some of their properties. New sequences, conjectures, and unsolved questions are given. Palindromes are positive integers that read the same way forward and backward. Example: 53135 is a palindrome. Generalized Smarandac ..."
Abstract
 Add to MetaCart
Two subsets of generalized Smarandache palindromes are constructed to determine some of their properties. New sequences, conjectures, and unsolved questions are given. Palindromes are positive integers that read the same way forward and backward. Example: 53135 is a palindrome. Generalized
Smarandache ν−Connected spaces
"... Abstract In this paper Smarandache ν−connectedness and Smarandache locally ν−connectedness in topological space are introduced, obtained some of its basic properties and interrelations are verified with other types of connectedness. ..."
Abstract
 Add to MetaCart
Abstract In this paper Smarandache ν−connectedness and Smarandache locally ν−connectedness in topological space are introduced, obtained some of its basic properties and interrelations are verified with other types of connectedness.
Palindrome Studies (Part I) The Palindrome Concept and Its Applications to Prime Numbers
"... Abstract This article originates from a proposal by M. L. Perez of American Research Press to carry out a study on Smarandache generalized palindromes [1]. The prime numbers were chosen as a rst set of numbers to apply the development of ideas and computer programs on. The study begins by exploring ..."
Abstract
 Add to MetaCart
Abstract This article originates from a proposal by M. L. Perez of American Research Press to carry out a study on Smarandache generalized palindromes [1]. The prime numbers were chosen as a rst set of numbers to apply the development of ideas and computer programs on. The study begins by exploring
Palindrome Studies (Part 1) The Palindrome Concept and Its Applications to Prime Numbers Hen ry Ibstedt
"... Abstract: This article ongmates from a proposal by M. L. Perez of American Research Press to carry out a study on Smarandache generalized palindromes [1]. The prime numbers were chosen as a fIrst)set of numbers to apply the development of ideas and computer programs on. The study begins by exploring ..."
Abstract
 Add to MetaCart
Abstract: This article ongmates from a proposal by M. L. Perez of American Research Press to carry out a study on Smarandache generalized palindromes [1]. The prime numbers were chosen as a fIrst)set of numbers to apply the development of ideas and computer programs on. The study begins
Enumerating segmented patterns in compositions and encoding with restricted permutations, available at http://arxiv.org/abs/math.CO/0505094
"... A composition of a nonnegative integer n is a sequence of positive integers whose sum is n. A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of occurrences of arbitrary segmented partially ordered patterns among ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
among compositions of n with a prescribed number of parts. These patterns generalize the notions of rises, drops, and levels studied in the literature. We also obtain results enumerating parts with given sizes and locations among compositions and palindromic compositions with a given number of parts
References
"... Abstract. Let m be a positive integer with m> 1. In this paper we prove that there exist infinitely many mlh perfect powers which are Smarandache pseudo m th powers of third kind. Let m he a positive integer with m> 1. For a positive integer a, if some nontrivial permutation of the digits is ..."
Abstract
 Add to MetaCart
Abstract. Let m be a positive integer with m> 1. In this paper we prove that there exist infinitely many mlh perfect powers which are Smarandache pseudo m th powers of third kind. Let m he a positive integer with m> 1. For a positive integer a, if some nontrivial permutation of the digits
Maximal continuants and the FineWilf theorem
 J. Combin. Theory Ser. A
"... Abstract. The following problem was posed by C.A. Nicol: given any finite sequence of positive integers, find the permutation for which the continuant (i.e. the continued fraction denominator) having these entries is maximal, resp. minimal. The extremal arrangements are known for the regular continu ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
with any given (fixed) multiplicities. Here the arrangements are uniquely described by a certain generalized continued fraction. We derive this from a purely combinatorial result concerning the partial order structure of the set of permutations of a linearly ordered vector. This set has unique extremal
Introductory Map Theory
, 2010
"... Maps as a mathematical topic arose probably from the four color problem[Bir1, Ore1] and the more general map coloring problem[HiC1, Rin1, Liu11] in the mid of nineteenth century although maps as polyhedra which go back to the Platonic age. I could not list references in detail on them because it is ..."
Abstract
 Add to MetaCart
in development from partition to permutation and as a basis extended to Smarandache geometry shown in [Mao3–4]. This is why maps are much concerned with abstraction in the present stage. In the beginning, maps as polyhedra were as a topological, or geometric object even with geographical consideration[Kem1
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
 Add to MetaCart
of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an npath of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond