On the dimension of Z-sets

We offer a short and elementary proof that, for a Z-set A in a finite-dimensional ANR Y, dimA<dimY. This result is relevant to the study of group boundaries. The original proof by Bestvina and Mess relied on cohomological dimension theory.Comment: 4 pages, no figure

Iodoarene-Catalyzed Cyclizations of Unsaturated Amides

The cyclization of N-alkenylamides catalyzed by iodoarenes under oxidative conditions is presented. Five-, six-, and seven-membered rings with a range of substitutions can be prepared by this route. Preliminary data from the use of chiral iodoarenes as precatalysts show that enantiocontrol is feasible

Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks

We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal times for the other agent. The goal of the agents is to meet on an edge or a node of the graph. In this scenario, we study the time required by the agents to meet, compared to the meeting time $T_{OPT}$ in the offline scenario in which the agents have complete knowledge about each others speed characteristics. When no additional assumptions are made, we show that rendezvous in our model can be achieved after time $O(n T_{OPT})$ in a $n$-node graph, and that such time is essentially in some cases the best possible. However, we prove that the rendezvous time can be reduced to $\Theta (T_{OPT})$ when the agents are allowed to exchange $\Theta(n)$ bits of information at the start of the rendezvous process. We then show that under some natural assumption about the traversal times of edges, the hardness of the heterogeneous rendezvous problem can be substantially decreased, both in terms of time required for rendezvous without communication, and the communication complexity of achieving rendezvous in time $\Theta (T_{OPT})$

Byzantine Gathering in Networks

This paper investigates an open problem introduced in [14]. Two or more mobile agents start from different nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a different positive integer (called label) to each of them. Initially, each agent knows its label but does not know the labels of the other agents or their positions relative to its own. Agents move in synchronous rounds and can communicate with each other only when located at the same node. Up to f of the agents are Byzantine. A Byzantine agent can choose an arbitrary port when it moves, can convey arbitrary information to other agents and can change its label in every round, in particular by forging the label of another agent or by creating a completely new one. What is the minimum number M of good agents that guarantees deterministic gathering of all of them, with termination? We provide exact answers to this open problem by considering the case when the agents initially know the size of the network and the case when they do not. In the former case, we prove M=f+1 while in the latter, we prove M=f+2. More precisely, for networks of known size, we design a deterministic algorithm gathering all good agents in any network provided that the number of good agents is at least f+1. For networks of unknown size, we also design a deterministic algorithm ensuring the gathering of all good agents in any network but provided that the number of good agents is at least f+2. Both of our algorithms are optimal in terms of required number of good agents, as each of them perfectly matches the respective lower bound on M shown in [14], which is of f+1 when the size of the network is known and of f+2 when it is unknown

Tsunamis and tectonic deformation at the northern Cascadia margin: A 3000 year record from Deserted Lake

Abstract: Three layers of sand occur within a sequence of muddy gyttja in a 3 m core recovered from Deserted Lake, which lies at the head of a fjord on the central west coast of Vancouver Island, British Columbia, Canada. The sedimentology and microfossil assemblages of these layers are consistent with deposition by tsunamis. Radiocarbon ages suggest that the tsunamis were generated by plate-boundary earthquakes at the Cascadia subduction zone about 2600, 1600 and 300 years ago. Diatom and protozoan contents of the gyttja layers indicate that relative sea level fell in the periods between tsunamis. The sea-level changes are probably a product of interseismic uplift of the North America plate margin. Post-tsunami diatom and protozoan assemblages are generally more marine than their pre-tsunami counterparts, suggesting that the study site subsided during earthquakes. Estimates of interseismic and coseismic deformation during one earthquake cycle indicate that less than half of the interseismic uplift was recovered during the earthquake, leading to cumulative, or permanent, uplift of the area

A Search for Hierarchical Triples using Kepler Eclipse Timing

We present the first results of a Kepler survey of 41 eclipsing binaries that we undertook to search for third star companions. Such tertiaries will periodically alter the eclipse timings through light travel time and dynamical effects. We discuss the prevalence of starspots and pulsation among these binaries and how these phenomena influence the eclipse times. There is no evidence of short period companions (P < 700 d) among this sample, but we do find evidence for long term timing variations in 14 targets (34%). We argue that this finding is consistent with the presence of tertiary companions among a significant fraction of the targets, especially if many have orbits measured in decades. This result supports the idea that the formation of close binaries involves the deposition of angular momentum into the orbital motion of a third star.Comment: AJ, in press, 104 pages, 2 figure sets plus 1 regular figur

Anonymous Graph Exploration with Binoculars

International audienceWe investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after the exploration except if the graph is a tree. We therefore endow the agent with binoculars, a sensing device that can show the local structure of the environment at a constant distance of the agent current location.We show that, with binoculars, it is possible to explore and halt in a large class of non-tree networks. We give a complete characterization of the class of networks that can be explored using binoculars using standard notions of discrete topology. This class is much larger than the class of trees: it contains in particular chordal graphs, plane triangulations and triangulations of the projective plane. Our characterization is constructive, we present an Exploration algorithm that is universal; this algorithm explores any network explorable with binoculars, and never halts in non-explorable networks

ÉTUDE EXPÉRIMENTALE ET THÉORIQUE DES NOYAUX DE TRANSITION 68,70,72,74Ge

Les isotopes de 68,70,72,74Ge ont été étudiés avec une haute résolution en énergie au moyen de la réaction (p, t). Un grand nombre de nouveaux niveaux 0+, 2+ et 4+ à basse énergie ont été mis en évidence. Des calculs semi-microscopiques de surfaces d'énergie potentielle et de spectres ont été effectués et des conclusions sont données sur la structure des noyaux Ge

Determination of fungal activity in modified wood by means of micro-calorimetry and determination of total esterase activity

Beech and pine wood blocks were treated with 1,3-dimethylol-4,5-dihydroxyethylen urea (DMDHEU) to increasing weight percent gains (WPG). The resistance of the treated specimens against Trametes versicolor and Coniophora puteana, determined as mass loss, increased with increasing WPG of DMDHEU. Metabolic activity of the fungi in the wood blocks was assessed as total esterase activity (TEA) based on the hydrolysis of fluorescein diacetate and as heat or energy production determined by isothermal micro-calorimetry. Both methods revealed that the fungal activity was related with the WPG and the mass loss caused by the fungi. Still, fungal activity was detected even in wood blocks of the highest WPG and showed that the treatment was not toxic to the fungi. Energy production showed a higher consistency with the mass loss after decay than TEA; higher mass loss was more stringently reflected by higher heat production rate. Heat production did not proceed linearly, possibly due to the inhibition of fungal activity by an excess of carbon dioxide