Search results for "combinatoric"
showing 10 items of 1776 documents
On the classification of Kim and Kostrikin manifolds
2006
International audience; We completely classify the topological and geometric structures of some series of closed connected orientable 3-manifolds introduced by Kim and Kostrikin in [20, 21] as quotient spaces of certain polyhedral 3-cells by pairwise identifications of their boundary faces. Then we study further classes of closed orientable 3-manifolds arising from similar polyhedral schemata, and describe their topological properties.
THE HOMOLOGY OF DIGRAPHS AS A GENERALIZATION OF HOCHSCHILD HOMOLOGY
2010
J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case where the coefficient ring is a non-commutative algebra. In this paper we define a new homology theory for directed graphs which takes coefficients in an arbitrary $A-A$ bimodule, for $A$ possibly non-commutative, which on polygons agrees with Hochschild homology through a range of dimensions.
Quasi-isometrically embedded subgroups of braid and diffeomorphism groups
2005
We show that a large class of right-angled Artin groups (in particular, those with planar complementary defining graph) can be embedded quasi-isometrically in pure braid groups and in the group of area preserving diffeomorphisms of the disk fixing the boundary (with respect to the $L^2$-norm metric); this extends results of Benaim and Gambaudo who gave quasi-isometric embeddings of $F\_n$ and $\Z^n$ for all $n>0$. As a consequence we are also able to embed a variety of Gromov hyperbolic groups quasi-isometrically in pure braid groups and in the diffeomorphism group of the disk. Examples include hyperbolic surface groups, some HNN-extensions of these along cyclic subgroups and the fundame…
On cyclic branched coverings of prime knots
2007
We prove that a prime knot K is not determined by its p-fold cyclic branched cover for at most two odd primes p. Moreover, we show that for a given odd prime p, the p-fold cyclic branched cover of a prime knot K is the p-fold cyclic branched cover of at most one more knot K' non equivalent to K. To prove the main theorem, a result concerning the symmetries of knots is also obtained. This latter result can be interpreted as a characterisation of the trivial knot.
On the classification of CAT(0) structures for the 4-string braid group
2005
This paper is concerned with the class of so-called CAT(0) groups, namely, those groups that admit a geometric (i.e., properly discontinuous, co-compact, and isometric) action on some CAT(0) space. More precisely, we are interested in knowing to what extent it is feasible to classify the geometric CAT(0) actions of a given group (up to, say, equivariant homothety of the space). A notable example of such a classification is the flat torus theorem, which implies that the minimal geometric CAT(0) actions of the free abelian group Z (n ≥ 1) are precisely the free actions by translations of Euclidean space E. Typically, however, a given group will have uncountably many nonequivalent actions, mak…
Finite index subgroups of mapping class groups
2011
Let g ≥ 3 and n ≥ 0, and let Mg,n be the mapping class group of a surface of genus g with n boundary components. We prove that Mg,n contains a unique subgroup of index 2g−1(2g − 1) up to conjugation, a unique subgroup of index 2g−1(2g + 1) up to conjugation, and the other proper subgroups ofMg,n are of index greater than 2g−1(2g+1). In particular, the minimum index for a proper subgroup of Mg,n is 2g−1(2g − 1). AMS Subject Classification. Primary: 57M99. Secondary: 20G40, 20E28. 0 Introduction and statement of results The interaction between mapping class groups and finite groups has long been a topic of interest. The famous Hurwitz bound of 1893 showed that the mapping class group of a clo…
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…