Search results for "Combinatorics"
showing 10 items of 1770 documents
Non subanalyticity of sub-Riemannian Martinet spheres
2001
Abstract Consider the sub-Riemannian Martinet structure (M,Δ,g) where M= R 3 , Δ= Ker ( d z− y 2 2 d x) and g is the general gradated metric of order 0 : g=(1+αy) 2 d x 2 +(1+βx+γy) 2 d y 2 . We prove that if α≠0 then the sub-Riemannian spheres S(0,r) with small radii are not subanalytic.
Geometric optimal control of elliptic Keplerian orbits
2005
This article deals with the transfer of a satellite between Keplerian orbits. We study the controllability properties of the system and make a preliminary analysis of the time optimal control using the maximum principle. Second order sufficient conditions are also given. Finally, the time optimal trajectory to transfer the system from an initial low orbit with large eccentricity to a terminal geostationary orbit is obtained numerically.
A Context-Based Adaptation In Mobile Learning
2013
International audience; Recent developments on mobile devices and wireless technologies enable new technical capabilities for the learning domain. Nowadays, learners are able to learn anywhere and at any time. The dynamic and continually changing learning setting in learner's mobile environment gives rise to many different learning contexts. The challenge in context-aware mobile learning is to develop an approach building the best learning content according to dynamic learning situations. This paper aims to develop an adaptive system based on the semantic modeling of the learning content and the learning context. The behavioral part of this approach is made up of rules and metaheuristics to…
Whole mirror duplication-random loss model and pattern avoiding permutations
2010
International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…
Probability and algorithmics: a focus on some recent developments
2017
Jean-François Coeurjolly, Adeline Leclercq-Samson Eds.; International audience; This article presents different recent theoretical results illustrating the interactions between probability and algorithmics. These contributions deal with various topics: cellular automata and calculability, variable length Markov chains and persistent random walks, perfect sampling via coupling from the past. All of them involve discrete dynamics on complex random structures.; Cet article présente différents résultats récents de nature théorique illustrant les interactions entre probabilités et algorithmique. Ces contributions traitent de sujets variés : automates cellulaires et calculabilité, chaînes de Mark…
Coding Partitions
2007
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguous component and other (if any) totally ambiguous components. In the case the code is finite, we give an algorithm for computing its canonical…
Étude de statistiques combinatoires et de leur impact en optimisation évolutionnaire
2021
This thesis studies combinatorial objects, with both an algorithmic and a combinatorial point of view. In the combinatorial part, we take care first, the enumeration of Catalan words avoiding pairs of patterns of length three, presenting the proofs of each case with various enumeration methods. Catalan words are particular growth-restricted words counted by the eponymous integer sequence. More precisely, we systematically explore the structural properties of the sets of words under consideration and give enumerating results by constructive bijections or bivariate generating functions with respect to the length and descent number. Then, we study a sorting machine using two stacks in s…
Equipopularity of descent-equivalent patterns over descent-equivalence classes of words and permutations
2019
Equivalence classes of Dyck paths modulo some statistics
2015
International audience; We investigate new equivalence relations on the set $\mathcal{D}_n$ of Dyck paths relatively to the three statistics of double rises, peaks and valleys. Two Dyck paths ar $r$-equivalent (resp. $p$-equivalent and $v$-equivalent) whenever the positions of their double rises (res. peaks and valleys) are the same. Then, we provide generating functions for the numbers of $r$-, $p$- and $v$-equivalence classes of $\mathcal{D}_n$.
Equivalence classes of permutations modulo excedances
2014
International audience