Search results for "Bijection"
showing 10 items of 32 documents
Universal Lyndon Words
2014
A word w over an alphabet Σ is a Lyndon word if there exists an order defined on Σ for which w is lexicographically smaller than all of its conjugates (other than itself). We introduce and study universal Lyndon words, which are words over an n-letter alphabet that have length n! and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every n and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us t…
Decomposable Measures and Measures of Information for Crisp and Fuzzy Sets
1983
Abstract There exist bijections between the decomposable informations of Kampe de Feriet and Forte (1967a) and the decomposable measures of Weber (1982). Using integrals for Archimedean decomposable operations, introduced by Weber (1982), informations and measures of this type are extended from crisp to fuzzy sets. For ∨-decomposable measures, Sugeno’s (1974) integral is used. For ∧-decomposable informations, Nguyen’s (1977) construction and a modification are discussed.
Dyck paths with a first return decomposition constrained by height
2018
International audience; We study the enumeration of Dyck paths having a first return decomposition with special properties based on a height constraint. We exhibit new restricted sets of Dyck paths counted by the Motzkin numbers, and we give a constructive bijection between these objects and Motzkin paths. As a byproduct, we provide a generating function for the number of Motzkin paths of height k with a flat (resp. with no flats) at the maximal height. (C) 2018 Elsevier B.V. All rights reserved.KeywordsKeyWords Plus:STATISTICS; STRINGS
Enumeration of Łukasiewicz paths modulo some patterns
2019
Abstract For any pattern α of length at most two, we enumerate equivalence classes of Łukasiewicz paths of length n ≥ 0 where two paths are equivalent whenever the occurrence positions of α are identical on these paths. As a byproduct, we give a constructive bijection between Motzkin paths and some equivalence classes of Łukasiewicz paths.
Remarks on mapping properties for the Bargmann transform on modulation spaces
2011
We investigate the mapping properties for the Bargmann transform and prove that this transform is isometricand bijective from modulation spaces to convenient Banach spaces of analytic functions.
A new Euler–Mahonian constructive bijection
2011
AbstractUsing generating functions, MacMahon proved in 1916 the remarkable fact that the major index has the same distribution as the inversion number for multiset permutations, and in 1968 Foata gave a constructive bijection proving MacMahon’s result. Since then, many refinements have been derived, consisting of adding new constraints or new statistics.Here we give a new simple constructive bijection between the set of permutations with a given number of inversions and those with a given major index. We introduce a new statistic, mix, related to the Lehmer code, and using our new bijection we show that the bistatistic (mix,INV) is Euler–Mahonian. Finally, we introduce the McMahon code for …
An extension of the Burrows-Wheeler Transform
2007
AbstractWe describe and highlight a generalization of the Burrows–Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A∗. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.
Restriction of odd degree characters and natural correspondences
2016
Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a natural correspondence of characters, both for $GL_n(q)$ and $SL_n(q)$. A similar result is established for certain finite groups with self-normalizing Sylow $p$-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of $S_n$ and those of $M$, where $M$ is any maximal subgroup of $S_n$ of odd index; as well as between the odd-degree irreducible characters of $G = GL_n(q)$ or $GU_n(q)$ with $q$ odd and those of $N_{G}…
Una generalizzazione del birapporto sopra un anello
1990
We generalize to the case of the projective line over a (not necessarily commutative) ring the well-know theorem on the bijective maps preserving a given cross-ratio.
Catalan words avoiding pairs of length three patterns
2021
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last authors and of S. Kirgizov where (among other things) the enumeration of Catalan words avoiding a patterns of length 3 is completed. More precisely, we explore systematically the structural properties of the sets of words under consideration and give enumerating results by means of recursive decomposition, constructive bijections or bivariate generating functions with respect to the length and descent number. Some of the obtained enumerating sequences are kn…