Search results for "Rete"
showing 10 items of 3470 documents
A simple algorithm for finding short sigma-definite representatives
2010
We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.
Ping-pong configurations and circular orders on free groups
2017
We discuss actions of free groups on the circle with "ping-pong" dynamics; these are dynamics determined by a finite amount of combinatorial data, analogous to Schottky domains or Markov partitions. Using this, we show that the free group $F_n$ admits an isolated circular order if and only if n is even, in stark contrast with the case for linear orders. This answers a question from (Mann, Rivas, 2016). Inspired by work of Alvarez, Barrientos, Filimonov, Kleptsyn, Malicet, Menino and Triestino, we also exhibit examples of "exotic" isolated points in the space of all circular orders on $F_2$. Analogous results are obtained for linear orders on the groups $F_n \times \mathbb{Z}$.
Compressed Drinfeld associators
2004
Drinfeld associator is a key tool in computing the Kontsevich integral of knots. A Drinfeld associator is a series in two non-commuting variables, satisfying highly complicated algebraic equations - hexagon and pentagon. The logarithm of a Drinfeld associator lives in the Lie algbera L generated by the symbols a,b,c modulo [a,b]=[b,c]=[c,a]. The main result is a description of compressed associators that satisfy the compressed pentagon and hexagon in the quotient L/[[L,L],[L,L]]. The key ingredient is an explicit form of Campbell-Baker-Hausdorff formula in the case when all commutators commute.
On the optimal control of the circular restricted three body problem
2011
The context of this work is space mechanics. More precisely, we aim at computing low thrust transfers in the Earth-Moon system modeled by the circular restricted three-body problem. The goal is to calculate the optimal steering of the spacecraft engine with respect to two optimization criteria: Final time and fuel consumption. The contributions of this thesis are of two kinds. Geometric, first, as we study the controllability of the system together with the geometry of the transfers (structure of the command) by means of geometric control tools. Numerical, then, different homotopic methods being developed. A two-three body continuation is used to compute minimum time trajectories, and then …
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.
Computerized delimitation of odorant areas in gas-chromatography-olfactometry by kernel density estimation: Data processing on French white wines
2017
International audience; GC-O using the detection frequency method gives a list of odor events (OEs) where each OE is described by a linear retention index (LRI) and by the aromatic descriptor given by a human assessor. The aim of the experimenter is to gather OEs in a total olfactogram on which he tries to delimit odorant areas (OAs), then to compute each detection frequency. This paper proposes a computerized mathematical method based on kernel density estimation that makes up the total olfactogram as continuous and differentiable function from the OEs LRI only. The corresponding curve looks like a chromatogram, the peaks of which are potential OAs. The limits of an OA are the LRI of the t…
An original approach for gas chromatography-olfactometry detection frequency analysis: Application to gin
2012
Abstract Gas Chromatography-Olfactometry (GC-O) is a technique that lies halfway between physicochemical and sensory analysis and involves the perception of volatile flavour compounds, separated by gas chromatography, by the human nose. Of the different GC-O procedures available, detection frequency has been proved to be more rapid and more repeatable, even with an untrained panel. This characteristic regarding the panel is often not considered when dealing with the sensory attributes determined by assessors. An original approach to GC-O using the detection frequency procedure has been developed and tested on two types of gin and made it possible to benefit from sensory data. The panel cons…
An Essay on Denotational Mathematics
2019
Denotational mathematics is a new rigorous discipline of theoretical computer science that springs out from the attempt to provide a suitable mathematical framework in which laid out new algebraic structures formalizing certain formal patterns coming from computational and natural intelligence, software science, cognitive informatics, neuronal networks, and artificial intelligence. In this chapter, a very brief but rigorous exposition of the main formal structures of denotational mathematics is outlined within naive set theory.
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…
Topological properties of cellular automata on trees
2012
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.