Search results for "36"
showing 10 items of 1917 documents
Birman's conjecture for singular braids on closed surfaces
2003
Let M be a closed oriented surface of genus g≥1, let Bn(M) be the braid group of M on n strings, and let SBn(M) be the corresponding singular braid monoid. Our purpose in this paper is to prove that the desingularization map η : SBn(M)→ℤ[Bn(M)], introduced in the definition of the Vassiliev invariants (for braids on surfaces), is injective.
A note on the Lawrence-Krammer-Bigelow representation
2002
A very popular problem on braid groups has recently been solved by Bigelow and Krammer, namely, they have found a faithful linear representation for the braid group B_n. In their papers, Bigelow and Krammer suggested that their representation is the monodromy representation of a certain fibration. Our goal in this paper is to understand this monodromy representation using standard tools from the theory of hyperplane arrangements. In particular, we prove that the representation of Bigelow and Krammer is a sub-representation of the monodromy representation which we consider, but that it cannot be the whole representation.
From braid groups to mapping class groups
2005
This paper is a survey of some properties of the braid groups and related groups that lead to questions on mapping class groups.
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…
A Hard Look at the Neutron Stars and Accretion Disks in 4U 1636-53, GX 17+2, and 4U 1705-44 with NuStar
2017
We present $\emph{NuSTAR}$ observations of neutron star (NS) low-mass X-ray binaries: 4U 1636-53, GX 17+2, and 4U 1705-44. We observed 4U 1636-53 in the hard state, with an Eddington fraction, $F_{\mathrm{Edd}}$, of 0.01; GX 17+2 and 4U 1705-44 were in the soft state with fractions of 0.57 and 0.10, respectively. Each spectrum shows evidence for a relativistically broadened Fe K$_{\alpha}$ line. Through accretion disk reflection modeling, we constrain the radius of the inner disk in 4U 1636-53 to be $R_{in}=1.03\pm0.03$ ISCO (innermost stable circular orbit) assuming a dimensionless spin parameter $a_{*}=cJ/GM^{2}=0.0$, and $R_{in}=1.08\pm0.06$ ISCO for $a_{*}=0.3$ (errors quoted at 1 $\sig…
Hyperfine Paschen-Back regime realized in Rb nanocell
2012
A simple and efficient scheme based on one-dimensional nanometric thin cell filled with Rb and strong permanent ring magnets allowed direct observation of hyperfine Paschen-Back regime on D1 line in 0.5 - 0.7 T magnetic field. Experimental results are perfectly consistent with the theory. In particular, with sigma+ laser excitation, the slopes of B-field dependence of frequency shift for all the 10 individual transitions of 85,87Rb are the same and equal to 18.6 MHz/mT. Possible applications for magnetometry with submicron spatial resolution and tunable atomic frequency references are discussed.
L'héritage incertain du komintern
2016
International audience; ...
L’Association internationale des travailleurs après la Révolution espagnole (1939-années 1990). Principes, tactiques et finalités anarcho-syndicalist…
2017
position de thèse; International audience
1934-1936. Un moment antifasciste
2014
International audience
Design of a Real-time face detection parallel architecture using High-Level Synthesis
2008
Abstract We describe a High-Level Synthesis implementation of a parallel architecture for face detection. The chosen face detection method is the well-known Convolutional Face Finder (CFF) algorithm, which consists of a pipeline of convolution operations. We rely on dataflow modelling of the algorithm and we use a high-level synthesis tool in order to specify the local dataflows of our Processing Element (PE), by describing in C language inter-PE communication, fine scheduling of the successive convolutions, and memory distribution and bandwidth. Using this approach, we explore several implementation alternatives in order to find a compromise between processing speed and area of the PE. We …