Spin-1/2 Bosonization on Compact Surfaces

We extend an existing Bose-Fermi equivalence formula to two-dimensional Euclidean space-times with arbitrary compact topology. The result relates the nonchiral Dirac partition function to that of a scalar field, times a theta function. The proof is a short application of methods from complex geometry and Quillen\u27s determinant constructions

Analytic curves in algebraic varieties over number fields

We establish algebraicity criteria for formal germs of curves in algebraic varieties over number fields and apply them to derive a rationality criterion for formal germs of functions, which extends the classical rationality theorems of Borel-Dwork and P\'olya-Bertrandias valid over the projective line to arbitrary algebraic curves over a number field. The formulation and the proof of these criteria involve some basic notions in Arakelov geometry, combined with complex and rigid analytic geometry (notably, potential theory over complex and $p$-adic curves). We also discuss geometric analogues, pertaining to the algebraic geometry of projective surfaces, of these arithmetic criteria.Comment: 55 pages. To appear in "Algebra, Arithmetic, and Geometry: In Honor of Y.i. Manin", Y. Tschinkel & Yu. Manin editors, Birkh\"auser, 200

Property (RD) for Hecke pairs

As the first step towards developing noncommutative geometry over Hecke C*-algebras, we study property (RD) (Rapid Decay) for Hecke pairs. When the subgroup H in a Hecke pair (G,H) is finite, we show that the Hecke pair (G,H) has (RD) if and only if G has (RD). This provides us with a family of examples of Hecke pairs with property (RD). We also adapt Paul Jolissant's works in 1989 to the setting of Hecke C*-algebras and show that when a Hecke pair (G,H) has property (RD), the algebra of rapidly decreasing functions on the set of double cosets is closed under holomorphic functional calculus of the associated (reduced) Hecke C*-algebra. Hence they have the same K_0-groups.Comment: A short note added explaining other methods to prove that the subalgebra of rapidly decreasing functions is smooth. This is the final version as published. The published version is available at: springer.co

The European Space Analogue Rock Collection (ESAR) at the OSUC-Orleans for in situ planetary missions

International audienceThe ESAR is a collection of well-characterised planetary analogue rocks and minerals that can be used for testing in situ instrumentation for planetary exploration. An online database of all relevant structural, compositional and geotechnics information is also available to the instrument teams and to aid data interpretation during missions

Bosonization in Arbitrary Genus

The equivalence is proved between fermionic and scalar field theories on Riemann surfaces of arbitrary topology. The effects of global topology include a modification of the bosonic action

Iterative Approximate Consensus in the presence of Byzantine Link Failures

This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are assumed to be fault-free. Recent work has addressed the problem of reaching approximate consen- sus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain only a small amount of memory across iterations [22, 21, 23, 12]. However, to the best of our knowledge, we are the first to consider approximate consensus in the presence of Byzan- tine links. We extend our past work that provided exact characterization of graphs in which the iterative approximate consensus problem in the presence of Byzantine node failures is solvable [22, 21]. In particular, we prove a tight necessary and sufficient condition on the underlying com- munication graph for the existence of iterative approximate consensus algorithms under transient Byzantine link model. The condition answers (part of) the open problem stated in [16].Comment: arXiv admin note: text overlap with arXiv:1202.609

A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms

Distributed algorithms have many mission-critical applications ranging from embedded systems and replicated databases to cloud computing. Due to asynchronous communication, process faults, or network failures, these algorithms are difficult to design and verify. Many algorithms achieve fault tolerance by using threshold guards that, for instance, ensure that a process waits until it has received an acknowledgment from a majority of its peers. Consequently, domain-specific languages for fault-tolerant distributed systems offer language support for threshold guards. We introduce an automated method for model checking of safety and liveness of threshold-guarded distributed algorithms in systems where the number of processes and the fraction of faulty processes are parameters. Our method is based on a short counterexample property: if a distributed algorithm violates a temporal specification (in a fragment of LTL), then there is a counterexample whose length is bounded and independent of the parameters. We prove this property by (i) characterizing executions depending on the structure of the temporal formula, and (ii) using commutativity of transitions to accelerate and shorten executions. We extended the ByMC toolset (Byzantine Model Checker) with our technique, and verified liveness and safety of 10 prominent fault-tolerant distributed algorithms, most of which were out of reach for existing techniques.Comment: 16 pages, 11 pages appendi

On Charge-3 Cyclic Monopoles

We determine the spectral curve of charge 3 BPS su(2) monopoles with C_3 cyclic symmetry. The symmetry means that the genus 4 spectral curve covers a (Toda) spectral curve of genus 2. A well adapted homology basis is presented enabling the theta functions and monopole data of the genus 4 curve to be given in terms of genus 2 data. The Richelot correspondence, a generalization of the arithmetic mean, is used to solve for this genus 2 curve. Results of other approaches are compared.Comment: 34 pages, 16 figures. Revision: Abstract added and a few small change

Stability conditions and positivity of invariants of fibrations

We study three methods that prove the positivity of a natural numerical invariant associated to $1-$parameter families of polarized varieties. All these methods involve different stability conditions. In dimension 2 we prove that there is a natural connection between them, related to a yet another stability condition, the linear stability. Finally we make some speculations and prove new results in higher dimension.Comment: Final version, to appear in the Springer volume dedicated to Klaus Hulek on the occasion of his 60-th birthda

Factor Varieties and Symbolic Computation

We propose an algebraization of classical and non-classical logics, based on factor varieties and decomposition operators. In particular, we provide a new method for determining whether a propositional formula is a tautology or a contradiction. This method can be autom-atized by defining a term rewriting system that enjoys confluence and strong normalization. This also suggests an original notion of logical gate and circuit, where propositional variables becomes logical gates and logical operations are implemented by substitution. Concerning formulas with quantifiers, we present a simple algorithm based on factor varieties for reducing first-order classical logic to equational logic. We achieve a completeness result for first-order classical logic without requiring any additional structure