1,2,3-Trifluoro­benzene

In the title compound, C6H3F3, weak electrostatic and dispersive forces between C(δ+)—F(δ−) and H(δ+)—C(δ−) groups are at the borderline of the hydrogen-bond phenomenon and are poorly directional and further deformed in the presence of π–π stacking inter­actions. The mol­ecule lies on a twofold rotation axis. In the crystal structure, one-dimensional tapes are formed via two anti­dromic C—H⋯F hydrogen bonds. These tapes are, in turn, connected into corrugated two-dimensional sheets by bifurcated C—H⋯F hydrogen bonds. Packing in the third dimension is furnished by π–π stacking inter­actions with a centroid–centroid distance of 3.6362 (14) Å

1,3-Difluoro­benzene

The weak electrostatic and dispersive forces between C(δ+)—F(δ−) and H(δ+)—C(δ−) are at the borderline of the hydrogen-bond phenomenon and are poorly directional and further deformed in the presence of other dominant inter­actions, e.g. C—H⋯π. The title compound, C6H4F2, Z′ = 2, forms one-dimensional tapes along two homodromic C—H⋯F hydrogen bonds. The one-dimensional tapes are connected into corrugated two-dimensional sheets by further bi- or trifrucated C—H⋯F hydrogen bonds. Packing in the third dimension is controlled by C—H⋯π inter­actions

An adaptive prefix-assignment technique for symmetry reduction

This paper presents a technique for symmetry reduction that adaptively assigns a prefix of variables in a system of constraints so that the generated prefix-assignments are pairwise nonisomorphic under the action of the symmetry group of the system. The technique is based on McKay's canonical extension framework [J.~Algorithms 26 (1998), no.~2, 306--324]. Among key features of the technique are (i) adaptability---the prefix sequence can be user-prescribed and truncated for compatibility with the group of symmetries; (ii) parallelizability---prefix-assignments can be processed in parallel independently of each other; (iii) versatility---the method is applicable whenever the group of symmetries can be concisely represented as the automorphism group of a vertex-colored graph; and (iv) implementability---the method can be implemented relying on a canonical labeling map for vertex-colored graphs as the only nontrivial subroutine. To demonstrate the practical applicability of our technique, we have prepared an experimental open-source implementation of the technique and carry out a set of experiments that demonstrate ability to reduce symmetry on hard instances. Furthermore, we demonstrate that the implementation effectively parallelizes to compute clusters with multiple nodes via a message-passing interface.Comment: Updated manuscript submitted for revie

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollobas, and Sorkin (2004) and by Aigner and van der Holst (2004). We present an algorithm to evaluate the multivariate interlace polynomial of a graph with n vertices given a tree decomposition of the graph of width k. The best previously known result (Courcelle 2008) employs a general logical framework and leads to an algorithm with running time f(k)*n, where f(k) is doubly exponential in k. Analyzing the GF(2)-rank of adjacency matrices in the context of tree decompositions, we give a faster and more direct algorithm. Our algorithm uses 2^{3k^2+O(k)}*n arithmetic operations and can be efficiently implemented in parallel.Comment: v4: Minor error in Lemma 5.5 fixed, Section 6.6 added, minor improvements. 44 pages, 14 figure

Experimental discrimination of ion stopping models near the Bragg peak in highly ionized matter

The energy deposition of ions in dense plasmas is a key process in inertial confinement fusion that determines the α-particle heating expected to trigger a burn wave in the hydrogen pellet and resulting in high thermonuclear gain. However, measurements of ion stopping in plasmas are scarce and mostly restricted to high ion velocities where theory agrees with the data. Here, we report experimental data at low projectile velocities near the Bragg peak, where the stopping force reaches its maximum. This parameter range features the largest theoretical uncertainties and conclusive data are missing until today. The precision of our measurements, combined with a reliable knowledge of the plasma parameters, allows to disprove several standard models for the stopping power for beam velocities typically encountered in inertial fusion. On the other hand, our data support theories that include a detailed treatment of strong ion-electron collisions

Probabilistic Properties of Highly Connected Random Geometric Graphs

In this paper we study the probabilistic properties of reliable networks of minimal total edge lengths. We study reliability in terms of k-edge-connectivity in graphs in d-dimensional space. We show this problem fits into Yukich’s framework for Euclidean functionals for arbitrary k, dimension d and distant-power gradient p, with p < d. With this framework several theorems on the convergence of optimal solutions follow. We apply Yukich’s framework for functionals so that we can use partitioning algorithms that rapidly compute near-optimal solutions on typical examples. These results are then extended to optimal k-edge-connected power assignment graphs, where we assign power to vertices and charge per vertex. The network can be modelled as a wireless network

An Introduction to Temporal Graphs: An Algorithmic Perspective

A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and not the entities themselves, a temporal graph may be viewed as a sequence $G_1,G_2\ldots,G_l$ of static graphs over the same (static) set of nodes $V$. Though static graphs have been extensively studied, for their temporal generalization we are still far from having a concrete set of structural and algorithmic principles. Recent research shows that many graph properties and problems become radically different and usually substantially more difficult when an extra time dimension in added to them. Moreover, there is already a rich and rapidly growing set of modern systems and applications that can be naturally modeled and studied via temporal graphs. This, further motivates the need for the development of a temporal extension of graph theory. We survey here recent results on temporal graphs and temporal graph problems that have appeared in the Computer Science community

A Draft of the Human Septin Interactome

Background: Septins belong to the GTPase superclass of proteins and have been functionally implicated in cytokinesis and the maintenance of cellular morphology. They are found in all eukaryotes, except in plants. In mammals, 14 septins have been described that can be divided into four groups. It has been shown that mammalian septins can engage in homo- and heterooligomeric assemblies, in the form of filaments, which have as a basic unit a hetero-trimeric core. In addition, it has been speculated that the septin filaments may serve as scaffolds for the recruitment of additional proteins. Methodology/Principal Findings: Here, we performed yeast two-hybrid screens with human septins 1-10, which include representatives of all four septin groups. Among the interactors detected, we found predominantly other septins, confirming the tendency of septins to engage in the formation of homo- and heteropolymeric filaments. Conclusions/Significance: If we take as reference the reported arrangement of the septins 2, 6 and 7 within the heterofilament, (7-6-2-2-6-7), we note that the majority of the observed interactions respect the ""group rule"", i.e. members of the same group (e. g. 6, 8, 10 and 11) can replace each other in the specific position along the heterofilament. Septins of the SEPT6 group preferentially interacted with septins of the SEPT2 group (p<0.001), SEPT3 group (p<0.001) and SEPT7 group (p<0.001). SEPT2 type septins preferentially interacted with septins of the SEPT6 group (p<0.001) aside from being the only septin group which interacted with members of its own group. Finally, septins of the SEPT3 group interacted preferentially with septins of the SEPT7 group (p<0.001). Furthermore, we found non-septin interactors which can be functionally attributed to a variety of different cellular activities, including: ubiquitin/sumoylation cycles, microtubular transport and motor activities, cell division and the cell cycle, cell motility, protein phosphorylation/signaling, endocytosis, and apoptosis.Fundao de Amparo a Pesquisa do Estado Sao Paulo (Fapesp)CAPES: Coordenao de Aperfeioamento de Pessoal de Navel SuperiorConselho Nacional de Pesquisa e Desenvolvimento (CNPq)Laboratorio Nacional de Biociencias-Centro Nacional de Pesquisa em Energia e Materais (LNBio-CNPEM

Is Information-Theoretic Topology-Hiding Computation Possible?

Topology-hiding computation (THC) is a form of multi-party computation over an incomplete communication graph that maintains the privacy of the underlying graph topology. Existing THC protocols consider an adversary that may corrupt an arbitrary number of parties, and rely on cryptographic assumptions such as DDH. In this paper we address the question of whether information-theoretic THC can be achieved by taking advantage of an honest majority. In contrast to the standard MPC setting, this problem has remained open in the topology-hiding realm, even for simple privacy-free functions like broadcast, and even when considering only semi-honest corruptions. We uncover a rich landscape of both positive and negative answers to the above question, showing that what types of graphs are used and how they are selected is an important factor in determining the feasibility of hiding topology information-theoretically. In particular, our results include the following. We show that topology-hiding broadcast (THB) on a line with four nodes, secure against a single semi-honest corruption, implies key agreement. This result extends to broader classes of graphs, e.g., THB on a cycle with two semi-honest corruptions. On the other hand, we provide the first feasibility result for information-theoretic THC: for the class of cycle graphs, with a single semi-honest corruption. Given the strong impossibilities, we put forth a weaker definition of distributional-THC, where the graph is selected from some distribution (as opposed to worst-case). We present a formal separation between the definitions, by showing a distribution for which information theoretic distributional-THC is possible, but even topology-hiding broadcast is not possible information-theoretically with the standard definition. We demonstrate the power of our new definition via a new connection to adaptively secure low-locality MPC, where distributional-THC enables parties to reuse a secret low-degree communication graph even in the face of adaptive corruptions