BPS counting for knots and combinatorics on words

NASA Astrophysics Data System (ADS)

Kucharski, Piotr; Sułkowski, Piotr

2016-11-01

We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series. We construct combinatorial models whose structure is encoded in the form of such difference equations, and whose generating functions (Hilbert-Poincaré series) are solutions to those equations and reproduce generating series that encode BPS invariants. Furthermore, BPS invariants in question are expressed in terms of Lyndon words in an appropriate language, thereby relating counting of BPS states to the branch of mathematics referred to as combinatorics on words. We illustrate these results in the framework of colored extremal knot polynomials: among others we determine dual quantum extremal A-polynomials for various knots, present associated combinatorial models, find corresponding BPS invariants (extremal Labastida-Mariño-Ooguri-Vafa invariants) and discuss their integrality.

PREFACE: Counting Complexity: An international workshop on statistical mechanics and combinatorics

NASA Astrophysics Data System (ADS)

de Gier, Jan; Warnaar, Ole

2006-07-01

On 10-15 July 2005 the conference `Counting Complexity: An international workshop on statistical mechanics and combinatorics' was held on Dunk Island, Queensland, Australia in celebration of Tony Guttmann's 60th birthday. Dunk Island provided the perfect setting for engaging in almost all of Tony's life-long passions: swimming, running, food, wine and, of course, plenty of mathematics and physics. The conference was attended by many of Tony's close scientific friends from all over the world, and most talks were presented by his past and present collaborators. This volume contains the proceedings of the meeting and consists of 24 refereed research papers in the fields of statistical mechanics, condensed matter physics and combinatorics. These papers provide an excellent illustration of the breadth and scope of Tony's work. The very first contribution, written by Stu Whittington, contains an overview of the many scientific achievements of Tony over the past 40 years in mathematics and physics. The organizing committee, consisting of Richard Brak, Aleks Owczarek, Jan de Gier, Emma Lockwood, Andrew Rechnitzer and Ole Warnaar, gratefully acknowledges the Australian Mathematical Society (AustMS), the Australian Mathematical Sciences Institute (AMSI), the ARC Centre of Excellence for Mathematics and Statistics of Complex Systems (MASCOS), the ARC Complex Open Systems Research Network (COSNet), the Institute of Physics (IOP) and the Department of Mathematics and Statistics of The University of Melbourne for financial support in organizing the conference. Tony, we hope that your future years in mathematics will be numerous. Count yourself lucky! Tony Guttman

A Whirlwind Tour of Computational Geometry.

ERIC Educational Resources Information Center

Graham, Ron; Yao, Frances

1990-01-01

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)

Geometry and combinatorics of Julia sets of real quadratic maps

NASA Astrophysics Data System (ADS)

Barnsley, M. F.; Geronimo, J. S.; Harrington, A. N.

1984-10-01

For real λ a correspondence is made between the Julia set B λ for z→( z- λ)2, in the hyperbolic case, and the set of λ-chains λ±√(λ±√(λ±..., with the aid of Cremer's theorem. It is shown how a number of features of Bλ can be understood in terms of λ-chains. The structure of B λ is determined by certain equivalence classes of λ-chains, fixed by orders of visitation of certain real cycles; and the bifurcation history of a given cycle can be conveniently computed via the combinatorics of λ-chains. The functional equations obeyed by attractive cycles are investigated, and their relation to λ-chains is given. The first cascade of period-doubling bifurcations is described from the point of view of the associated Julia sets and λ-chains. Certain "Julia sets" associated with the Feigenbaum function and some theorems of Lanford are discussed.

Timing to Block Scanning Malwares by Using Combinatorics Proliferation Model

NASA Astrophysics Data System (ADS)

Omote, Kazumasa; Shimoyama, Takeshi; Torii, Satoru

One of the worst threats present in an enterprise network is the propagation of "scanning malware" (e.g., scanning worms and bots). It is important to prevent such scanning malware from spreading within an enterprise network. It is especially important to suppress scanning malware infection to less than a few infected hosts. We estimated the timing of containment software to block "scanning malware" in a homogeneous enterprise network. The "combinatorics proliferation model", based on discrete mathematics, developed in this study derives a threshold that gives the number of the packets sent by a victim that must not be exceeded in order to suppress the number of infected hosts to less than a few. This model can appropriately express the early state under which an infection started. The result from our model fits very well to the result of computer simulation using a typical existing scanning malware and an actual network.

Using Pinochle to motivate the restricted combinations with repetitions problem

NASA Astrophysics Data System (ADS)

Gorman, Patrick S.; Kunkel, Jeffrey D.; Vasko, Francis J.

2011-07-01

A standard example used in introductory combinatoric courses is to count the number of five-card poker hands possible from a straight deck of 52 distinct cards. A more interesting problem is to count the number of distinct hands possible from a Pinochle deck in which there are multiple, but obviously limited, copies of each type of card (two copies for single-deck, four for double deck). This problem is more interesting because our only concern is to count the number of distinguishable hands that can be dealt. In this note, under various scenarios, we will discuss two combinatoric techniques for counting these hands; namely, the inclusion-exclusion principle and generating functions. We will then show that these Pinochle examples motivate a general counting formula for what are called 'regular' combinations by Riordan. Finally, we prove the correctness of this formula using generating functions.

The Fibonacci Numbers.

ERIC Educational Resources Information Center

Onstad, Torgeir

1991-01-01

After a brief historical account of Leonardo Pisano Fibonacci, some basic results concerning the Fibonacci numbers are developed and proved, and entertaining examples are described. Connections are made between the Fibonacci numbers and the Golden Ratio, biological nature, and other combinatorics examples. (MDH)

Hopf-algebraic structure of combinatorial objects and differential operators

NASA Technical Reports Server (NTRS)

Grossman, Robert; Larson, Richard G.

1989-01-01

A Hopf-algebraic structure on a vector space which has as basis a family of trees is described. Some applications of this structure to combinatorics and to differential operators are surveyed. Some possible future directions for this work are indicated.

Exceptional collections in surface-like categories

NASA Astrophysics Data System (ADS)

Kuznetsov, A. G.

2017-09-01

We provide a categorical framework for recent results of Markus Perling's on the combinatorics of exceptional collections on numerically rational surfaces. Using it we simplify and generalize some of Perling's results as well as Vial's criterion for the existence of a numerical exceptional collection. Bibliography: 18 titles.

Integrating Formal and Grounded Representations in Combinatorics Learning

ERIC Educational Resources Information Center

Braithwaite, David W.; Goldstone, Robert L.

2013-01-01

The terms "concreteness fading" and "progressive formalization" have been used to describe instructional approaches to science and mathematics that use grounded representations to introduce concepts and later transition to more formal representations of the same concepts. There are both theoretical and empirical reasons to…

A Cryptological Way of Teaching Mathematics

ERIC Educational Resources Information Center

Caballero-Gil, Pino; Bruno-Castaneda, Carlos

2007-01-01

This work addresses the subject of mathematics education at secondary schools from a current and stimulating point of view intimately related to computational science. Cryptology is a captivating way of introducing into the classroom different mathematical subjects such as functions, matrices, modular arithmetic, combinatorics, equations,…

A Model of Students' Combinatorial Thinking

ERIC Educational Resources Information Center

Lockwood, Elise

2013-01-01

Combinatorial topics have become increasingly prevalent in K-12 and undergraduate curricula, yet research on combinatorics education indicates that students face difficulties when solving counting problems. The research community has not yet addressed students' ways of thinking at a level that facilitates deeper understanding of how students…

Survey of Neural Net Paradigms for Specification of Discrete Networks.

DTIC Science & Technology

1988-01-31

special applications, such as 3-d imaging, scene segmentation, temporal imaging models, nor phonological analysis of speech. The cost of problem...Nov. 1985. ., .U U - - A 1 Bibliography Berge, Claude, "Principles of Combinatorics", Academic Press, 1971 Fischer, Roland, " Deconstructing Reality

The International Mathematical Olympiad Training Session.

ERIC Educational Resources Information Center

Rousseau, Cecil; Patruno, Gregg

1985-01-01

The Mathematical Olympiad Training Session is designed to give United States students a problem-oriented exposure to subject areas (algebra, geometry, number theory, combinatorics, and inequalities) through an intensive three-week course. Techniques used during the session, with three sample problems and their solutions, are presented. (JN)

The Building Game: From Enumerative Combinatorics to Conformational Diffusion

NASA Astrophysics Data System (ADS)

Johnson-Chyzhykov, Daniel; Menon, Govind

2016-08-01

We study a discrete attachment model for the self-assembly of polyhedra called the building game. We investigate two distinct aspects of the model: (i) enumerative combinatorics of the intermediate states and (ii) a notion of Brownian motion for the polyhedral linkage defined by each intermediate that we term conformational diffusion. The combinatorial configuration space of the model is computed for the Platonic, Archimedean, and Catalan solids of up to 30 faces, and several novel enumerative results are generated. These represent the most exhaustive computations of this nature to date. We further extend the building game to include geometric information. The combinatorial structure of each intermediate yields a systems of constraints specifying a polyhedral linkage and its moduli space. We use a random walk to simulate a reflected Brownian motion in each moduli space. Empirical statistics of the random walk may be used to define the rates of transition for a Markov process modeling the process of self-assembly.

Charting the Replica Symmetric Phase

NASA Astrophysics Data System (ADS)

Coja-Oghlan, Amin; Efthymiou, Charilaos; Jaafari, Nor; Kang, Mihyun; Kapetanopoulos, Tobias

2018-02-01

Diluted mean-field models are spin systems whose geometry of interactions is induced by a sparse random graph or hypergraph. Such models play an eminent role in the statistical mechanics of disordered systems as well as in combinatorics and computer science. In a path-breaking paper based on the non-rigorous `cavity method', physicists predicted not only the existence of a replica symmetry breaking phase transition in such models but also sketched a detailed picture of the evolution of the Gibbs measure within the replica symmetric phase and its impact on important problems in combinatorics, computer science and physics (Krzakala et al. in Proc Natl Acad Sci 104:10318-10323, 2007). In this paper we rigorise this picture completely for a broad class of models, encompassing the Potts antiferromagnet on the random graph, the k-XORSAT model and the diluted k-spin model for even k. We also prove a conjecture about the detection problem in the stochastic block model that has received considerable attention (Decelle et al. in Phys Rev E 84:066106, 2011).

Synthetic Biomaterials to Rival Nature's Complexity-a Path Forward with Combinatorics, High-Throughput Discovery, and High-Content Analysis.

PubMed

Zhang, Douglas; Lee, Junmin; Kilian, Kristopher A

2017-10-01

Cells in tissue receive a host of soluble and insoluble signals in a context-dependent fashion, where integration of these cues through a complex network of signal transduction cascades will define a particular outcome. Biomaterials scientists and engineers are tasked with designing materials that can at least partially recreate this complex signaling milieu towards new materials for biomedical applications. In this progress report, recent advances in high throughput techniques and high content imaging approaches that are facilitating the discovery of efficacious biomaterials are described. From microarrays of synthetic polymers, peptides and full-length proteins, to designer cell culture systems that present multiple biophysical and biochemical cues in tandem, it is discussed how the integration of combinatorics with high content imaging and analysis is essential to extracting biologically meaningful information from large scale cellular screens to inform the design of next generation biomaterials. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Recent experience in simultaneous control-structure optimization

NASA Technical Reports Server (NTRS)

Salama, M.; Ramaker, R.; Milman, M.

1989-01-01

To show the feasibility of simultaneous optimization as design procedure, low order problems were used in conjunction with simple control formulations. The numerical results indicate that simultaneous optimization is not only feasible, but also advantageous. Such advantages come at the expense of introducing complexities beyond those encountered in structure optimization alone, or control optimization alone. Examples include: larger design parameter space, optimization may combine continuous and combinatoric variables, and the combined objective function may be nonconvex. Future extensions to include large order problems, more complex objective functions and constraints, and more sophisticated control formulations will require further research to ensure that the additional complexities do not outweigh the advantages of simultaneous optimization. Some areas requiring more efficient tools than currently available include: multiobjective criteria and nonconvex optimization. Efficient techniques to deal with optimization over combinatoric and continuous variables, and with truncation issues for structure and control parameters of both the model space as well as the design space need to be developed.

Cumulants, free cumulants and half-shuffles

PubMed Central

Ebrahimi-Fard, Kurusch; Patras, Frédéric

2015-01-01

Free cumulants were introduced as the proper analogue of classical cumulants in the theory of free probability. There is a mix of similarities and differences, when one considers the two families of cumulants. Whereas the combinatorics of classical cumulants is well expressed in terms of set partitions, that of free cumulants is described and often introduced in terms of non-crossing set partitions. The formal series approach to classical and free cumulants also largely differs. The purpose of this study is to put forward a different approach to these phenomena. Namely, we show that cumulants, whether classical or free, can be understood in terms of the algebra and combinatorics underlying commutative as well as non-commutative (half-)shuffles and (half-) unshuffles. As a corollary, cumulants and free cumulants can be characterized through linear fixed point equations. We study the exponential solutions of these linear fixed point equations, which display well the commutative, respectively non-commutative, character of classical and free cumulants. PMID:27547078

Simple vector bundles on a nodal Weierstrass cubic and quasi-trigonometric solutions of the classical Yang-Baxter equation

NASA Astrophysics Data System (ADS)

Burban, Igor; Galinat, Lennart; Stolin, Alexander

2017-11-01

In this paper we study the combinatorics of quasi-trigonometric solutions of the classical Yang-Baxter equation, arising from simple vector bundles on a nodal Weierstraß cubic. Dedicated to the memory of Petr Petrovich Kulish.

The Chess and Mathematics Connection: More than Just a Game

ERIC Educational Resources Information Center

Berkman, Robert M.

2004-01-01

This article describes connections between chess and mathematics, including examples of activities that connect chess with set theory, patterns, algebra, geometry, combinatorics, and Pascal's triangle. The author observes that competitive games play a dual purpose in advancing the work of mathematics educators: to reinforce a specific skill and to…

Enhancing Undergraduate Mathematics Curriculum via Coding Theory and Cryptography

ERIC Educational Resources Information Center

Aydin, Nuh

2009-01-01

The theory of error-correcting codes and cryptography are two relatively recent applications of mathematics to information and communication systems. The mathematical tools used in these fields generally come from algebra, elementary number theory, and combinatorics, including concepts from computational complexity. It is possible to introduce the…

Exploring Discrete Mathematics with American Football

ERIC Educational Resources Information Center

Muldoon Brown, Tricia; Kahn, Eric B.

2015-01-01

This paper presents an extended project that offers, through American football, an application of concepts from enumerative combinatorics and an introduction to proofs course. The questions in this paper and subsequent details concerning equivalence relations and counting techniques can be used to reinforce these new topics to students in such a…

Extension of Strongly Regular Graphs

DTIC Science & Technology

2008-02-11

E.R. van Dam, W.H. Haemers. Graphs with constant µ and µ. Discrete Math . 182 (1998), no. 1-3, 293–307. [11] E.R. van Dam, E. Spence. Small regular...graphs with four eigenvalues. Discrete Math . 189 (1998), 233-257. the electronic journal of combinatorics 15 (2008), #N3 5

On the Beauty of Mathematics as Exemplified by a Problem in Combinatorics.

ERIC Educational Resources Information Center

Dence, Thomas P.

1982-01-01

The beauty of discovering some simple yet elegant proof either to something new or to an already established fact is discussed. A combinatorial problem that deals with covering a checkerboard with dominoes is presented as a starting point for individual investigation of similar problems. (MP)

MEG Evidence for Incremental Sentence Composition in the Anterior Temporal Lobe

ERIC Educational Resources Information Center

Brennan, Jonathan R.; Pylkkänen, Liina

2017-01-01

Research investigating the brain basis of language comprehension has associated the left anterior temporal lobe (ATL) with sentence-level combinatorics. Using magnetoencephalography (MEG), we test the parsing strategy implemented in this brain region. The number of incremental parse steps from a predictive left-corner parsing strategy that is…

Taking Turns

ERIC Educational Resources Information Center

Hopkins, Brian

2010-01-01

Two people take turns selecting from an even number of items. Their relative preferences over the items can be described as a permutation, then tools from algebraic combinatorics can be used to answer various questions. We describe each person's optimal selection strategies including how each could make use of knowing the other's preferences. We…

Students' Problem Solving and Justification

ERIC Educational Resources Information Center

Glass, Barbara; Maher, Carolyn A.

2004-01-01

This paper reports on methods of students' justifications of their solution to a problem in the area of combinatorics. From the analysis of the problem solving of 150 students in a variety of settings from high-school to graduate study, four major forms of reasoning evolved: (1) Justification by Cases, (2) Inductive Argument, (3) Elimination…

A Generalization of "n Choose r"

ERIC Educational Resources Information Center

Skurnick, Ronald

2005-01-01

The subject matter presented in this article can be used in the classroom to enrich the learning experience of students taking a course that includes a unit on combinatorics, such as discrete mathematics, graph theory, or probability. In order to provide such students with the background needed to appreciate the significance of the generalization…

On the Delta Sequence of the Thue-Morse Sequence

DTIC Science & Technology

2007-02-27

S. Plouffe, B.E. Sagan, A relative of the Thue-Morse sequence, in For- mal power series and algebraic combinatorics (Montreal, PQ, 1992), Discrete ... Math . 139, 455–461, 1995. [2] J.-P. Allouche, J. Shallit, The ubiquitous Prouhet-Thue-Morse se- quence, In C. Ding, T. Helleseth,and H. Niederreiter

Fostering Recursive Thinking in Combinatorics through the Use of Manipulatives and Computing Technology.

ERIC Educational Resources Information Center

Abramovich, Sergei; Pieper, Anne

1996-01-01

Describes the use of manipulatives for solving simple combinatorial problems which can lead to the discovery of recurrence relations for permutations and combinations. Numerical evidence and visual imagery generated by a computer spreadsheet through modeling these relations can enable students to experience the ease and power of combinatorial…

Some Combinatorics of Multisets

ERIC Educational Resources Information Center

Singh, D.; Singh, J. N.

2003-01-01

The purpose of this paper is to delineate some insights into the concept of multisets along with a couple of combinatorial results related to multisets. The paper indicates that a general formula needs to be worked out for determining the cardinality of the "Set" (whose elements may be multisets but do not repeat) of all multisubsets of a finite…

Performance Assessment in Serious Games: Compensating for the Effects of Randomness

ERIC Educational Resources Information Center

Westera, Wim

2016-01-01

This paper is about performance assessment in serious games. We conceive serious gaming as a process of player-lead decision taking. Starting from combinatorics and item-response theory we provide an analytical model that makes explicit to what extent observed player performances (decisions) are blurred by chance processes (guessing behaviors). We…

Combinatorial Tasks and Outcome Listing: Examining Productive Listing among Undergraduate Students

ERIC Educational Resources Information Center

Lockwood, Elise; Gibson, Bryan R.

2016-01-01

Although counting problems are easy to state and provide rich, accessible problem-solving situations, there is much evidence that students struggle with solving counting problems correctly. With combinatorics (and the study of counting problems) becoming increasingly prevalent in K-12 and undergraduate curricula, there is a need for researchers to…

Paul Erdos

ERIC Educational Resources Information Center

Monroe, Helen; Scott, Paul

2004-01-01

This article presents a brief biography of Paul Erdos, who focused on problem-solving, particularly in the areas of number theory, combinatorics and graph theory. During his life he had no property, no family and no fixed address. He buttered his first piece of bread at age 21. He never cooked, nor ever drove a car. Another mathematician, Ron…

How Do Students' Behaviors Relate to the Growth of Their Mathematical Ideas?

ERIC Educational Resources Information Center

Warner, Lisa B.

2008-01-01

The purpose of this study is to analyze the relationship between student behaviors and the growth of mathematical ideas (using the Pirie-Kieren model). This analysis was accomplished through a series of case studies, involving middle school students of varying ability levels, who were investigating a combinatorics problem in after-school…

What is your neural function, visual narrative conjunction? Grammar, meaning, and fluency in sequential image processing.

PubMed

Cohn, Neil; Kutas, Marta

2017-01-01

Visual narratives sometimes depict successive images with different characters in the same physical space; corpus analysis has revealed that this occurs more often in Japanese manga than American comics. We used event-related brain potentials to determine whether comprehension of "visual narrative conjunctions" invokes not only incremental mental updating as traditionally assumed, but also, as we propose, "grammatical" combinatoric processing. We thus crossed (non)/conjunction sequences with character (in)/congruity. Conjunctions elicited a larger anterior negativity (300-500 ms) than nonconjunctions, regardless of congruity, implicating "grammatical" processes. Conjunction and incongruity both elicited larger P600s (500-700 ms), indexing updating. Both conjunction effects were modulated by participants' frequency of reading manga while growing up. Greater anterior negativity in frequent manga readers suggests more reliance on combinatoric processing; larger P600 effects in infrequent manga readers suggest more resources devoted to mental updating. As in language comprehension, it seems that processing conjunctions in visual narratives is not just mental updating but also partly grammatical, conditioned by comic readers' experience with specific visual narrative structures.

Communication: Spin densities within a unitary group based spin-adapted open-shell coupled-cluster theory: Analytic evaluation of isotropic hyperfine-coupling constants for the combinatoric open-shell coupled-cluster scheme

DOE Office of Scientific and Technical Information (OSTI.GOV)

Datta, Dipayan, E-mail: datta.dipayan@gmail.com; Gauss, Jürgen, E-mail: gauss@uni-mainz.de

We report analytical calculations of isotropic hyperfine-coupling constants in radicals using a spin-adapted open-shell coupled-cluster theory, namely, the unitary group based combinatoric open-shell coupled-cluster (COSCC) approach within the singles and doubles approximation. A scheme for the evaluation of the one-particle spin-density matrix required in these calculations is outlined within the spin-free formulation of the COSCC approach. In this scheme, the one-particle spin-density matrix for an open-shell state with spin S and M{sub S} = + S is expressed in terms of the one- and two-particle spin-free (charge) density matrices obtained from the Lagrangian formulation that is used for calculating themore » analytic first derivatives of the energy. Benchmark calculations are presented for NO, NCO, CH{sub 2}CN, and two conjugated π-radicals, viz., allyl and 1-pyrrolyl in order to demonstrate the performance of the proposed scheme.« less

The Use of Visual Approach in Teaching and Learning the Epsilon-Delta Definition of Continuity

ERIC Educational Resources Information Center

Pešic, Duška; Pešic, Aleksandar

2015-01-01

In this paper we introduce a new collaborative technique in teaching and learning the epsilon-delta definition of a continuous function at the point from its domain, which connects mathematical logic, combinatorics and calculus. This collaborative approach provides an opportunity for mathematical high school students to engage in mathematical…

An Onto-Semiotic Analysis of Combinatorial Problems and the Solving Processes by University Students

ERIC Educational Resources Information Center

Godino, Juan D.; Batanero, Carmen; Roa, Rafael

2005-01-01

In this paper we describe an ontological and semiotic model for mathematical knowledge, using elementary combinatorics as an example. We then apply this model to analyze the solving process of some combinatorial problems by students with high mathematical training, and show its utility in providing a semiotic explanation for the difficulty of…

Come on Down ... The Prize Is Right in Your Classroom

ERIC Educational Resources Information Center

Butterworth, William T.; Coe, Paul R.

2004-01-01

"The Price is Right" ("TPIR") is a rich source of examples of applied probability, combinatorics, and game theory. While some of the games played on stage by individual contestants stress a knowledge of pricing, many are also heavily based on probability. "TPIR" stage games are a treasury of interesting modules that can be effective learning tools…

A Dynamic Intranet-Based Online-Portal Support for Computer Science Teaching

ERIC Educational Resources Information Center

Iyer, Viswanathan K.

2017-01-01

This paper addresses the issue of effective content-delivery of Computer Science subjects taking advantage of a university intranet. The proposal described herein for teaching a subject like Combinatorics and Graph Theory (CGT) is to supplement lectures with a moderated online forum against an associated intranet portal, which is referred to as a…

A Compact Formula for Rotations as Spin Matrix Polynomials

DOE PAGES

Curtright, Thomas L.; Fairlie, David B.; Zachos, Cosmas K.

2014-08-12

Group elements of SU(2) are expressed in closed form as finite polynomials of the Lie algebra generators, for all definite spin representations of the rotation group. Here, the simple explicit result exhibits connections between group theory, combinatorics, and Fourier analysis, especially in the large spin limit. Salient intuitive features of the formula are illustrated and discussed.

Combinatorial solutions to integrable hierarchies

NASA Astrophysics Data System (ADS)

Kazarian, M. E.; Lando, S. K.

2015-06-01

This paper reviews modern approaches to the construction of formal solutions to integrable hierarchies of mathematical physics whose coefficients are answers to various enumerative problems. The relationship between these approaches and the combinatorics of symmetric groups and their representations is explained. Applications of the results to the construction of efficient computations in problems related to models of quantum field theories are described. Bibliography: 34 titles.

Accounting in the Social Menu

ERIC Educational Resources Information Center

González, José Villacís

2010-01-01

This paper was born out of combinatorics. It defines a level of utility which, though it cannot be measured, can be preferred to another in each specific combination of goods. In turn, each combination defines a menu, meaning that there will be as many menus as there are combinations of goods. In this manner, we have a menu and a utility for each…

A Quantitative and Combinatorial Approach to Non-Linear Meanings of Multiplication

ERIC Educational Resources Information Center

Tillema, Erik; Gatza, Andrew

2016-01-01

We provide a conceptual analysis of how combinatorics problems have the potential to support students to establish non-linear meanings of multiplication (NLMM). The problems we analyze we have used in a series of studies with 6th, 8th, and 10th grade students. We situate the analysis in prior work on students' quantitative and multiplicative…

Using Pinochle to Motivate the Restricted Combinations with Repetitions Problem

ERIC Educational Resources Information Center

Gorman, Patrick S.; Kunkel, Jeffrey D.; Vasko, Francis J.

2011-01-01

A standard example used in introductory combinatoric courses is to count the number of five-card poker hands possible from a straight deck of 52 distinct cards. A more interesting problem is to count the number of distinct hands possible from a Pinochle deck in which there are multiple, but obviously limited, copies of each type of card (two…

Electrophysiological evidence for the morpheme-based combinatoric processing of English compounds

PubMed Central

Fiorentino, Robert; Naito-Billen, Yuka; Bost, Jamie; Fund-Reznicek, Ella

2014-01-01

The extent to which the processing of compounds (e.g., “catfish”) makes recourse to morphological-level representations remains a matter of debate. Moreover, positing a morpheme-level route to complex word recognition entails not only access to morphological constituents, but also combinatoric processes operating on the constituent representations; however, the neurophysiological mechanisms subserving decomposition, and in particular morpheme combination, have yet to be fully elucidated. The current study presents electrophysiological evidence for the morpheme-based processing of both lexicalized (e.g., “teacup”) and novel (e.g., “tombnote”) visually-presented English compounds; these brain responses appear prior to and are dissociable from the eventual overt lexical decision response. The electrophysiological results reveal increased negativities for conditions with compound structure, including effects shared by lexicalized and novel compounds, as well as effects unique to each compound type, which may be related to aspects of morpheme combination. These findings support models positing across-the-board morphological decomposition, counter to models proposing that putatively complex words are primarily or solely processed as undecomposed representations, and motivate further electrophysiological research toward a more precise characterization of the nature and neurophysiological instantiation of complex word recognition. PMID:24279696

Students’ metacognitive activities in solving the combinatorics problem: the experience of students with holist-serialist cognitive style

NASA Astrophysics Data System (ADS)

Trisna, B. N.; Budayasa, I. K.; Siswono, T. Y. E.

2018-01-01

Metacognition is related to improving student learning outcomes. This study describes students’ metacognitive activities in solving the combinatorics problem. Two undergraduate students of mathematics education from STKIP PGRI Banjarmasin were selected as the participants of the study, one person has a holist cognitive style and the other a serialist. Data were collected by task-based interviews where the task contains a combinatorial problem. The interviews were conducted twice using equivalent problem at two different times. The study found that the participants showed metacognitive awareness (A), metacognitive evaluation (E), and metacognitive regulation (R) that operated as pathways from one function to another. Both, holist and serialist, have metacognitive activities in different pathway. The path of metacognitive activities of the holist is AERCAE-AAEER-ACRECCECC-AREERCE with the AERAE-AER-ARE-ARERE pattern, while the path of metacognitive activities of the serialist is AERCA-AAER-ACRERCERC-AREEEE with the AERA-AER-ARERER-ARE pattern. As an implication of these findings, teachers/lecturers need to pay attention to metacognitive awareness when they begin a stage in mathematical problem solving. Teachers/lecturers need to emphasize to students that in mathematical problem solving, processes and results are equally important.

Search and Pursuit with Unmanned Aerial Vehicles in Road Networks

DTIC Science & Technology

2013-11-01

production volume in each area for use in consumer electronics. Simultaneously, a shift in defense strategy towards unmanned vehicles, particularly...Vöcking. Randomized pursuit-evasion in graphs. Combinatorics, Probability and Computing, 12:225–244, May 2003. [3] AeroVironment Inc. Raven Product Data...Ali and Mubarak Shah. COCOA - tracking in aerial imagery. In SPIE Airborne Intelligence, Surveillance, Reconnaissance Systems and Applications, 2006

A Domain-Specific Language for Discrete Mathematics

NASA Astrophysics Data System (ADS)

Jha, Rohit; Samuel, Alfy; Pawar, Ashmee; Kiruthika, M.

2013-05-01

This paper discusses a Domain Specific Language (DSL) that has been developed to enable implementation of concepts of discrete mathematics. A library of data types and functions provides functionality which is frequently required by users. Covering the areas of Mathematical Logic, Set Theory, Functions, Graph Theory, Number Theory, Linear Algebra and Combinatorics, the language's syntax is close to the actual notation used in the specific fields.

The Packing Property

DTIC Science & Technology

2000-11-01

Discrete Math . 115, 141-152. [7] Edmonds J., Giles R. (1977) A Min-Max relation for submodular functions on graphs, Annals of Discrete Math . 1, 185...projective planes, handwritten man- uscript, published: (1990) Polyhedral Combinatorics (W. Cook, P.D. Seymour eds.), DIMACS Series in Discrete Math . and...Theoretical Computer Science 1, 101-105. [11] Lovasz L. (1972) Normal hypergraphs and the perfect graph conjecture, Discrete Math . 2, 253-267. [12

Scattering theory for graphs isomorphic to a regular tree at infinity

NASA Astrophysics Data System (ADS)

Colin de Verdière, Yves; Truc, Françoise

2013-06-01

We describe the spectral theory of the adjacency operator of a graph which is isomorphic to a regular tree at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the adjacency operator on a regular tree. We develop this scattering theory using the classical recipes for Schrödinger operators in Euclidian spaces.

Decoding of exon splicing patterns in the human RUNX1-RUNX1T1 fusion gene.

PubMed

Grinev, Vasily V; Migas, Alexandr A; Kirsanava, Aksana D; Mishkova, Olga A; Siomava, Natalia; Ramanouskaya, Tatiana V; Vaitsiankova, Alina V; Ilyushonak, Ilia M; Nazarov, Petr V; Vallar, Laurent; Aleinikova, Olga V

2015-11-01

The t(8;21) translocation is the most widespread genetic defect found in human acute myeloid leukemia. This translocation results in the RUNX1-RUNX1T1 fusion gene that produces a wide variety of alternative transcripts and influences the course of the disease. The rules of combinatorics and splicing of exons in the RUNX1-RUNX1T1 transcripts are not known. To address this issue, we developed an exon graph model of the fusion gene organization and evaluated its local exon combinatorics by the exon combinatorial index (ECI). Here we show that the local exon combinatorics of the RUNX1-RUNX1T1 gene follows a power-law behavior and (i) the vast majority of exons has a low ECI, (ii) only a small part is represented by "exons-hubs" of splicing with very high ECI values, and (iii) it is scale-free and very sensitive to targeted skipping of "exons-hubs". Stochasticity of the splicing machinery and preferred usage of exons in alternative splicing can explain such behavior of the system. Stochasticity may explain up to 12% of the ECI variance and results in a number of non-coding and unproductive transcripts that can be considered as a noise. Half-life of these transcripts is increased due to the deregulation of some key genes of the nonsense-mediated decay system in leukemia cells. On the other hand, preferred usage of exons may explain up to 75% of the ECI variability. Our analysis revealed a set of splicing-related cis-regulatory motifs that can explain "attractiveness" of exons in alternative splicing but only when they are considered together. Cis-regulatory motifs are guides for splicing trans-factors and we observed a leukemia-specific profile of expression of the splicing genes in t(8;21)-positive blasts. Altogether, our results show that alternative splicing of the RUNX1-RUNX1T1 transcripts follows strict rules and that the power-law component of the fusion gene organization confers a high flexibility to this process. Copyright © 2015 Elsevier Ltd. All rights reserved.

Determining distinct circuit in complete graphs using permutation

NASA Astrophysics Data System (ADS)

Karim, Sharmila; Ibrahim, Haslinda; Darus, Maizon Mohd

2017-11-01

A Half Butterfly Method (HBM) is a method introduced to construct the distinct circuits in complete graphs where used the concept of isomorphism. The Half Butterfly Method was applied in the field of combinatorics such as in listing permutations of n elements. However the method of determining distinct circuit using HBM for n > 4 is become tedious. Thus, in this paper, we present the method of generating distinct circuit using permutation.

Combinatorics and Probability: Six- to Ten-Year-Olds Reliably Predict Whether a Relation Will Occur

ERIC Educational Resources Information Center

Gonzalez, Michel; Girotto, Vittorio

2011-01-01

Young children are able to judge which of two possibilities is more likely to occur when these possibilities are characterized by a simple property, like color ("Is it more likely to draw a red chip or a blue chip?"). Here we ask whether they can do so when the possibilities concern a relation between simple properties ("Is it more likely to draw…

Energy Landscapes for the Self-Assembly of Supramolecular Polyhedra

NASA Astrophysics Data System (ADS)

Russell, Emily R.; Menon, Govind

2016-06-01

We develop a mathematical model for the energy landscape of polyhedral supramolecular cages recently synthesized by self-assembly (Sun et al. in Science 328:1144-1147, 2010). Our model includes two essential features of the experiment: (1) geometry of the organic ligands and metallic ions; and (2) combinatorics. The molecular geometry is used to introduce an energy that favors square-planar vertices (modeling {Pd}^{2+} ions) and bent edges with one of two preferred opening angles (modeling boomerang-shaped ligands of two types). The combinatorics of the model involve two-colorings of edges of polyhedra with four-valent vertices. The set of such two-colorings, quotiented by the octahedral symmetry group, has a natural graph structure and is called the combinatorial configuration space. The energy landscape of our model is the energy of each state in the combinatorial configuration space. The challenge in the computation of the energy landscape is a combinatorial explosion in the number of two-colorings of edges. We describe sampling methods based on the symmetries of the configurations and connectivity of the configuration graph. When the two preferred opening angles encompass the geometrically ideal angle, the energy landscape exhibits a very low-energy minimum for the most symmetric configuration at equal mixing of the two angles, even when the average opening angle does not match the ideal angle.

Teaching Math More Effectively, Through the Design of Calculational Proofs.

DTIC Science & Technology

1994-03-01

typically taught in a first discrete math course -e.g. set theory, mathematical induction, a theory of integers, finc- tions and relations, combinatorics...by all who want to teach mathematics effectively. 4 4 The authors’ 500-pape text A Logical Approach to Discrete Math (Springer Verlag NY, 1993) uses...the appr,.., h described in this article in teaching the usual topics in discrete math -logic, set theory, & theory of integers, induct,., functions

Linear Chord Diagrams with Long Chords

NASA Astrophysics Data System (ADS)

Sullivan, Everett

A linear chord diagram of size n is a partition of the first 2n integers into sets of size two. These diagrams appear in many different contexts in combinatorics and other areas of mathematics, particularly knot theory. We explore various constraints that produce diagrams which have no short chords. A number of patterns appear from the results of these constraints which we can prove using techniques ranging from explicit bijections to non-commutative algebra.

R A Fisher, design theory, and the Indian connection.

PubMed

Rau, A R P

2009-09-01

Design Theory, a branch of mathematics, was born out of the experimental statistics research of the population geneticist R A Fisher and of Indian mathematical statisticians in the 1930s. The field combines elements of combinatorics, finite projective geometries, Latin squares, and a variety of further mathematical structures, brought together in surprising ways. This essay will present these structures and ideas as well as how the field came together, in itself an interesting story.

Stochastic Control Theory, Nonlinear Structural Mechanics and Applied Combinatorics

DTIC Science & Technology

1989-05-12

University LONG-TER11I VISITORS IN RESIDENCE One Month or More Assmus, Edward Lehigh University May I - Jun 30 Averbuch, Amir Tel Aviv University Jun 26 - Aug...Bryn Mawr May 1 - Jun 25 Lemke, Paul Rensselaer Polytechnic Institute Sep 14 - Jun 25 Lin, Shao-Shiung National Taiwan University Jun 15 - Aug 30 van ...25 Job, Vanessa University of Illinois, Chicago Jun 13 - 25 Jungnickel, D. Justus-Liebig University May 29 - Jun 24 Kacker, Raghu National Bureau

Claw-Free Maximal Planar Graphs

DTIC Science & Technology

1989-01-01

1976, 212-223. 110] M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. 1111 , A theorem on matchings in the plane, Graph Theory...in Memory of G.A. Dirac, Ann. Discrete Math . 41, North-Holland, Amsterdam, 1989, 347-354. 1121 N. Sbihi, Algorithme de recherche d’un stable de...cardinalitA maximum dans un graphe sans 6toile, Discrete Math . 29, 1980, 53-76. 1131 D. Sumner, On Tutte’s factorization theorem, Graphs and Combinatorics

Search for charmless hadronic decays of B mesons with the SLAC SLD detector

NASA Astrophysics Data System (ADS)

Abe, Kenji; Abe, Koya; Abe, T.; Adam, I.; Akagi, T.; Akimoto, H.; Allen, N. J.; Ash, W. W.; Aston, D.; Baird, K. G.; Baltay, C.; Band, H. R.; Barakat, M. B.; Bardon, O.; Barklow, T. L.; Bashindzhagyan, G. L.; Bauer, J. M.; Bellodi, G.; Benvenuti, A. C.; Bilei, G. M.; Bisello, D.; Blaylock, G.; Bogart, J. R.; Bower, G. R.; Brau, J. E.; Breidenbach, M.; Bugg, W. M.; Burke, D.; Burnett, T. H.; Burrows, P. N.; Byrne, R. M.; Calcaterra, A.; Calloway, D.; Camanzi, B.; Carpinelli, M.; Cassell, R.; Castaldi, R.; Castro, A.; Cavalli-Sforza, M.; Chou, A.; Church, E.; Cohn, H. O.; Coller, J. A.; Convery, M. R.; Cook, V.; Cowan, R. F.; Coyne, D. G.; Crawford, G.; Damerell, C. J.; Danielson, M. N.; Daoudi, M.; de Groot, N.; dell'orso, R.; Dervan, P. J.; de Sangro, R.; Dima, M.; Dong, D. N.; Doser, M.; Dubois, R.; Eisenstein, B. I.; Erofeeva, I.; Eschenburg, V.; Etzion, E.; Fahey, S.; Falciai, D.; Fan, C.; Fernandez, J. P.; Fero, M. J.; Flood, K.; Frey, R.; Gifford, J.; Gillman, T.; Gladding, G.; Gonzalez, S.; Goodman, E. R.; Hart, E. L.; Harton, J. L.; Hasuko, K.; Hedges, S. J.; Hertzbach, S. S.; Hildreth, M. D.; Huber, J.; Huffer, M. E.; Hughes, E. W.; Huynh, X.; Hwang, H.; Iwasaki, M.; Jackson, D. J.; Jacques, P.; Jaros, J. A.; Jiang, Z. Y.; Johnson, A. S.; Johnson, J. R.; Johnson, R. A.; Junk, T.; Kajikawa, R.; Kalelkar, M.; Kamyshkov, Y.; Kang, H. J.; Karliner, I.; Kawahara, H.; Kim, Y. D.; King, M. E.; King, R.; Kofler, R. R.; Krishna, N. M.; Kroeger, R. S.; Langston, M.; Lath, A.; Leith, D. W.; Lia, V.; Lin, C.; Liu, M. X.; Liu, X.; Loreti, M.; Lu, A.; Lynch, H. L.; Ma, J.; Mahjouri, M.; Mancinelli, G.; Manly, S.; Mantovani, G.; Markiewicz, T. W.; Maruyama, T.; Masuda, H.; Mazzucato, E.; McKemey, A. K.; Meadows, B. T.; Menegatti, G.; Messner, R.; Mockett, P. M.; Moffeit, K. C.; Moore, T. B.; Morii, M.; Muller, D.; Murzin, V.; Nagamine, T.; Narita, S.; Nauenberg, U.; Neal, H.; Nussbaum, M.; Oishi, N.; Onoprienko, D.; Osborne, L. S.; Panvini, R. S.; Park, C. H.; Pavel, T. J.; Peruzzi, I.; Piccolo, M.; Piemontese, L.; Pitts, K. T.; Plano, R. J.; Prepost, R.; Prescott, C. Y.; Punkar, G. D.; Quigley, J.; Ratcliff, B. N.; Reeves, T. W.; Reidy, J.; Reinertsen, P. L.; Rensing, P. E.; Rochester, L. S.; Rowson, P. C.; Russell, J. J.; Saxton, O. H.; Schalk, T.; Schindler, R. H.; Schumm, B. A.; Schwiening, J.; Sen, S.; Serbo, V. V.; Shaevitz, M. H.; Shank, J. T.; Shapiro, G.; Sherden, D. J.; Shmakov, K. D.; Simopoulos, C.; Sinev, N. B.; Smith, S. R.; Smy, M. B.; Snyder, J. A.; Staengle, H.; Stahl, A.; Stamer, P.; Steiner, H.; Steiner, R.; Strauss, M. G.; Su, D.; Suekane, F.; Sugiyama, A.; Suzuki, S.; Swartz, M.; Szumilo, A.; Takahashi, T.; Taylor, F. E.; Thom, J.; Torrence, E.; Toumbas, N. K.; Usher, T.; Vannini, C.; Va'vra, J.; Vella, E.; Venuti, J. P.; Verdier, R.; Verdini, P. G.; Wagner, D. L.; Wagner, S. R.; Waite, A. P.; Walston, S.; Watts, S. J.; Weidemann, A. W.; Weiss, E. R.; Whitaker, J. S.; White, S. L.; Wickens, F. J.; Williams, B.; Williams, D. C.; Williams, S. H.; Willocq, S.; Wilson, R. J.; Wisniewski, W. J.; Wittlin, J. L.; Woods, M.; Word, G. B.; Wright, T. R.; Wyss, J.; Yamamoto, R. K.; Yamartino, J. M.; Yang, X.; Yashima, J.; Yellin, S. J.; Young, C. C.; Yuta, H.; Zapalac, G.; Zdarko, R. W.; Zhou, J.

2000-10-01

Based on a sample of approximately 500 000 hadronic Z0 decays accumulated between 1993 and 1998, the SLD experiment has set limits on 24 fully charged two-body and quasi-two-body exclusive charmless hadronic decays of B+, B0, and B0s mesons. The precise tracking capabilities of the SLD detector provided for the efficient reduction of combinatoric backgrounds, yielding the most precise available limits for ten of these modes.

Toric Networks, Geometric R-Matrices and Generalized Discrete Toda Lattices

NASA Astrophysics Data System (ADS)

Inoue, Rei; Lam, Thomas; Pylyavskyy, Pavlo

2016-11-01

We use the combinatorics of toric networks and the double affine geometric R-matrix to define a three-parameter family of generalizations of the discrete Toda lattice. We construct the integrals of motion and a spectral map for this system. The family of commuting time evolutions arising from the action of the R-matrix is explicitly linearized on the Jacobian of the spectral curve. The solution to the initial value problem is constructed using Riemann theta functions.

Inverse Scattering and Applications. Proceedings of Conference on Inverse Scattering on the Line, Held in Amherst, Massachusetts on June 7 - 13, 1990

DTIC Science & Technology

1990-01-01

J. Laurie Snell S. A. Amitsur, D. J. Saltman, and 2 Proceedings of the conference on G. B. Seligman , Editors integration, topology, and geometry in...Rational constructions of modules 17 Nonlinear partial differential equations. for simple Lie algebras, George B. Joel A. Smoller, Editor Seligman 18...number theory, Michael R. Stein and Linda Keen, Editor R. Keith Dennis, Editors 65 Logic and combinatorics, Stephen G. 84 Partition problems in

Higher-order neural networks, Polyà polynomials, and Fermi cluster diagrams

NASA Astrophysics Data System (ADS)

Kürten, K. E.; Clark, J. W.

2003-09-01

The problem of controlling higher-order interactions in neural networks is addressed with techniques commonly applied in the cluster analysis of quantum many-particle systems. For multineuron synaptic weights chosen according to a straightforward extension of the standard Hebbian learning rule, we show that higher-order contributions to the stimulus felt by a given neuron can be readily evaluated via Polyà’s combinatoric group-theoretical approach or equivalently by exploiting a precise formal analogy with fermion diagrammatics.

The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems

NASA Astrophysics Data System (ADS)

Raigorodskii, Andrei M.; Shabanov, Dmitrii A.

2011-10-01

Extremal problems concerned with hypergraph colouring first arose in connection with classical investigations in the 1920-30s which gave rise to Ramsey theory. Since then, this area has assumed a central position in extremal combinatorics. This survey is devoted to one well-known problem of hypergraph colouring, the Erdős-Hajnal problem, initially posed in 1961. It opened a line of research in hypergraph theory whose methods and results are widely used in various domains of discrete mathematics. Bibliography: 109 titles.

Combinatorics associated with inflections and bitangents of plane quartics

NASA Astrophysics Data System (ADS)

Gizatullin, M. Kh

2013-08-01

After a preliminary survey and a description of some small Steiner systems from the standpoint of the theory of invariants of binary forms, we construct a binary Golay code (of length 24) using ideas from J. Grassmann's thesis of 1875. One of our tools is a pair of disjoint Fano planes. Another application of such pairs and properties of plane quartics is a construction of a new block design on 28 objects. This block design is a part of a dissection of the set of 288 Aronhold sevens. The dissection distributes the Aronhold sevens into 8 disjoint block designs of this type.

Diagnostic tolerance for missing sensor data

NASA Technical Reports Server (NTRS)

Scarl, Ethan A.

1989-01-01

For practical automated diagnostic systems to continue functioning after failure, they must not only be able to diagnose sensor failures but also be able to tolerate the absence of data from the faulty sensors. It is shown that conventional (associational) diagnostic methods will have combinatoric problems when trying to isolate faulty sensors, even if they adequately diagnose other components. Moreover, attempts to extend the operation of diagnostic capability past sensor failure will necessarily compound those difficulties. Model-based reasoning offers a structured alternative that has no special problems diagnosing faulty sensors and can operate gracefully when sensor data is missing.

Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees

PubMed Central

Bronson, Jonathan; Levine, Joshua A.; Whitaker, Ross

2014-01-01

We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach. PMID:24356365

The Construction of a Pedagogy to Promote Meaningful Learning of Strategies and Tactics for Solving Problems of Elementary Combinatorics.

DTIC Science & Technology

1987-09-01

ELECTE ~OF 4 JAN 2 5 1MOU Approved fcr pu;i)lic re k-x ’ z Distri-Lb.ilion U-l-i. [-; Dt iUDEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE...expressed in the document are those of the author and do not necessarily reflect the views of the School of Systems and Logistics, the Air University ...the School of Systems and Logistics of the Air Force Institute of Technology Air University In Partial Fulfillment of the Requirements for the Degree

Capelli bitableaux and Z-forms of general linear Lie superalgebras.

PubMed Central

Brini, A; Teolis, A G

1990-01-01

The combinatorics of the enveloping algebra UQ(pl(L)) of the general linear Lie superalgebra of a finite dimensional Z2-graded Q-vector space is studied. Three non-equivalent Z-forms of UQ(pl(L)) are introduced: one of these Z-forms is a version of the Kostant Z-form and the others are Lie algebra analogs of Rota and Stein's straightening formulae for the supersymmetric algebra Super[L P] and for its dual Super[L* P*]. The method is based on an extension of Capelli's technique of variabili ausiliarie to algebras containing positively and negatively signed elements. PMID:11607048

Oriented matroids—combinatorial structures underlying loop quantum gravity

NASA Astrophysics Data System (ADS)

Brunnemann, Johannes; Rideout, David

2010-10-01

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator (Ashtekar A and Lewandowski J 1998 Adv. Theor. Math. Phys. 1 388) in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence vertices of a graph in three-dimensional Riemannian space and can be represented by sign strings containing relative orientations of embedded edges. We demonstrate that these signature factors are a special representation of the general mathematical concept of an oriented matroid (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)). Moreover, we show that oriented matroids can also be used to describe the topology (connectedness) of directed graphs. Hence, the mathematical methods developed for oriented matroids can be applied to the difficult combinatorics of embedded graphs underlying the construction of LQG. As a first application we revisit the analysis of Brunnemann and Rideout (2008 Class. Quantum Grav. 25 065001 and 065002), and find that enumeration of all possible sign configurations used there is equivalent to enumerating all realizable oriented matroids of rank 3 (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)), and thus can be greatly simplified. We find that for 7-valent vertices having no coplanar triples of edge tangents, the smallest non-zero eigenvalue of the volume spectrum does not grow as one increases the maximum spin jmax at the vertex, for any orientation of the edge tangents. This indicates that, in contrast to the area operator, considering large jmax does not necessarily imply large volume eigenvalues. In addition we give an outlook to possible starting points for rewriting the combinatorics of LQG in terms of oriented matroids.

A New Proof of the Expected Frequency Spectrum under the Standard Neutral Model.

PubMed

Hudson, Richard R

2015-01-01

The sample frequency spectrum is an informative and frequently employed approach for summarizing DNA variation data. Under the standard neutral model the expectation of the sample frequency spectrum has been derived by at least two distinct approaches. One relies on using results from diffusion approximations to the Wright-Fisher Model. The other is based on Pólya urn models that correspond to the standard coalescent model. A new proof of the expected frequency spectrum is presented here. It is a proof by induction and does not require diffusion results and does not require the somewhat complex sums and combinatorics of the derivations based on urn models.

Dannie Heineman Prize for Mathematical Physics Prize Lecture: Correlation Functions in Integrable Models II: The Role of Quantum Affine Symmetry

NASA Astrophysics Data System (ADS)

Jimbo, Michio

2013-03-01

Since the beginning of 1980s, hidden infinite dimensional symmetries have emerged as the origin of integrability: first in soliton theory and then in conformal field theory. Quest for symmetries in quantum integrable models has led to the discovery of quantum groups. On one hand this opened up rapid mathematical developments in representation theory, combinatorics and other fields. On the other hand it has advanced understanding of correlation functions of lattice models, leading to multiple integral formulas in integrable spin chains. We shall review these developments which continue up to the present time.

The Combinatorics of Local Constraints in Model-Based Recognition and Localization,

DTIC Science & Technology

1984-04-01

InCn ted alo0ng! th le 1111;i nor nria. T[hus, a secornd sensory point can 1,e cli aractcr: it’o ti this spare ’)N ;a uni~t vector in offset by some...number of independent constraints, defining the swept volume IVu,,ne! then the expec ted bound on the number of interpretations for k ± 1 sensory points...t It ll r I to our oart icu r c:1,:CCC;i ’erivv -xplicrt xpe(’ ted Counts Cit the or2 f C .Tlterpret at ons conitiro \\\\2tli ~ ’CCF pOilnts, 1C C I)YI

Combinatorics of Generalized Bethe Equations

NASA Astrophysics Data System (ADS)

Kozlowski, Karol K.; Sklyanin, Evgeny K.

2013-10-01

A generalization of the Bethe ansatz equations is studied, where a scalar two-particle S-matrix has several zeroes and poles in the complex plane, as opposed to the ordinary single pole/zero case. For the repulsive case (no complex roots), the main result is the enumeration of all distinct solutions to the Bethe equations in terms of the Fuss-Catalan numbers. Two new combinatorial interpretations of the Fuss-Catalan and related numbers are obtained. On the one hand, they count regular orbits of the permutation group in certain factor modules over {{Z}^M}, and on the other hand, they count integer points in certain M-dimensional polytopes.

Dimensional regularization in position space and a Forest Formula for Epstein-Glaser renormalization

NASA Astrophysics Data System (ADS)

Dütsch, Michael; Fredenhagen, Klaus; Keller, Kai Johannes; Rejzner, Katarzyna

2014-12-01

We reformulate dimensional regularization as a regularization method in position space and show that it can be used to give a closed expression for the renormalized time-ordered products as solutions to the induction scheme of Epstein-Glaser. This closed expression, which we call the Epstein-Glaser Forest Formula, is analogous to Zimmermann's Forest Formula for BPH renormalization. For scalar fields, the resulting renormalization method is always applicable, we compute several examples. We also analyze the Hopf algebraic aspects of the combinatorics. Our starting point is the Main Theorem of Renormalization of Stora and Popineau and the arising renormalization group as originally defined by Stückelberg and Petermann.

Undergraduate students' initial conceptions of factorials

NASA Astrophysics Data System (ADS)

Lockwood, Elise; Erickson, Sarah

2017-05-01

Counting problems offer rich opportunities for students to engage in mathematical thinking, but they can be difficult for students to solve. In this paper, we present a study that examines student thinking about one concept within counting, factorials, which are a key aspect of many combinatorial ideas. In an effort to better understand students' conceptions of factorials, we conducted interviews with 20 undergraduate students. We present a key distinction between computational versus combinatorial conceptions, and we explore three aspects of data that shed light on students' conceptions (their initial characterizations, their definitions of 0!, and their responses to Likert-response questions). We present implications this may have for mathematics educators both within and separate from combinatorics.

Neurobiological roots of language in primate audition: common computational properties.

PubMed

Bornkessel-Schlesewsky, Ina; Schlesewsky, Matthias; Small, Steven L; Rauschecker, Josef P

2015-03-01

Here, we present a new perspective on an old question: how does the neurobiology of human language relate to brain systems in nonhuman primates? We argue that higher-order language combinatorics, including sentence and discourse processing, can be situated in a unified, cross-species dorsal-ventral streams architecture for higher auditory processing, and that the functions of the dorsal and ventral streams in higher-order language processing can be grounded in their respective computational properties in primate audition. This view challenges an assumption, common in the cognitive sciences, that a nonhuman primate model forms an inherently inadequate basis for modeling higher-level language functions. Copyright © 2014 Elsevier Ltd. All rights reserved.

Plasmids as stochastic model systems

NASA Astrophysics Data System (ADS)

Paulsson, Johan

2003-05-01

Plasmids are self-replicating gene clusters present in on average 2-100 copies per bacterial cell. To reduce random fluctuations and thereby avoid extinction, they ubiquitously autoregulate their own synthesis using negative feedback loops. Here I use van Kampen's Ω-expansion for a two-dimensional model of negative feedback including plasmids and ther replication inhibitors. This analytically summarizes the standard perspective on replication control -- including the effects of sensitivity amplification, exponential time-delays and noisy signaling. I further review the two most common molecular sensitivity mechanisms: multistep control and cooperativity. Finally, I discuss more controversial sensitivity schemes, such as noise-enhanced sensitivity, the exploitation of small-number combinatorics and double-layered feedback loops to suppress noise in disordered environments.

Combinatorics of the Breakage-Fusion-Bridge Mechanism

PubMed Central

Bafna, Vineet

2012-01-01

Abstract The breakage-fusion-bridge (BFB) mechanism was proposed over seven decades ago and is a source of genomic variability and gene amplification in cancer. Here we formally model and analyze the BFB mechanism, to our knowledge the first time this has been undertaken. We show that BFB can be modeled as successive inverted prefix duplications of a string. Using this model, we show that BFB can achieve a surprisingly broad range of amplification patterns. We find that a sequence of BFB operations can be found that nearly fits most patterns of copy number increases along a chromosome. We conclude that this limits the usefulness of methods like array CGH for detecting BFB. PMID:22506505

Wilson Lines and Webs in Higher-Order QCD

NASA Astrophysics Data System (ADS)

White, Chris D.

2018-03-01

Wilson lines have a number of uses in non-abelian gauge theories. A topical example in QCD is the description of radiation in the soft or collinear limit, which must often be resummed to all orders in perturbation theory. Correlators involving a pair of Wilson lines are known to exponentiate in terms of special Feynman diagrams called "webs". I will show how this language can be extended to an arbitrary number of Wilson lines, which introduces novel new combinatoric structures (web mixing matrices) of interest in their own right. I will also summarise recent results obtained from applying this formalism at three-loop order, before concluding with a list of open problems.

Combinatorics and synchronization in natural semiotics

NASA Astrophysics Data System (ADS)

Orsucci, Franco; Giuliani, Alessandro; Webber, Charles; Zbilut, Joseph; Fonagy, Peter; Mazza, Marianna

2006-03-01

In this study the derivation of an objective metrics to appreciate the degree of structuring of written and spoken texts is presented. The proposed metrics is based on the scoring of recurrences inside a text by means of the application of recurrence quantification analysis (RQA), a nonlinear technique widely used in other fields of sciences. The adopted approach allowed us to create a ranking of different poems strictly related to their prosodic structure and, more importantly, the possibility to recognize the same structure across different languages, to define a level of structuring typical of spoken texts and identifying the progressive synchronization of a dyadic relation between two speakers in terms of relative complexity of their speeches. These results suggest the possibility of introducing objective measurement methods into humanities studies.

[The theory of order from poinsot to Bourgoin: Mathematics, philosophy, ornemental art].

PubMed

Boucard, Jenny; Eckes, Christophe

2015-12-01

The aim of this paper is to understand the dynamics of the theory of order in the nineteenth century and to reveal a specific approach to mathematics, science, philosophy and decorative art in which order plays a prominent role. We will analyze the singular meaning that Poinsot assigns to the notion of order in the mathematical sciences, before describing the circulation of his writings on the order in the nineteenth century. Poinsot is one of the main sources of Cournot, who places the notions of order and form as the basis of his knowledge system. Then we will study the writings of Bourgoin who develops a combinatorics of ornaments based on the categories of order and form.

The Ames-Lockheed orbiter processing scheduling system

NASA Technical Reports Server (NTRS)

Zweben, Monte; Gargan, Robert

1991-01-01

A general purpose scheduling system and its application to Space Shuttle Orbiter Processing at the Kennedy Space Center (KSC) are described. Orbiter processing entails all the inspection, testing, repair, and maintenance necessary to prepare the Shuttle for launch and takes place within the Orbiter Processing Facility (OPF) at KSC, the Vehicle Assembly Building (VAB), and on the launch pad. The problems are extremely combinatoric in that there are thousands of tasks, resources, and other temporal considerations that must be coordinated. Researchers are building a scheduling tool that they hope will be an integral part of automating the planning and scheduling process at KSC. The scheduling engine is domain independent and is also being applied to Space Shuttle cargo processing problems as well as wind tunnel scheduling problems.

Development of a comprehensive software engineering environment

NASA Technical Reports Server (NTRS)

Hartrum, Thomas C.; Lamont, Gary B.

1987-01-01

The generation of a set of tools for software lifecycle is a recurring theme in the software engineering literature. The development of such tools and their integration into a software development environment is a difficult task because of the magnitude (number of variables) and the complexity (combinatorics) of the software lifecycle process. An initial development of a global approach was initiated in 1982 as the Software Development Workbench (SDW). Continuing efforts focus on tool development, tool integration, human interfacing, data dictionaries, and testing algorithms. Current efforts are emphasizing natural language interfaces, expert system software development associates and distributed environments with Ada as the target language. The current implementation of the SDW is on a VAX-11/780. Other software development tools are being networked through engineering workstations.

Combinatorics of γ-structures.

PubMed

Han, Hillary S W; Li, Thomas J X; Reidys, Christian M

2014-08-01

In this article we study canonical γ-structures, a class of RNA pseudoknot structures that plays a key role in the context of polynomial time folding of RNA pseudoknot structures. A γ-structure is composed of specific building blocks that have topological genus less than or equal to γ, where composition means concatenation and nesting of such blocks. Our main result is the derivation of the generating function of γ-structures via symbolic enumeration using so called irreducible shadows. We furthermore recursively compute the generating polynomials of irreducible shadows of genus ≤ γ. The γ-structures are constructed via γ-matchings. For 1 ≤ γ ≤ 10, we compute Puiseux expansions at the unique, dominant singularities, allowing us to derive simple asymptotic formulas for the number of γ-structures.

Measurement problem in Program Universe. Revision

NASA Astrophysics Data System (ADS)

Noyes, H. P.; Gefwert, C.; Manthey, M. J.

1985-07-01

The measurement problem of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not and) G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact.

Combinatoric analysis of heterogeneous stochastic self-assembly.

PubMed

D'Orsogna, Maria R; Zhao, Bingyu; Berenji, Bijan; Chou, Tom

2013-09-28

We analyze a fully stochastic model of heterogeneous nucleation and self-assembly in a closed system with a fixed total particle number M, and a fixed number of seeds Ns. Each seed can bind a maximum of N particles. A discrete master equation for the probability distribution of the cluster sizes is derived and the corresponding cluster concentrations are found using kinetic Monte-Carlo simulations in terms of the density of seeds, the total mass, and the maximum cluster size. In the limit of slow detachment, we also find new analytic expressions and recursion relations for the cluster densities at intermediate times and at equilibrium. Our analytic and numerical findings are compared with those obtained from classical mass-action equations and the discrepancies between the two approaches analyzed.

Constraint methods that accelerate free-energy simulations of biomolecules.

PubMed

Perez, Alberto; MacCallum, Justin L; Coutsias, Evangelos A; Dill, Ken A

2015-12-28

Atomistic molecular dynamics simulations of biomolecules are critical for generating narratives about biological mechanisms. The power of atomistic simulations is that these are physics-based methods that satisfy Boltzmann's law, so they can be used to compute populations, dynamics, and mechanisms. But physical simulations are computationally intensive and do not scale well to the sizes of many important biomolecules. One way to speed up physical simulations is by coarse-graining the potential function. Another way is to harness structural knowledge, often by imposing spring-like restraints. But harnessing external knowledge in physical simulations is problematic because knowledge, data, or hunches have errors, noise, and combinatoric uncertainties. Here, we review recent principled methods for imposing restraints to speed up physics-based molecular simulations that promise to scale to larger biomolecules and motions.

Determination of many-electron basis functions for a quantum Hall ground state using Schur polynomials

NASA Astrophysics Data System (ADS)

Mandal, Sudhansu S.; Mukherjee, Sutirtha; Ray, Koushik

2018-03-01

A method for determining the ground state of a planar interacting many-electron system in a magnetic field perpendicular to the plane is described. The ground state wave-function is expressed as a linear combination of a set of basis functions. Given only the flux and the number of electrons describing an incompressible state, we use the combinatorics of partitioning the flux among the electrons to derive the basis wave-functions as linear combinations of Schur polynomials. The procedure ensures that the basis wave-functions form representations of the angular momentum algebra. We exemplify the method by deriving the basis functions for the 5/2 quantum Hall state with a few particles. We find that one of the basis functions is precisely the Moore-Read Pfaffian wave function.

Weighted straight skeletons in the plane☆

PubMed Central

Biedl, Therese; Held, Martin; Huber, Stefan; Kaaser, Dominik; Palfrader, Peter

2015-01-01

We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the weighted straight skeleton of even a simple polygon may be non-planar and may contain cycles, and we discuss under which restrictions on the weights and/or the input polygon the weighted straight skeleton still behaves similar to its unweighted counterpart. In particular, we obtain a non-procedural description and a linear-time construction algorithm for the straight skeleton of strictly convex polygons with arbitrary weights. PMID:25648398

Split-plot designs for robotic serial dilution assays.

PubMed

Buzas, Jeffrey S; Wager, Carrie G; Lansky, David M

2011-12-01

This article explores effective implementation of split-plot designs in serial dilution bioassay using robots. We show that the shortest path for a robot to fill plate wells for a split-plot design is equivalent to the shortest common supersequence problem in combinatorics. We develop an algorithm for finding the shortest common supersequence, provide an R implementation, and explore the distribution of the number of steps required to implement split-plot designs for bioassay through simulation. We also show how to construct collections of split plots that can be filled in a minimal number of steps, thereby demonstrating that split-plot designs can be implemented with nearly the same effort as strip-plot designs. Finally, we provide guidelines for modeling data that result from these designs. © 2011, The International Biometric Society.

Multiple-solution problems in a statistics classroom: an example

NASA Astrophysics Data System (ADS)

Chu, Chi Wing; Chan, Kevin L. T.; Chan, Wai-Sum; Kwong, Koon-Shing

2017-11-01

The mathematics education literature shows that encouraging students to develop multiple solutions for given problems has a positive effect on students' understanding and creativity. In this paper, we present an example of multiple-solution problems in statistics involving a set of non-traditional dice. In particular, we consider the exact probability mass distribution for the sum of face values. Four different ways of solving the problem are discussed. The solutions span various basic concepts in different mathematical disciplines (sample space in probability theory, the probability generating function in statistics, integer partition in basic combinatorics and individual risk model in actuarial science) and thus promotes upper undergraduate students' awareness of knowledge connections between their courses. All solutions of the example are implemented using the R statistical software package.

The Φ43 and Φ63 matricial QFT models have reflection positive two-point function

NASA Astrophysics Data System (ADS)

Grosse, Harald; Sako, Akifumi; Wulkenhaar, Raimar

2018-01-01

We extend our previous work (on D = 2) to give an exact solution of the ΦD3 large- N matrix model (or renormalised Kontsevich model) in D = 4 and D = 6 dimensions. Induction proofs and the difficult combinatorics are unchanged compared with D = 2, but the renormalisation - performed according to Zimmermann - is much more involved. As main result we prove that the Schwinger 2-point function resulting from the ΦD3 -QFT model on Moyal space satisfies, for real coupling constant, reflection positivity in D = 4 and D = 6 dimensions. The Källén-Lehmann mass spectrum of the associated Wightman 2-point function describes a scattering part | p|2 ≥ 2μ2 and an isolated broadened mass shell around | p|2 =μ2.

Statistical mechanics and combinatorics of some discrete lattice models

NASA Astrophysics Data System (ADS)

Ayyer, Arvind

Many problems in statistical physics involve enumeration of certain objects. In this thesis, we apply ideas from combinatorics and statistical physics to understand three different lattice models. (I) We investigate the structure of the nonequilibrium stationary state (NESS) of a system of first and second class particles on L sites of a one-dimensional lattice in contact with first class particle reservoirs at the boundary sites and second class particles constrained to lie the system. The internal dynamics are described by the usual totally asymmetric exclusion process (TASEP) with second class particles. We show in a conceptually simple way how pinned and unpinned (fat) shocks determine the general structure of the phase diagram. We also point out some unexpected features in the microscopic structure of the NESS both for finite L and in the limit L → infinity. In the latter case the local distribution of second class particles is given by an equilibrium pressure ensemble with a pair potential between neighboring particles which grows logarithmically with distance. (II) We model a long linear polymer constrained between two plates as a walk on a two-dimensional lattice constrained to lie between two lines, x = y and x = y+w, which interacts with these lines via contact parameters s and t. The atomic steps of the walk can be taken to be from an arbitrary but fixed set S with the only condition being that the first coordinate of every element in S is strictly positive. For any such S and any w, we prescribe general algorithms (fully implemented in Maple) for the automated calculation of several mathematical and physical quantities of interest. (III) Ferrers (or Young) diagrams are very classical objects in representation theory, whose half-perimeter generating function of Ferrers diagrams is a straightforward rational function. We construct two new classes of Ferrers diagrams, which we call wicketed and gated Ferrers diagrams, which have internal voids in the shape of Ferrers diagrams, and calculate their half-perimeter generating functions, one of which is closely related to the generating function of the Catalan numbers, using a more abstract version of the usual transfer matrix method.

Gaussian curvature analysis allows for automatic block placement in multi-block hexahedral meshing.

PubMed

Ramme, Austin J; Shivanna, Kiran H; Magnotta, Vincent A; Grosland, Nicole M

2011-10-01

Musculoskeletal finite element analysis (FEA) has been essential to research in orthopaedic biomechanics. The generation of a volumetric mesh is often the most challenging step in a FEA. Hexahedral meshing tools that are based on a multi-block approach rely on the manual placement of building blocks for their mesh generation scheme. We hypothesise that Gaussian curvature analysis could be used to automatically develop a building block structure for multi-block hexahedral mesh generation. The Automated Building Block Algorithm incorporates principles from differential geometry, combinatorics, statistical analysis and computer science to automatically generate a building block structure to represent a given surface without prior information. We have applied this algorithm to 29 bones of varying geometries and successfully generated a usable mesh in all cases. This work represents a significant advancement in automating the definition of building blocks.

Combinatorics of feedback in cellular uptake and metabolism of small molecules.

PubMed

Krishna, Sandeep; Semsey, Szabolcs; Sneppen, Kim

2007-12-26

We analyze the connection between structure and function for regulatory motifs associated with cellular uptake and usage of small molecules. Based on the boolean logic of the feedback we suggest four classes: the socialist, consumer, fashion, and collector motifs. We find that the socialist motif is good for homeostasis of a useful but potentially poisonous molecule, whereas the consumer motif is optimal for nutrition molecules. Accordingly, examples of these motifs are found in, respectively, the iron homeostasis system in various organisms and in the uptake of sugar molecules in bacteria. The remaining two motifs have no obvious analogs in small molecule regulation, but we illustrate their behavior using analogies to fashion and obesity. These extreme motifs could inspire construction of synthetic systems that exhibit bistable, history-dependent states, and homeostasis of flux (rather than concentration).

Amplitudes for multiphoton quantum processes in linear optics

NASA Astrophysics Data System (ADS)

Urías, Jesús

2011-07-01

The prominent role that linear optical networks have acquired in the engineering of photon states calls for physically intuitive and automatic methods to compute the probability amplitudes for the multiphoton quantum processes occurring in linear optics. A version of Wick's theorem for the expectation value, on any vector state, of products of linear operators, in general, is proved. We use it to extract the combinatorics of any multiphoton quantum processes in linear optics. The result is presented as a concise rule to write down directly explicit formulae for the probability amplitude of any multiphoton process in linear optics. The rule achieves a considerable simplification and provides an intuitive physical insight about quantum multiphoton processes. The methodology is applied to the generation of high-photon-number entangled states by interferometrically mixing coherent light with spontaneously down-converted light.

From laptop to benchtop to bedside: Structure-based Drug Design on Protein Targets

PubMed Central

Chen, Lu; Morrow, John K.; Tran, Hoang T.; Phatak, Sharangdhar S.; Du-Cuny, Lei; Zhang, Shuxing

2013-01-01

As an important aspect of computer-aided drug design, structure-based drug design brought a new horizon to pharmaceutical development. This in silico method permeates all aspects of drug discovery today, including lead identification, lead optimization, ADMET prediction and drug repurposing. Structure-based drug design has resulted in fruitful successes drug discovery targeting protein-ligand and protein-protein interactions. Meanwhile, challenges, noted by low accuracy and combinatoric issues, may also cause failures. In this review, state-of-the-art techniques for protein modeling (e.g. structure prediction, modeling protein flexibility, etc.), hit identification/optimization (e.g. molecular docking, focused library design, fragment-based design, molecular dynamic, etc.), and polypharmacology design will be discussed. We will explore how structure-based techniques can facilitate the drug discovery process and interplay with other experimental approaches. PMID:22316152

Community structure and scale-free collections of Erdős-Rényi graphs.

PubMed

Seshadhri, C; Kolda, Tamara G; Pinar, Ali

2012-05-01

Community structure plays a significant role in the analysis of social networks and similar graphs, yet this structure is little understood and not well captured by most models. We formally define a community to be a subgraph that is internally highly connected and has no deeper substructure. We use tools of combinatorics to show that any such community must contain a dense Erdős-Rényi (ER) subgraph. Based on mathematical arguments, we hypothesize that any graph with a heavy-tailed degree distribution and community structure must contain a scale-free collection of dense ER subgraphs. These theoretical observations corroborate well with empirical evidence. From this, we propose the Block Two-Level Erdős-Rényi (BTER) model, and demonstrate that it accurately captures the observable properties of many real-world social networks.

Ward identities and combinatorics of rainbow tensor models

NASA Astrophysics Data System (ADS)

Itoyama, H.; Mironov, A.; Morozov, A.

2017-06-01

We discuss the notion of renormalization group (RG) completion of non-Gaussian Lagrangians and its treatment within the framework of Bogoliubov-Zimmermann theory in application to the matrix and tensor models. With the example of the simplest non-trivial RGB tensor theory (Aristotelian rainbow), we introduce a few methods, which allow one to connect calculations in the tensor models to those in the matrix models. As a byproduct, we obtain some new factorization formulas and sum rules for the Gaussian correlators in the Hermitian and complex matrix theories, square and rectangular. These sum rules describe correlators as solutions to finite linear systems, which are much simpler than the bilinear Hirota equations and the infinite Virasoro recursion. Search for such relations can be a way to solving the tensor models, where an explicit integrability is still obscure.

New graph polynomials in parametric QED Feynman integrals

NASA Astrophysics Data System (ADS)

Golz, Marcel

2017-10-01

In recent years enormous progress has been made in perturbative quantum field theory by applying methods of algebraic geometry to parametric Feynman integrals for scalar theories. The transition to gauge theories is complicated not only by the fact that their parametric integrand is much larger and more involved. It is, moreover, only implicitly given as the result of certain differential operators applied to the scalar integrand exp(-ΦΓ /ΨΓ) , where ΨΓ and ΦΓ are the Kirchhoff and Symanzik polynomials of the Feynman graph Γ. In the case of quantum electrodynamics we find that the full parametric integrand inherits a rich combinatorial structure from ΨΓ and ΦΓ. In the end, it can be expressed explicitly as a sum over products of new types of graph polynomials which have a combinatoric interpretation via simple cycle subgraphs of Γ.

Cue-dependent interference in comprehension

PubMed Central

Van Dyke, Julie A.

2011-01-01

The role of interference as a primary determinant of forgetting in memory has long been accepted, however its role as a contributor to poor comprehension is just beginning to be understood. The current paper reports two studies, in which speed-accuracy tradeoff and eye-tracking methodologies were used with the same materials to provide converging evidence for the role of syntactic and semantic cues as mediators of both proactive (PI) and retroactive interference (RI) during comprehension. Consistent with previous work (e.g., Van Dyke & Lewis, 2003), we found that syntactic constraints at the retrieval site are among the cues that drive retrieval in comprehension, and that these constraints effectively limit interference from potential distractors with semantic/pragmatic properties in common with the target constituent. The data are discussed in terms of a cue-overload account, in which interference both arises from and is mediated through a direct-access retrieval mechanism that utilizes a linear, weighted cue-combinatoric scheme. PMID:21927535

Quality quandaries: Statistical detective work to understand the isotopic ratios in Drum 68660 and the radioactive release at WIPP

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kelly, Elizabeth J.; Weaver, Brian Phillip; Veirs, Douglas Kirk

An incident at the Department of Energy's Waste Isolation Pilot Plant (WIPP) in 2014 resulted in the release of radioactive material into the environment. Initially, it was known that at least one drum in WIPP, identified as drum 68660, was involved. However, questions remained. Could the air-monitor isotopic ratios measured in WIPP at the time of the release be explained by materials in drum 68660 or were other drums involved? Could internal conditions in drum 68660 have caused the breach? What were the implications for 68660's sister drum? These questions needed to be answered as quickly as possible. Here, thismore » analysis, which was completed in three weeks, combined combinatorics and uncertainty analysis to provide scientists with the timely evidence they needed to either answer these important questions or to design experiments to answer them.« less

Quality quandaries: Statistical detective work to understand the isotopic ratios in Drum 68660 and the radioactive release at WIPP

DOE PAGES

Kelly, Elizabeth J.; Weaver, Brian Phillip; Veirs, Douglas Kirk

2017-08-09

An incident at the Department of Energy's Waste Isolation Pilot Plant (WIPP) in 2014 resulted in the release of radioactive material into the environment. Initially, it was known that at least one drum in WIPP, identified as drum 68660, was involved. However, questions remained. Could the air-monitor isotopic ratios measured in WIPP at the time of the release be explained by materials in drum 68660 or were other drums involved? Could internal conditions in drum 68660 have caused the breach? What were the implications for 68660's sister drum? These questions needed to be answered as quickly as possible. Here, thismore » analysis, which was completed in three weeks, combined combinatorics and uncertainty analysis to provide scientists with the timely evidence they needed to either answer these important questions or to design experiments to answer them.« less

The grasshopper problem

NASA Astrophysics Data System (ADS)

Goulko, Olga; Kent, Adrian

2017-11-01

We introduce and physically motivate the following problem in geometric combinatorics, originally inspired by analysing Bell inequalities. A grasshopper lands at a random point on a planar lawn of area 1. It then jumps once, a fixed distance d, in a random direction. What shape should the lawn be to maximize the chance that the grasshopper remains on the lawn after jumping? We show that, perhaps surprisingly, a disc-shaped lawn is not optimal for any d>0. We investigate further by introducing a spin model whose ground state corresponds to the solution of a discrete version of the grasshopper problem. Simulated annealing and parallel tempering searches are consistent with the hypothesis that, for d<π-1/2, the optimal lawn resembles a cogwheel with n cogs, where the integer n is close to π (arcsin⁡(√{π }d / 2 )) -1. We find transitions to other shapes for d ≳π-1 / 2.

Combinatorics of transformations from standard to non-standard bases in Brauer algebras

NASA Astrophysics Data System (ADS)

Chilla, Vincenzo

2007-05-01

Transformation coefficients between standard bases for irreducible representations of the Brauer centralizer algebra \\mathfrak{B}_f(x) and split bases adapted to the \\mathfrak{B}_{f_1} (x) \\times \\mathfrak{B}_{f_2} (x) \\subset \\mathfrak{B}_f (x) subalgebra (f1 + f2 = f) are considered. After providing the suitable combinatorial background, based on the definition of the i-coupling relation on nodes of the subduction grid, we introduce a generalized version of the subduction graph which extends the one given in Chilla (2006 J. Phys. A: Math. Gen. 39 7657) for symmetric groups. Thus, we can describe the structure of the subduction system arising from the linear method and give an outline of the form of the solution space. An ordering relation on the grid is also given and then, as in the case of symmetric groups, the choices of the phases and of the free factors governing the multiplicity separations are discussed.

Improving Efficiency in Multi-Strange Baryon Reconstruction in d-Au at STAR

NASA Astrophysics Data System (ADS)

Leight, William

2003-10-01

We report preliminary multi-strange baryon measurements for d-Au collisions recorded at RHIC by the STAR experiment. After using classical topological analysis, in which cuts for each discriminating variable are adjusted by hand, we investigate improvements in signal-to-noise optimization using Linear Discriminant Analysis (LDA). LDA is an algorithm for finding, in the n-dimensional space of the n discriminating variables, the axis on which the signal and noise distributions are most separated. LDA is the first step in moving towards more sophisticated techniques for signal-to-noise optimization, such as Artificial Neural Nets. Due to the relatively low background and sufficiently high yields of d-Au collisions, they form an ideal system to study these possibilities for improving reconstruction methods. Such improvements will be extremely important for forthcoming Au-Au runs in which the size of the combinatoric background is a major problem in reconstruction efforts.

A general method for computing Tutte polynomials of self-similar graphs

NASA Astrophysics Data System (ADS)

Gong, Helin; Jin, Xian'an

2017-10-01

Self-similar graphs were widely studied in both combinatorics and statistical physics. Motivated by the construction of the well-known 3-dimensional Sierpiński gasket graphs, in this paper we introduce a family of recursively constructed self-similar graphs whose inner duals are of the self-similar property. By combining the dual property of the Tutte polynomial and the subgraph-decomposition trick, we show that the Tutte polynomial of this family of graphs can be computed in an iterative way and in particular the exact expression of the formula of the number of their spanning trees is derived. Furthermore, we show our method is a general one that is easily extended to compute Tutte polynomials for other families of self-similar graphs such as Farey graphs, 2-dimensional Sierpiński gasket graphs, Hanoi graphs, modified Koch graphs, Apollonian graphs, pseudofractal scale-free web, fractal scale-free network, etc.

Experimental and Theoretical Investigations of Charged Phospholipid Bilayers.

NASA Astrophysics Data System (ADS)

Graham, Ian Stanley

1987-09-01

Lipid systems containing charged species are examined by both experiment and theory. Experimental studies of the mixing of phosphatidylcholine or phosphatidylethanolamine with phosphatidic acid show that calcium induces fast ( <=q1s) phase separation of these otherwise miscible systems, and that this can occur in an isolated bilayer. Ionogenic behaviour is theoretically investigated using a new electrolyte model which explicitly includes both the solvent and particle sizes, and a binding model which uses Guggenheim combinatorics to treat non 1-1 binding stoichiometries. This work predicts a reduced dielectric constant near charged surfaces and strong repulsive forces between closely spaced (<15A) surfaces. A reanalysis of data from charged monolayers experiments indicates (1) that the new electrolyte model describes double layer behaviour at high surface charge densities better than the traditional Derjaguin - Landau - Verwey - Overbeek (DLVO) theory, (2) that calcium and magnesium bind to phosphatidylserine monolayers with a 1-1 stoichiometry.

Improved Spectral Calculations for Discrete Schrődinger Operators

NASA Astrophysics Data System (ADS)

Puelz, Charles

This work details an O(n2) algorithm for computing spectra of discrete Schrődinger operators with periodic potentials. Spectra of these objects enhance our understanding of fundamental aperiodic physical systems and contain rich theoretical structure of interest to the mathematical community. Previous work on the Harper model led to an O(n2) algorithm relying on properties not satisfied by other aperiodic operators. Physicists working with the Fibonacci Hamiltonian, a popular quasicrystal model, have instead used a problematic dynamical map approach or a sluggish O(n3) procedure for their calculations. The algorithm presented in this work, a blend of well-established eigenvalue/vector algorithms, provides researchers with a more robust computational tool of general utility. Application to the Fibonacci Hamiltonian in the sparsely studied intermediate coupling regime reveals structure in canonical coverings of the spectrum that will prove useful in motivating conjectures regarding band combinatorics and fractal dimensions.

Topological Classification of Crystalline Insulators through Band Structure Combinatorics

NASA Astrophysics Data System (ADS)

Kruthoff, Jorrit; de Boer, Jan; van Wezel, Jasper; Kane, Charles L.; Slager, Robert-Jan

2017-10-01

We present a method for efficiently enumerating all allowed, topologically distinct, electronic band structures within a given crystal structure in all physically relevant dimensions. The algorithm applies to crystals without time-reversal, particle-hole, chiral, or any other anticommuting or anti-unitary symmetries. The results presented match the mathematical structure underlying the topological classification of these crystals in terms of K -theory and therefore elucidate this abstract mathematical framework from a simple combinatorial perspective. Using a straightforward counting procedure, we classify all allowed topological phases of spinless particles in crystals in class A . Employing this classification, we study transitions between topological phases within class A that are driven by band inversions at high-symmetry points in the first Brillouin zone. This enables us to list all possible types of phase transitions within a given crystal structure and to identify whether or not they give rise to intermediate Weyl semimetallic phases.

Teaching undergraduate mathematics in interactive groups: how does it fit with students' learning?

NASA Astrophysics Data System (ADS)

Sheryn, Louise; Ell, Fiona

2014-08-01

Debates about how undergraduate mathematics should be taught are informed by different views of what it is to learn and to do mathematics. In this qualitative study 10 students enrolled in an advanced undergraduate course in mathematics shared their views about how they best learn mathematics. After participating in a semester-long course in combinatorics, taught using a non-traditional, formal group work approach, the 10 students shared their views about how such an approach fitted in with their experience of learning mathematics. A descriptive thematic analysis of the students' responses revealed that despite being very comfortable with the traditional approach to learning new mathematics, most students were open to a formal group work approach and could see benefits from it after their participation. The students' prior conceptions of the goal of undergraduate mathematics learning and their view of themselves as 'mathematicians' framed their experience of learning mathematics in a non-traditional class.

The causal perturbation expansion revisited: Rescaling the interacting Dirac sea

NASA Astrophysics Data System (ADS)

Finster, Felix; Grotz, Andreas

2010-07-01

The causal perturbation expansion defines the Dirac sea in the presence of a time-dependent external field. It yields an operator whose image generalizes the vacuum solutions of negative energy and thus gives a canonical splitting of the solution space into two subspaces. After giving a self-contained introduction to the ideas and techniques, we show that this operator is, in general, not idempotent. We modify the standard construction by a rescaling procedure giving a projector on the generalized negative-energy subspace. The resulting rescaled causal perturbation expansion uniquely defines the fermionic projector in terms of a series of distributional solutions of the Dirac equation. The technical core of the paper is to work out the combinatorics of the expansion in detail. It is also shown that the fermionic projector with interaction can be obtained from the free projector by a unitary transformation. We finally analyze the consequences of the rescaling procedure on the light-cone expansion.

Some Applications of the Model of the Partion Points on a One Dimensional Lattice

NASA Astrophysics Data System (ADS)

Mejdani, R.; Huseini, H.

1996-02-01

We have shown that by using a model of gas of partition points on a one-dimensional lattice, we can find some results about the saturation curves for enzyme kinetics or the average domain-size, which we have obtained before by using a correlated walks' theory or a probabilistic (combinatoric) way. We have studied, using the same model and the same technique, the denaturation process, i.e., the breaking of the hydrogen bonds connecting the two strands, under treatment by heat. Also, we have discussed, without entering in details, the problem related to the spread of an infections disease and the stochastic model of partition points. We think that this model, being simple and mathematically transparent, can be advantageous for the other theoratical investigations in chemistry or modern biology. PACS NOS.: 05.50. + q; 05.70.Ce; 64.10.+h; 87.10. +e; 87.15.Rn

A complete solution classification and unified algorithmic treatment for the one- and two-step asymmetric S-transverse mass event scale statistic

NASA Astrophysics Data System (ADS)

Walker, Joel W.

2014-08-01

The M T2, or "s-transverse mass", statistic was developed to associate a parent mass scale to a missing transverse energy signature, given that escaping particles are generally expected in pairs, while collider experiments are sensitive to just a single transverse momentum vector sum. This document focuses on the generalized extension of that statistic to asymmetric one- and two-step decay chains, with arbitrary child particle masses and upstream missing transverse momentum. It provides a unified theoretical formulation, complete solution classification, taxonomy of critical points, and technical algorithmic prescription for treatment of the event scale. An implementation of the described algorithm is available for download, and is also a deployable component of the author's selection cut software package AEAC uS (Algorithmic Event Arbiter and C ut Selector). appendices address combinatoric event assembly, algorithm validation, and a complete pseudocode.

JOURNAL SCOPE GUIDELINES: Paper classification scheme

NASA Astrophysics Data System (ADS)

2005-06-01

This scheme is used to clarify the journal's scope and enable authors and readers to more easily locate the appropriate section for their work. For each of the sections listed in the scope statement we suggest some more detailed subject areas which help define that subject area. These lists are by no means exhaustive and are intended only as a guide to the type of papers we envisage appearing in each section. We acknowledge that no classification scheme can be perfect and that there are some papers which might be placed in more than one section. We are happy to provide further advice on paper classification to authors upon request (please email jphysa@iop.org). 1. Statistical physics numerical and computational methods statistical mechanics, phase transitions and critical phenomena quantum condensed matter theory Bose-Einstein condensation strongly correlated electron systems exactly solvable models in statistical mechanics lattice models, random walks and combinatorics field-theoretical models in statistical mechanics disordered systems, spin glasses and neural networks nonequilibrium systems network theory 2. Chaotic and complex systems nonlinear dynamics and classical chaos fractals and multifractals quantum chaos classical and quantum transport cellular automata granular systems and self-organization pattern formation biophysical models 3. Mathematical physics combinatorics algebraic structures and number theory matrix theory classical and quantum groups, symmetry and representation theory Lie algebras, special functions and orthogonal polynomials ordinary and partial differential equations difference and functional equations integrable systems soliton theory functional analysis and operator theory inverse problems geometry, differential geometry and topology numerical approximation and analysis geometric integration computational methods 4. Quantum mechanics and quantum information theory coherent states eigenvalue problems supersymmetric quantum mechanics scattering theory relativistic quantum mechanics semiclassical approximations foundations of quantum mechanics and measurement theory entanglement and quantum nonlocality geometric phases and quantum tomography quantum tunnelling decoherence and open systems quantum cryptography, communication and computation theoretical quantum optics 5. Classical and quantum field theory quantum field theory gauge and conformal field theory quantum electrodynamics and quantum chromodynamics Casimir effect integrable field theory random matrix theory applications in field theory string theory and its developments classical field theory and electromagnetism metamaterials 6. Fluid and plasma theory turbulence fundamental plasma physics kinetic theory magnetohydrodynamics and multifluid descriptions strongly coupled plasmas one-component plasmas non-neutral plasmas astrophysical and dusty plasmas

Extracting Association Patterns in Network Communications

PubMed Central

Portela, Javier; Villalba, Luis Javier García; Trujillo, Alejandra Guadalupe Silva; Orozco, Ana Lucila Sandoval; Kim, Tai-hoon

2015-01-01

In network communications, mixes provide protection against observers hiding the appearance of messages, patterns, length and links between senders and receivers. Statistical disclosure attacks aim to reveal the identity of senders and receivers in a communication network setting when it is protected by standard techniques based on mixes. This work aims to develop a global statistical disclosure attack to detect relationships between users. The only information used by the attacker is the number of messages sent and received by each user for each round, the batch of messages grouped by the anonymity system. A new modeling framework based on contingency tables is used. The assumptions are more flexible than those used in the literature, allowing to apply the method to multiple situations automatically, such as email data or social networks data. A classification scheme based on combinatoric solutions of the space of rounds retrieved is developed. Solutions about relationships between users are provided for all pairs of users simultaneously, since the dependence of the data retrieved needs to be addressed in a global sense. PMID:25679311

Extracting association patterns in network communications.

PubMed

Portela, Javier; Villalba, Luis Javier García; Trujillo, Alejandra Guadalupe Silva; Orozco, Ana Lucila Sandoval; Kim, Tai-hoon

2015-02-11

In network communications, mixes provide protection against observers hiding the appearance of messages, patterns, length and links between senders and receivers. Statistical disclosure attacks aim to reveal the identity of senders and receivers in a communication network setting when it is protected by standard techniques based on mixes. This work aims to develop a global statistical disclosure attack to detect relationships between users. The only information used by the attacker is the number of messages sent and received by each user for each round, the batch of messages grouped by the anonymity system. A new modeling framework based on contingency tables is used. The assumptions are more flexible than those used in the literature, allowing to apply the method to multiple situations automatically, such as email data or social networks data. A classification scheme based on combinatoric solutions of the space of rounds retrieved is developed. Solutions about relationships between users are provided for all pairs of users simultaneously, since the dependence of the data retrieved needs to be addressed in a global sense.

Graph Matching: Relax at Your Own Risk.

PubMed

Lyzinski, Vince; Fishkind, Donniell E; Fiori, Marcelo; Vogelstein, Joshua T; Priebe, Carey E; Sapiro, Guillermo

2016-01-01

Graph matching-aligning a pair of graphs to minimize their edge disagreements-has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational difficulty. Although many heuristics have previously been proposed in the literature to approximately solve graph matching, very few have any theoretical support for their performance. A common technique is to relax the discrete problem to a continuous problem, therefore enabling practitioners to bring gradient-descent-type algorithms to bear. We prove that an indefinite relaxation (when solved exactly) almost always discovers the optimal permutation, while a common convex relaxation almost always fails to discover the optimal permutation. These theoretical results suggest that initializing the indefinite algorithm with the convex optimum might yield improved practical performance. Indeed, experimental results illuminate and corroborate these theoretical findings, demonstrating that excellent results are achieved in both benchmark and real data problems by amalgamating the two approaches.

An Adiabatic Quantum Algorithm for Determining Gracefulness of a Graph

NASA Astrophysics Data System (ADS)

Hosseini, Sayed Mohammad; Davoudi Darareh, Mahdi; Janbaz, Shahrooz; Zaghian, Ali

2017-07-01

Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph G with e edges, is to label the vertices of G with 0, 1, ℒ, e such that, if we specify to each edge the difference value between its two ends, then any of 1, 2, ℒ, e appears exactly once as an edge label. For a given graph, there are still few efficient classical algorithms that determine either it is graceful or not, even for trees - as a well-known class of graphs. In this paper, we introduce an adiabatic quantum algorithm, which for a graceful graph G finds a graceful labelling. Also, this algorithm can determine if G is not graceful. Numerical simulations of the algorithm reveal that its time complexity has a polynomial behaviour with the problem size up to the range of 15 qubits. A general sufficient condition for a combinatorial optimization problem to have a satisfying adiabatic solution is also derived.

Functional Integration

NASA Astrophysics Data System (ADS)

Cartier, Pierre; DeWitt-Morette, Cecile

2006-11-01

Acknowledgements; List symbols, conventions, and formulary; Part I. The Physical and Mathematical Environment: 1. The physical and mathematical environment; Part II. Quantum Mechanics: 2. First lesson: gaussian integrals; 3. Selected examples; 4. Semiclassical expansion: WKB; 5. Semiclassical expansion: beyond WKB; 6. Quantum dynamics: path integrals and operator formalism; Part III. Methods from Differential Geometry: 7. Symmetries; 8. Homotopy; 9. Grassmann analysis: basics; 10. Grassmann analysis: applications; 11. Volume elements, divergences, gradients; Part IV. Non-Gaussian Applications: 12. Poisson processes in physics; 13. A mathematical theory of Poisson processes; 14. First exit time: energy problems; Part V. Problems in Quantum Field Theory: 15. Renormalization 1: an introduction; 16. Renormalization 2: scaling; 17. Renormalization 3: combinatorics; 18. Volume elements in quantum field theory Bryce DeWitt; Part VI. Projects: 19. Projects; Appendix A. Forward and backward integrals: spaces of pointed paths; Appendix B. Product integrals; Appendix C. A compendium of gaussian integrals; Appendix D. Wick calculus Alexander Wurm; Appendix E. The Jacobi operator; Appendix F. Change of variables of integration; Appendix G. Analytic properties of covariances; Appendix H. Feynman's checkerboard; Bibliography; Index.

Functional Integration

NASA Astrophysics Data System (ADS)

Cartier, Pierre; DeWitt-Morette, Cecile

2010-06-01

Acknowledgements; List symbols, conventions, and formulary; Part I. The Physical and Mathematical Environment: 1. The physical and mathematical environment; Part II. Quantum Mechanics: 2. First lesson: gaussian integrals; 3. Selected examples; 4. Semiclassical expansion: WKB; 5. Semiclassical expansion: beyond WKB; 6. Quantum dynamics: path integrals and operator formalism; Part III. Methods from Differential Geometry: 7. Symmetries; 8. Homotopy; 9. Grassmann analysis: basics; 10. Grassmann analysis: applications; 11. Volume elements, divergences, gradients; Part IV. Non-Gaussian Applications: 12. Poisson processes in physics; 13. A mathematical theory of Poisson processes; 14. First exit time: energy problems; Part V. Problems in Quantum Field Theory: 15. Renormalization 1: an introduction; 16. Renormalization 2: scaling; 17. Renormalization 3: combinatorics; 18. Volume elements in quantum field theory Bryce DeWitt; Part VI. Projects: 19. Projects; Appendix A. Forward and backward integrals: spaces of pointed paths; Appendix B. Product integrals; Appendix C. A compendium of gaussian integrals; Appendix D. Wick calculus Alexander Wurm; Appendix E. The Jacobi operator; Appendix F. Change of variables of integration; Appendix G. Analytic properties of covariances; Appendix H. Feynman's checkerboard; Bibliography; Index.

Optimal placement of fast cut back units based on the theory of cellular automata and agent

NASA Astrophysics Data System (ADS)

Yan, Jun; Yan, Feng

2017-06-01

The thermal power generation units with the function of fast cut back could serve power for auxiliary system and keep island operation after a major blackout, so they are excellent substitute for the traditional black-start power sources. Different placement schemes for FCB units have different influence on the subsequent restoration process. Considering the locality of the emergency dispatching rules, the unpredictability of specific dispatching instructions and unexpected situations like failure of transmission line energization, a novel deduction model for network reconfiguration based on the theory of cellular automata and agent is established. Several indexes are then defined for evaluating the placement schemes for FCB units. The attribute weights determination method based on subjective and objective integration and grey relational analysis are combinatorically used to determine the optimal placement scheme for FCB unit. The effectiveness of the proposed method is validated by the test results on the New England 10-unit 39-bus power system.

Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT

NASA Astrophysics Data System (ADS)

Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh

2016-09-01

Graphs embedded into surfaces have many important applications, in particular, in combinatorics, geometry, and physics. For example, ribbon graphs and their counting is of great interest in string theory and quantum field theory (QFT). Recently, Koch et al. (2013) [12] gave a refined formula for counting ribbon graphs and discussed its applications to several physics problems. An important factor in this formula is the number of surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group. The aim of this paper is to give an explicit and practical formula for the number of such epimorphisms. As a consequence, we obtain an 'equivalent' form of Harvey's famous theorem on the cyclic groups of automorphisms of compact Riemann surfaces. Our main tool is an explicit formula for the number of solutions of restricted linear congruence recently proved by Bibak et al. using properties of Ramanujan sums and of the finite Fourier transform of arithmetic functions.

Log-Gamma Polymer Free Energy Fluctuations via a Fredholm Determinant Identity

NASA Astrophysics Data System (ADS)

Borodin, Alexei; Corwin, Ivan; Remenik, Daniel

2013-11-01

We prove that under n 1/3 scaling, the limiting distribution as n → ∞ of the free energy of Seppäläinen’s log-Gamma discrete directed polymer is GUE Tracy-Widom. The main technical innovation we provide is a general identity between a class of n-fold contour integrals and a class of Fredholm determinants. Applying this identity to the integral formula proved in Corwin et al. (Tropical combinatorics and Whittaker functions. http://arxiv.org/abs/1110.3489v3 [math.PR], 2012) for the Laplace transform of the log-Gamma polymer partition function, we arrive at a Fredholm determinant which lends itself to asymptotic analysis (and thus yields the free energy limit theorem). The Fredholm determinant was anticipated in Borodin and Corwin (Macdonald processes. http://arxiv.org/abs/1111.4408v3 [math.PR], 2012) via the formalism of Macdonald processes yet its rigorous proof was so far lacking because of the nontriviality of certain decay estimates required by that approach.

Group field theories for all loop quantum gravity

NASA Astrophysics Data System (ADS)

Oriti, Daniele; Ryan, James P.; Thürigen, Johannes

2015-02-01

Group field theories represent a second quantized reformulation of the loop quantum gravity state space and a completion of the spin foam formalism. States of the canonical theory, in the traditional continuum setting, have support on graphs of arbitrary valence. On the other hand, group field theories have usually been defined in a simplicial context, thus dealing with a restricted set of graphs. In this paper, we generalize the combinatorics of group field theories to cover all the loop quantum gravity state space. As an explicit example, we describe the group field theory formulation of the KKL spin foam model, as well as a particular modified version. We show that the use of tensor model tools allows for the most effective construction. In order to clarify the mathematical basis of our construction and of the formalisms with which we deal, we also give an exhaustive description of the combinatorial structures entering spin foam models and group field theories, both at the level of the boundary states and of the quantum amplitudes.

A new approach for solving seismic tomography problems and assessing the uncertainty through the use of graph theory and direct methods

NASA Astrophysics Data System (ADS)

Bogiatzis, P.; Ishii, M.; Davis, T. A.

2016-12-01

Seismic tomography inverse problems are among the largest high-dimensional parameter estimation tasks in Earth science. We show how combinatorics and graph theory can be used to analyze the structure of such problems, and to effectively decompose them into smaller ones that can be solved efficiently by means of the least squares method. In combination with recent high performance direct sparse algorithms, this reduction in dimensionality allows for an efficient computation of the model resolution and covariance matrices using limited resources. Furthermore, we show that a new sparse singular value decomposition method can be used to obtain the complete spectrum of the singular values. This procedure provides the means for more objective regularization and further dimensionality reduction of the problem. We apply this methodology to a moderate size, non-linear seismic tomography problem to image the structure of the crust and the upper mantle beneath Japan using local deep earthquakes recorded by the High Sensitivity Seismograph Network stations.

The Great Emch Closure Theorem and a combinatorial proof of Poncelet's Theorem

NASA Astrophysics Data System (ADS)

Avksentyev, E. A.

2015-11-01

The relations between the classical closure theorems (Poncelet's, Steiner's, Emch's, and the zigzag theorems) and some of their generalizations are discussed. It is known that Emch's Theorem is the most general of these, while the others follow as special cases. A generalization of Emch's Theorem to pencils of circles is proved, which (by analogy with the Great Poncelet Theorem) can be called the Great Emch Theorem. It is shown that the Great Emch and Great Poncelet Theorems are equivalent and can be derived one from the other using elementary geometry, and also that both hold in the Lobachevsky plane as well. A new closure theorem is also obtained, in which the construction of closure is slightly more involved: closure occurs on a variable circle which is tangent to a fixed pair of circles. In conclusion, a combinatorial proof of Poncelet's Theorem is given, which deduces the closure principle for an arbitrary number of steps from the principle for three steps using combinatorics and number theory. Bibliography: 20 titles.

Combinatorics of least-squares trees.

PubMed

Mihaescu, Radu; Pachter, Lior

2008-09-09

A recurring theme in the least-squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least-squares estimates of edge lengths. These formulas have proved useful for the development of efficient algorithms, and have also been important for understanding connections among popular phylogeny algorithms. For example, the selection criterion of the neighbor-joining algorithm is now understood in terms of the combinatorial formulas of Pauplin for estimating tree length. We highlight a phylogenetically desirable property that weighted least-squares methods should satisfy, and provide a complete characterization of methods that satisfy the property. The necessary and sufficient condition is a multiplicative four-point condition that the variance matrix needs to satisfy. The proof is based on the observation that the Lagrange multipliers in the proof of the Gauss-Markov theorem are tree-additive. Our results generalize and complete previous work on ordinary least squares, balanced minimum evolution, and the taxon-weighted variance model. They also provide a time-optimal algorithm for computation.

The evolution of syntactic communication

NASA Astrophysics Data System (ADS)

Nowak, Martin A.; Plotkin, Joshua B.; Jansen, Vincent A. A.

2000-03-01

Animal communication is typically non-syntactic, which means that signals refer to whole situations. Human language is syntactic, and signals consist of discrete components that have their own meaning. Syntax is a prerequisite for taking advantage of combinatorics, that is, ``making infinite use of finite means''. The vast expressive power of human language would be impossible without syntax, and the transition from non-syntactic to syntactic communication was an essential step in the evolution of human language. We aim to understand the evolutionary dynamics of this transition and to analyse how natural selection can guide it. Here we present a model for the population dynamics of language evolution, define the basic reproductive ratio of words and calculate the maximum size of a lexicon. Syntax allows larger repertoires and the possibility to formulate messages that have not been learned beforehand. Nevertheless, according to our model natural selection can only favour the emergence of syntax if the number of required signals exceeds a threshold value. This result might explain why only humans evolved syntactic communication and hence complex language.

From Cycle Rooted Spanning Forests to the Critical Ising Model: an Explicit Construction

NASA Astrophysics Data System (ADS)

de Tilière, Béatrice

2013-04-01

Fisher established an explicit correspondence between the 2-dimensional Ising model defined on a graph G and the dimer model defined on a decorated version {{G}} of this graph (Fisher in J Math Phys 7:1776-1781, 1966). In this paper we explicitly relate the dimer model associated to the critical Ising model and critical cycle rooted spanning forests (CRSFs). This relation is established through characteristic polynomials, whose definition only depends on the respective fundamental domains, and which encode the combinatorics of the model. We first show a matrix-tree type theorem establishing that the dimer characteristic polynomial counts CRSFs of the decorated fundamental domain {{G}_1}. Our main result consists in explicitly constructing CRSFs of {{G}_1} counted by the dimer characteristic polynomial, from CRSFs of G 1, where edges are assigned Kenyon's critical weight function (Kenyon in Invent Math 150(2):409-439, 2002); thus proving a relation on the level of configurations between two well known 2-dimensional critical models.

Woese on the received view of evolution.

PubMed

Sarkar, Sahotra

2014-01-01

As part of his attempt to reconstruct the earliest phase of the evolution of life on Earth, Woese produced a compelling critique of the received view of evolution from the 20th century. This paper explicitly articulates two related features of that critique that are fundamental but the first of which has not been sufficiently clearly recognized in the context of evolutionary theorizing: (1) according to Woese's scenario of communal evolution during life's earliest phase (roughly, the first billion years of life on Earth), well-defined biological individuals (and, thus, individual lineages) did not exist; and (2) during that phase, evolutionary change took place through ubiquitous horizontal gene transfer (HGT) rather than through vertical transmission of features (including genes) and the combinatorics of HGT was the dominant mechanism of evolutionary change. Both factors present serious challenges to the received view of evolution and that framework would have to be radically altered to incorporate these factors. The extent to which this will be necessary will depend on whether Woese's scenario of collective early evolution is correct.

On the symmetries of integrability

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bellon, M.; Maillard, J.M.; Viallet, C.

1992-06-01

In this paper the authors show that the Yang-Baxter equations for two-dimensional models admit as a group of symmetry the infinite discrete group A{sub 2}{sup (1)}. The existence of this symmetry explains the presence of a spectral parameter in the solutions of the equations. The authors show that similarly, for three-dimensional vertex models and the associated tetrahedron equations, there also exists an infinite discrete group of symmetry. Although generalizing naturally the previous one, it is a much bigger hyperbolic Coxeter group. The authors indicate how this symmetry can help to resolve the Yang-Baxter equations and their higher-dimensional generalizations and initiatemore » the study of three-dimensional vertex models. These symmetries are naturally represented as birational projective transformations. They may preserve non-trivial algebraic varieties, and lead to proper parametrizations of the models, be they integrable or not. The authors mention the relation existing between spin models and the Bose-Messner algebras of algebraic combinatorics. The authors' results also yield the generalization of the condition q{sup n} = 1 so often mentioned in the theory of quantum groups, when no q parameter is available.« less

Beyond terrestrial biology: charting the chemical universe of α-amino acid structures.

PubMed

Meringer, Markus; Cleaves, H James; Freeland, Stephen J

2013-11-25

α-Amino acids are fundamental to biochemistry as the monomeric building blocks with which cells construct proteins according to genetic instructions. However, the 20 amino acids of the standard genetic code represent a tiny fraction of the number of α-amino acid chemical structures that could plausibly play such a role, both from the perspective of natural processes by which life emerged and evolved, and from the perspective of human-engineered genetically coded proteins. Until now, efforts to describe the structures comprising this broader set, or even estimate their number, have been hampered by the complex combinatorial properties of organic molecules. Here, we use computer software based on graph theory and constructive combinatorics in order to conduct an efficient and exhaustive search of the chemical structures implied by two careful and precise definitions of the α-amino acids relevant to coded biological proteins. Our results include two virtual libraries of α-amino acid structures corresponding to these different approaches, comprising 121 044 and 3 846 structures, respectively, and suggest a simple approach to exploring much larger, as yet uncomputed, libraries of interest.

More on the decoder error probability for Reed-Solomon codes

NASA Technical Reports Server (NTRS)

Cheung, K.-M.

1987-01-01

The decoder error probability for Reed-Solomon codes (more generally, linear maximum distance separable codes) is examined. McEliece and Swanson offered an upper bound on P sub E (u), the decoder error probability given that u symbol errors occurs. This upper bound is slightly greater than Q, the probability that a completely random error pattern will cause decoder error. By using a combinatoric technique, the principle of inclusion and exclusion, an exact formula for P sub E (u) is derived. The P sub e (u) for the (255, 223) Reed-Solomon Code used by NASA, and for the (31,15) Reed-Solomon code (JTIDS code), are calculated using the exact formula, and the P sub E (u)'s are observed to approach the Q's of the codes rapidly as u gets larger. An upper bound for the expression is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P sub E (u) indeed approaches Q as u becomes large, and some laws of large numbers come into play.

NMR resonance splitting of urea in stretched hydrogels: proton exchange and (1)H/(2)H isotopologues.

PubMed

Kuchel, Philip W; Naumann, Christoph; Chapman, Bogdan E; Shishmarev, Dmitry; Håkansson, Pär; Bacskay, George; Hush, Noel S

2014-10-01

Urea at ∼12 M in concentrated gelatin gel, that was stretched, gave (1)H and (2)H NMR spectral splitting patterns that varied in a predictable way with changes in the relative proportions of (1)H2O and (2)H2O in the medium. This required consideration of the combinatorics of the two amide groups in urea that have a total of four protonation/deuteration sites giving rise to 16 different isotopologues, if all the atoms were separately identifiable. The rate constant that characterized the exchange of the protons with water was estimated by back-transformation analysis of 2D-EXSY spectra. There was no (1)H NMR spectral evidence that the chiral gelatin medium had caused in-equivalence in the protons bonded to each amide nitrogen atom. The spectral splitting patterns in (1)H and (2)H NMR spectra were accounted for by intra-molecular scalar and dipolar interactions, and quadrupolar interactions with the electric field gradients of the gelatin matrix, respectively. Copyright © 2014 Elsevier Inc. All rights reserved.

Heterocyclic energetic materials: Synthesis, characterization and computational design

NASA Astrophysics Data System (ADS)

Tsyshevsky, Roman; Pagoria, Philip; Smirnov, Aleksander; Kuklja, Maija

2017-06-01

Achievement of the tailored properties (high performance, low sensitivity, etc.) in targeted new energetic materials (EM) remains a great challenge. Recently, attention of researchers has shifted from conventional nitroester-, nitramine-, and nitroaromatic-based explosives to new heterocyclic EM with oxygen- and nitrogenrich molecular structures. They have increased densities and formation enthalpies complemented by attractive performance and high stability to external stimuli. We will demonstrate that oxadiazol-containing heterocycles offer a convenient playground to probe specific chemical functional groups as building blocks for design of EM. We discuss a joint experimental and computational approach for design, characterization, synthesis, and modeling of novel heterocyclic EM. Combinatorically, we comprehensively analyzed how overall stability and performance of each material in the family (BNFF, LLM-172, LLM-175, LLM-191, LLM-192, LLM-200) depends upon their chemical composition and details of the molecular structure (such as a substitution of a nitro group by an amino group and 1,2,5-oxadiazole fragment by 1,2,3- or 1,2,4-oxadiazol ring). We will also discuss proposed new EM with predicted superior chemical and physical properties. P. Pagoria, R. Tsyshevsky, A. Smirnov.

Planner-Based Control of Advanced Life Support Systems

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Kortenkamp, David; Fry, Chuck; Bell, Scott

2005-01-01

The paper describes an approach to the integration of qualitative and quantitative modeling techniques for advanced life support (ALS) systems. Developing reliable control strategies that scale up to fully integrated life support systems requires augmenting quantitative models and control algorithms with the abstractions provided by qualitative, symbolic models and their associated high-level control strategies. This will allow for effective management of the combinatorics due to the integration of a large number of ALS subsystems. By focusing control actions at different levels of detail and reactivity we can use faster: simpler responses at the lowest level and predictive but complex responses at the higher levels of abstraction. In particular, methods from model-based planning and scheduling can provide effective resource management over long time periods. We describe reference implementation of an advanced control system using the IDEA control architecture developed at NASA Ames Research Center. IDEA uses planning/scheduling as the sole reasoning method for predictive and reactive closed loop control. We describe preliminary experiments in planner-based control of ALS carried out on an integrated ALS simulation developed at NASA Johnson Space Center.

Two Methods for Efficient Solution of the Hitting-Set Problem

NASA Technical Reports Server (NTRS)

Vatan, Farrokh; Fijany, Amir

2005-01-01

A paper addresses much of the same subject matter as that of Fast Algorithms for Model-Based Diagnosis (NPO-30582), which appears elsewhere in this issue of NASA Tech Briefs. However, in the paper, the emphasis is more on the hitting-set problem (also known as the transversal problem), which is well known among experts in combinatorics. The authors primary interest in the hitting-set problem lies in its connection to the diagnosis problem: it is a theorem of model-based diagnosis that in the set-theory representation of the components of a system, the minimal diagnoses of a system are the minimal hitting sets of the system. In the paper, the hitting-set problem (and, hence, the diagnosis problem) is translated from a combinatorial to a computational problem by mapping it onto the Boolean satisfiability and integer- programming problems. The paper goes on to describe developments nearly identical to those summarized in the cited companion NASA Tech Briefs article, including the utilization of Boolean-satisfiability and integer- programming techniques to reduce the computation time and/or memory needed to solve the hitting-set problem.

Physics of Inference

NASA Astrophysics Data System (ADS)

Toroczkai, Zoltan

Jaynes's maximum entropy method provides a family of principled models that allow the prediction of a system's properties as constrained by empirical data (observables). However, their use is often hindered by the degeneracy problem characterized by spontaneous symmetry breaking, where predictions fail. Here we show that degeneracy appears when the corresponding density of states function is not log-concave, which is typically the consequence of nonlinear relationships between the constraining observables. We illustrate this phenomenon on several examples, including from complex networks, combinatorics and classical spin systems (e.g., Blume-Emery-Griffiths lattice-spin models). Exploiting these nonlinear relationships we then propose a solution to the degeneracy problem for a large class of systems via transformations that render the density of states function log-concave. The effectiveness of the method is demonstrated on real-world network data. Finally, we discuss the implications of these findings on the relationship between the geometrical properties of the density of states function and phase transitions in spin systems. Supported in part by Grant No. FA9550-12-1-0405 from AFOSR/DARPA and by Grant No. HDTRA 1-09-1-0039 from DTRA.

An Icosidodecahedral Supramolecule Based on Pentaphosphaferrocene: From a Disordered Average Structure to Individual Isomers

PubMed Central

Heindl, Claudia; Peresypkina, Eugenia; Virovets, Alexander V.; Bushmarinov, Ivan S.; Medvedev, Michael G.; Krämer, Barbara; Dittrich, Birger

2017-01-01

Abstract Pentaphosphaferrocenes [CpRFe(η5‐P5)] (1) and CuI halides are excellent building blocks for the formation of discrete supramolecules. Herein, we demonstrate the potential of Cu(CF3SO3) for the construction of the novel 2D polymer [{Cp*Fe(μ4,η5:1:1:1‐P5)}{Cu(CF3SO3)}]n (2) and the unprecedented nanosphere (CH2Cl2)1.4@[{CpBnFe(η5‐P5)}12{Cu(CF3SO3)}19.6] (3). The supramolecule 3 has a unique scaffold beyond the fullerene topology, with 20 copper atoms statistically distributed over the 30 vertices of an icosidodecahedron. Combinatorics was used to interpret the average disordered structure of the supramolecules. In this case, only two pairs of enantiomers with D5 and D2 symmetry are possible for bidentate bridging coordination of the triflate ligands. DFT calculations showed that differences in the energies of the isomers are negligible. The benzyl ligands enhance the solubility of 3, enabling NMR‐spectroscopic and mass‐spectrometric investigations. PMID:28793182

ChromBiSim: Interactive chromatin biclustering using a simple approach.

PubMed

Noureen, Nighat; Zohaib, Hafiz Muhammad; Qadir, Muhammad Abdul; Fazal, Sahar

2017-10-01

Combinatorial patterns of histone modifications sketch the epigenomic locale. Specific positions of these modifications in the genome are marked by the presence of such signals. Various methods highlight such patterns on global scale hence missing the local patterns which are the actual hidden combinatorics. We present ChromBiSim, an interactive tool for mining subsets of modifications from epigenomic profiles. ChromBiSim efficiently extracts biclusters with their genomic locations. It is the very first user interface based and multiple cell type handling tool for decoding the interplay of subsets of histone modifications combinations along their genomic locations. It displays the results in the forms of charts and heat maps in accordance with saving them in files which could be used for post analysis. ChromBiSim tested on multiple cell types produced in total 803 combinatorial patterns. It could be used to highlight variations among diseased versus normal cell types of any species. ChromBiSim is available at (http://sourceforge.net/projects/chrombisim) in C-sharp and python languages. Copyright © 2017 Elsevier Inc. All rights reserved.

The 6th International Conference on Computer Science and Computational Mathematics (ICCSCM 2017)

NASA Astrophysics Data System (ADS)

2017-09-01

The ICCSCM 2017 (The 6th International Conference on Computer Science and Computational Mathematics) has aimed to provide a platform to discuss computer science and mathematics related issues including Algebraic Geometry, Algebraic Topology, Approximation Theory, Calculus of Variations, Category Theory; Homological Algebra, Coding Theory, Combinatorics, Control Theory, Cryptology, Geometry, Difference and Functional Equations, Discrete Mathematics, Dynamical Systems and Ergodic Theory, Field Theory and Polynomials, Fluid Mechanics and Solid Mechanics, Fourier Analysis, Functional Analysis, Functions of a Complex Variable, Fuzzy Mathematics, Game Theory, General Algebraic Systems, Graph Theory, Group Theory and Generalizations, Image Processing, Signal Processing and Tomography, Information Fusion, Integral Equations, Lattices, Algebraic Structures, Linear and Multilinear Algebra; Matrix Theory, Mathematical Biology and Other Natural Sciences, Mathematical Economics and Financial Mathematics, Mathematical Physics, Measure Theory and Integration, Neutrosophic Mathematics, Number Theory, Numerical Analysis, Operations Research, Optimization, Operator Theory, Ordinary and Partial Differential Equations, Potential Theory, Real Functions, Rings and Algebras, Statistical Mechanics, Structure Of Matter, Topological Groups, Wavelets and Wavelet Transforms, 3G/4G Network Evolutions, Ad-Hoc, Mobile, Wireless Networks and Mobile Computing, Agent Computing & Multi-Agents Systems, All topics related Image/Signal Processing, Any topics related Computer Networks, Any topics related ISO SC-27 and SC- 17 standards, Any topics related PKI(Public Key Intrastructures), Artifial Intelligences(A.I.) & Pattern/Image Recognitions, Authentication/Authorization Issues, Biometric authentication and algorithms, CDMA/GSM Communication Protocols, Combinatorics, Graph Theory, and Analysis of Algorithms, Cryptography and Foundation of Computer Security, Data Base(D.B.) Management & Information Retrievals, Data Mining, Web Image Mining, & Applications, Defining Spectrum Rights and Open Spectrum Solutions, E-Comerce, Ubiquitous, RFID, Applications, Fingerprint/Hand/Biometrics Recognitions and Technologies, Foundations of High-performance Computing, IC-card Security, OTP, and Key Management Issues, IDS/Firewall, Anti-Spam mail, Anti-virus issues, Mobile Computing for E-Commerce, Network Security Applications, Neural Networks and Biomedical Simulations, Quality of Services and Communication Protocols, Quantum Computing, Coding, and Error Controls, Satellite and Optical Communication Systems, Theory of Parallel Processing and Distributed Computing, Virtual Visions, 3-D Object Retrievals, & Virtual Simulations, Wireless Access Security, etc. The success of ICCSCM 2017 is reflected in the received papers from authors around the world from several countries which allows a highly multinational and multicultural idea and experience exchange. The accepted papers of ICCSCM 2017 are published in this Book. Please check http://www.iccscm.com for further news. A conference such as ICCSCM 2017 can only become successful using a team effort, so herewith we want to thank the International Technical Committee and the Reviewers for their efforts in the review process as well as their valuable advices. We are thankful to all those who contributed to the success of ICCSCM 2017. The Secretary

Large-scale detection of repetitions

PubMed Central

Smyth, W. F.

2014-01-01

Combinatorics on words began more than a century ago with a demonstration that an infinitely long string with no repetitions could be constructed on an alphabet of only three letters. Computing all the repetitions (such as ⋯TTT⋯ or ⋯CGACGA⋯ ) in a given string x of length n is one of the oldest and most important problems of computational stringology, requiring time in the worst case. About a dozen years ago, it was discovered that repetitions can be computed as a by-product of the Θ(n)-time computation of all the maximal periodicities or runs in x. However, even though the computation is linear, it is also brute force: global data structures, such as the suffix array, the longest common prefix array and the Lempel–Ziv factorization, need to be computed in a preprocessing phase. Furthermore, all of this effort is required despite the fact that the expected number of runs in a string is generally a small fraction of the string length. In this paper, I explore the possibility that repetitions (perhaps also other regularities in strings) can be computed in a manner commensurate with the size of the output. PMID:24751872

Selective alignment of brain responses by task demands during semantic processing.

PubMed

Baggio, Giosuè

2012-04-01

The way the brain binds together words to form sentences may depend on whether and how the arising cognitive representation is to be used in behavior. The amplitude of the N400 effect in event-related brain potentials is inversely correlated with the degree of fit of a word's meaning into a semantic representation of the preceding discourse. This study reports a double dissociation in the latency characteristics of the N400 effect depending on task demands. When participants silently read words in a sentence context, without issuing a relevant overt response, greater temporal alignment over recording sites occurs for N400 onsets than peaks. If however a behavior is produced - here pressing a button in a binary probe selection task - exactly the opposite pattern is observed, with stronger alignment of N400 peaks than onsets. The peak amplitude of the N400 effect correlates best with the latency characteristic showing less temporal dispersion. These findings suggest that meaning construction in the brain is subtly affected by task demands, and that there is complex functional integration between semantic combinatorics and control systems handling behavioral goals. Copyright © 2012 Elsevier Ltd. All rights reserved.

Diagnosis by integrating model-based reasoning with knowledge-based reasoning

NASA Technical Reports Server (NTRS)

Bylander, Tom

1988-01-01

Our research investigates how observations can be categorized by integrating a qualitative physical model with experiential knowledge. Our domain is diagnosis of pathologic gait in humans, in which the observations are the gait motions, muscle activity during gait, and physical exam data, and the diagnostic hypotheses are the potential muscle weaknesses, muscle mistimings, and joint restrictions. Patients with underlying neurological disorders typically have several malfunctions. Among the problems that need to be faced are: the ambiguity of the observations, the ambiguity of the qualitative physical model, correspondence of the observations and hypotheses to the qualitative physical model, the inherent uncertainty of experiential knowledge, and the combinatorics involved in forming composite hypotheses. Our system divides the work so that the knowledge-based reasoning suggests which hypotheses appear more likely than others, the qualitative physical model is used to determine which hypotheses explain which observations, and another process combines these functionalities to construct a composite hypothesis based on explanatory power and plausibility. We speculate that the reasoning architecture of our system is generally applicable to complex domains in which a less-than-perfect physical model and less-than-perfect experiential knowledge need to be combined to perform diagnosis.

MsViz: A Graphical Software Tool for In-Depth Manual Validation and Quantitation of Post-translational Modifications.

PubMed

Martín-Campos, Trinidad; Mylonas, Roman; Masselot, Alexandre; Waridel, Patrice; Petricevic, Tanja; Xenarios, Ioannis; Quadroni, Manfredo

2017-08-04

Mass spectrometry (MS) has become the tool of choice for the large scale identification and quantitation of proteins and their post-translational modifications (PTMs). This development has been enabled by powerful software packages for the automated analysis of MS data. While data on PTMs of thousands of proteins can nowadays be readily obtained, fully deciphering the complexity and combinatorics of modification patterns even on a single protein often remains challenging. Moreover, functional investigation of PTMs on a protein of interest requires validation of the localization and the accurate quantitation of its changes across several conditions, tasks that often still require human evaluation. Software tools for large scale analyses are highly efficient but are rarely conceived for interactive, in-depth exploration of data on individual proteins. We here describe MsViz, a web-based and interactive software tool that supports manual validation of PTMs and their relative quantitation in small- and medium-size experiments. The tool displays sequence coverage information, peptide-spectrum matches, tandem MS spectra and extracted ion chromatograms through a single, highly intuitive interface. We found that MsViz greatly facilitates manual data inspection to validate PTM location and quantitate modified species across multiple samples.

A combinatorial approach to angiosperm pollen morphology.

PubMed

Mander, Luke

2016-11-30

Angiosperms (flowering plants) are strikingly diverse. This is clearly expressed in the morphology of their pollen grains, which are characterized by enormous variety in their shape and patterning. In this paper, I approach angiosperm pollen morphology from the perspective of enumerative combinatorics. This involves generating angiosperm pollen morphotypes by algorithmically combining character states and enumerating the results of these combinations. I use this approach to generate 3 643 200 pollen morphotypes, which I visualize using a parallel-coordinates plot. This represents a raw morphospace. To compare real-world and theoretical morphologies, I map the pollen of 1008 species of Neotropical angiosperms growing on Barro Colorado Island (BCI), Panama, onto this raw morphospace. This highlights that, in addition to their well-documented taxonomic diversity, Neotropical rainforests also represent an enormous reservoir of morphological diversity. Angiosperm pollen morphospace at BCI has been filled mostly by pollen morphotypes that are unique to single plant species. Repetition of pollen morphotypes among higher taxa at BCI reflects both constraint and convergence. This combinatorial approach to morphology addresses the complexity that results from large numbers of discrete character combinations and could be employed in any situation where organismal form can be captured by discrete morphological characters. © 2016 The Author(s).

A combinatorial approach to angiosperm pollen morphology

PubMed Central

2016-01-01

Angiosperms (flowering plants) are strikingly diverse. This is clearly expressed in the morphology of their pollen grains, which are characterized by enormous variety in their shape and patterning. In this paper, I approach angiosperm pollen morphology from the perspective of enumerative combinatorics. This involves generating angiosperm pollen morphotypes by algorithmically combining character states and enumerating the results of these combinations. I use this approach to generate 3 643 200 pollen morphotypes, which I visualize using a parallel-coordinates plot. This represents a raw morphospace. To compare real-world and theoretical morphologies, I map the pollen of 1008 species of Neotropical angiosperms growing on Barro Colorado Island (BCI), Panama, onto this raw morphospace. This highlights that, in addition to their well-documented taxonomic diversity, Neotropical rainforests also represent an enormous reservoir of morphological diversity. Angiosperm pollen morphospace at BCI has been filled mostly by pollen morphotypes that are unique to single plant species. Repetition of pollen morphotypes among higher taxa at BCI reflects both constraint and convergence. This combinatorial approach to morphology addresses the complexity that results from large numbers of discrete character combinations and could be employed in any situation where organismal form can be captured by discrete morphological characters. PMID:27881756

Methods in Symbolic Computation and p-Adic Valuations of Polynomials

NASA Astrophysics Data System (ADS)

Guan, Xiao

Symbolic computation has widely appear in many mathematical fields such as combinatorics, number theory and stochastic processes. The techniques created in the area of experimental mathematics provide us efficient ways of symbolic computing and verification of complicated relations. Part I consists of three problems. The first one focuses on a unimodal sequence derived from a quartic integral. Many of its properties are explored with the help of hypergeometric representations and automatic proofs. The second problem tackles the generating function of the reciprocal of Catalan number. It springs from the closed form given by Mathematica. Furthermore, three methods in special functions are used to justify this result. The third issue addresses the closed form solutions for the moments of products of generalized elliptic integrals , which combines the experimental mathematics and classical analysis. Part II concentrates on the p-adic valuations of polynomials from the perspective of trees. For a given polynomial f( n) indexed in positive integers, the package developed in Mathematica will create certain tree structure following a couple of rules. The evolution of such trees are studied both rigorously and experimentally from the view of field extension, nonparametric statistics and random matrix.

Modular techniques for dynamic fault-tree analysis

NASA Technical Reports Server (NTRS)

Patterson-Hine, F. A.; Dugan, Joanne B.

1992-01-01

It is noted that current approaches used to assess the dependability of complex systems such as Space Station Freedom and the Air Traffic Control System are incapable of handling the size and complexity of these highly integrated designs. A novel technique for modeling such systems which is built upon current techniques in Markov theory and combinatorial analysis is described. It enables the development of a hierarchical representation of system behavior which is more flexible than either technique alone. A solution strategy which is based on an object-oriented approach to model representation and evaluation is discussed. The technique is virtually transparent to the user since the fault tree models can be built graphically and the objects defined automatically. The tree modularization procedure allows the two model types, Markov and combinatoric, to coexist and does not require that the entire fault tree be translated to a Markov chain for evaluation. This effectively reduces the size of the Markov chain required and enables solutions with less truncation, making analysis of longer mission times possible. Using the fault-tolerant parallel processor as an example, a model is built and solved for a specific mission scenario and the solution approach is illustrated in detail.

Combinatorics of aliphatic amino acids

NASA Astrophysics Data System (ADS)

Grützmann, Konrad; Böcker, Sebastian; Schuster, Stefan

2011-01-01

This study combines biology and mathematics, showing that a relatively simple question from molecular biology can lead to complicated mathematics. The question is how to calculate the number of theoretically possible aliphatic amino acids as a function of the number of carbon atoms in the side chain. The presented calculation is based on earlier results from theoretical chemistry concerning alkyl compounds. Mathematical properties of this number series are highlighted. We discuss which of the theoretically possible structures really occur in living organisms, such as leucine and isoleucine with a chain length of four. This is done both for a strict definition of aliphatic amino acids only involving carbon and hydrogen atoms in their side chain and for a less strict definition allowing sulphur, nitrogen and oxygen atoms. While the main focus is on proteinogenic amino acids, we also give several examples of non-proteinogenic aliphatic amino acids, playing a role, for instance, in signalling. The results are in agreement with a general phenomenon found in biology: Usually, only a small number of molecules are chosen as building blocks to assemble an inconceivable number of different macromolecules as proteins. Thus, natural biological complexity arises from the multifarious combination of building blocks.

Entangled spin chain

NASA Astrophysics Data System (ADS)

Salberger, Olof; Korepin, Vladimir

We introduce a new model of interacting spin 1/2. It describes interactions of three nearest neighbors. The Hamiltonian can be expressed in terms of Fredkin gates. The Fredkin gate (also known as the controlled swap gate) is a computational circuit suitable for reversible computing. Our construction generalizes the model presented by Peter Shor and Ramis Movassagh to half-integer spins. Our model can be solved by means of Catalan combinatorics in the form of random walks on the upper half plane of a square lattice (Dyck walks). Each Dyck path can be mapped on a wave function of spins. The ground state is an equally weighted superposition of Dyck walks (instead of Motzkin walks). We can also express it as a matrix product state. We further construct a model of interacting spins 3/2 and greater half-integer spins. The models with higher spins require coloring of Dyck walks. We construct a SU(k) symmetric model (where k is the number of colors). The leading term of the entanglement entropy is then proportional to the square root of the length of the lattice (like in the Shor-Movassagh model). The gap closes as a high power of the length of the lattice [5, 11].

Impedance feedback control of microfluidic valves for reliable post processing combinatorial droplet injection.

PubMed

Axt, Brant; Hsieh, Yi-Fan; Nalayanda, Divya; Wang, Tza-Huei

2017-09-01

Droplet microfluidics has found use in many biological assay applications as a means of high-throughput sample processing. One of the challenges of the technology, however, is the ability to control and merge droplets on-demand as they flow through the microdevices. It is in the interest of developing lab-on-chip devices to be able to combinatorically program additive mixing steps for more complex multistep and multiplex assays. Existing technologies to merge droplets are either passive in nature or require highly predictable droplet movement for feedforward control, making them vulnerable to errors during high throughput operation. In this paper, we describe and demonstrate a microfluidic valve-based device for the purpose of combinatorial droplet injection at any stage in a multistep assay. Microfluidic valves are used to robustly control fluid flow, droplet generation, and droplet mixing in the device on-demand, while on-chip impedance measurements taken in real time are used as feedback to accurately time the droplet injections. The presented system is contrasted to attempts without feedback, and is shown to be 100% reliable over long durations. Additionally, content detection and discretionary injections are explored and successfully executed.

A flexible data fusion architecture for persistent surveillance using ultra-low-power wireless sensor networks

NASA Astrophysics Data System (ADS)

Hanson, Jeffrey A.; McLaughlin, Keith L.; Sereno, Thomas J.

2011-06-01

We have developed a flexible, target-driven, multi-modal, physics-based fusion architecture that efficiently searches sensor detections for targets and rejects clutter while controlling the combinatoric problems that commonly arise in datadriven fusion systems. The informational constraints imposed by long lifetime requirements make systems vulnerable to false alarms. We demonstrate that our data fusion system significantly reduces false alarms while maintaining high sensitivity to threats. In addition, mission goals can vary substantially in terms of targets-of-interest, required characterization, acceptable latency, and false alarm rates. Our fusion architecture provides the flexibility to match these trade-offs with mission requirements unlike many conventional systems that require significant modifications for each new mission. We illustrate our data fusion performance with case studies that span many of the potential mission scenarios including border surveillance, base security, and infrastructure protection. In these studies, we deployed multi-modal sensor nodes - including geophones, magnetometers, accelerometers and PIR sensors - with low-power processing algorithms and low-bandwidth wireless mesh networking to create networks capable of multi-year operation. The results show our data fusion architecture maintains high sensitivities while suppressing most false alarms for a variety of environments and targets.

Harnessing the Bethe free energy†

PubMed Central

Bapst, Victor

2016-01-01

ABSTRACT A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few variables and either encourage or discourage certain value combinations. Examples include the k‐SAT problem or the Ising model. Such models naturally induce a Gibbs measure on the set of assignments, which is characterised by its partition function. The present paper deals with the partition function of problems where the interactions between variables and constraints are induced by a sparse random (hyper)graph. According to physics predictions, a generic recipe called the “replica symmetric cavity method” yields the correct value of the partition function if the underlying model enjoys certain properties [Krzkala et al., PNAS (2007) 10318–10323]. Guided by this conjecture, we prove general sufficient conditions for the success of the cavity method. The proofs are based on a “regularity lemma” for probability measures on sets of the form Ωn for a finite Ω and a large n that may be of independent interest. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 694–741, 2016 PMID:28035178

Probabilistic Reasoning for Robustness in Automated Planning

NASA Technical Reports Server (NTRS)

Schaffer, Steven; Clement, Bradley; Chien, Steve

2007-01-01

A general-purpose computer program for planning the actions of a spacecraft or other complex system has been augmented by incorporating a subprogram that reasons about uncertainties in such continuous variables as times taken to perform tasks and amounts of resources to be consumed. This subprogram computes parametric probability distributions for time and resource variables on the basis of user-supplied models of actions and resources that they consume. The current system accepts bounded Gaussian distributions over action duration and resource use. The distributions are then combined during planning to determine the net probability distribution of each resource at any time point. In addition to a full combinatoric approach, several approximations for arriving at these combined distributions are available, including maximum-likelihood and pessimistic algorithms. Each such probability distribution can then be integrated to obtain a probability that execution of the plan under consideration would violate any constraints on the resource. The key idea is to use these probabilities of conflict to score potential plans and drive a search toward planning low-risk actions. An output plan provides a balance between the user s specified averseness to risk and other measures of optimality.

Self-assembly programming of DNA polyominoes.

PubMed

Ong, Hui San; Syafiq-Rahim, Mohd; Kasim, Noor Hayaty Abu; Firdaus-Raih, Mohd; Ramlan, Effirul Ikhwan

2016-10-20

Fabrication of functional DNA nanostructures operating at a cellular level has been accomplished through molecular programming techniques such as DNA origami and single-stranded tiles (SST). During implementation, restrictive and constraint dependent designs are enforced to ensure conformity is attainable. We propose a concept of DNA polyominoes that promotes flexibility in molecular programming. The fabrication of complex structures is achieved through self-assembly of distinct heterogeneous shapes (i.e., self-organised optimisation among competing DNA basic shapes) with total flexibility during the design and assembly phases. In this study, the plausibility of the approach is validated using the formation of multiple 3×4 DNA network fabricated from five basic DNA shapes with distinct configurations (monomino, tromino and tetrominoes). Computational tools to aid the design of compatible DNA shapes and the structure assembly assessment are presented. The formations of the desired structures were validated using Atomic Force Microscopy (AFM) imagery. Five 3×4 DNA networks were successfully constructed using combinatorics of these five distinct DNA heterogeneous shapes. Our findings revealed that the construction of DNA supra-structures could be achieved using a more natural-like orchestration as compared to the rigid and restrictive conventional approaches adopted previously. Copyright © 2016 Elsevier B.V. All rights reserved.

Co-complex protein membership evaluation using Maximum Entropy on GO ontology and InterPro annotation.

PubMed

Armean, Irina M; Lilley, Kathryn S; Trotter, Matthew W B; Pilkington, Nicholas C V; Holden, Sean B

2018-06-01

Protein-protein interactions (PPI) play a crucial role in our understanding of protein function and biological processes. The standardization and recording of experimental findings is increasingly stored in ontologies, with the Gene Ontology (GO) being one of the most successful projects. Several PPI evaluation algorithms have been based on the application of probabilistic frameworks or machine learning algorithms to GO properties. Here, we introduce a new training set design and machine learning based approach that combines dependent heterogeneous protein annotations from the entire ontology to evaluate putative co-complex protein interactions determined by empirical studies. PPI annotations are built combinatorically using corresponding GO terms and InterPro annotation. We use a S.cerevisiae high-confidence complex dataset as a positive training set. A series of classifiers based on Maximum Entropy and support vector machines (SVMs), each with a composite counterpart algorithm, are trained on a series of training sets. These achieve a high performance area under the ROC curve of ≤0.97, outperforming go2ppi-a previously established prediction tool for protein-protein interactions (PPI) based on Gene Ontology (GO) annotations. https://github.com/ima23/maxent-ppi. sbh11@cl.cam.ac.uk. Supplementary data are available at Bioinformatics online.

Developments in the ATLAS Tracking Software ahead of LHC Run 2

NASA Astrophysics Data System (ADS)

Styles, Nicholas; Bellomo, Massimiliano; Salzburger, Andreas; ATLAS Collaboration

2015-05-01

After a hugely successful first run, the Large Hadron Collider (LHC) is currently in a shut-down period, during which essential maintenance and upgrades are being performed on the accelerator. The ATLAS experiment, one of the four large LHC experiments has also used this period for consolidation and further developments of the detector and of its software framework, ahead of the new challenges that will be brought by the increased centre-of-mass energy and instantaneous luminosity in the next run period. This is of particular relevance for the ATLAS Tracking software, responsible for reconstructing the trajectory of charged particles through the detector, which faces a steep increase in CPU consumption due to the additional combinatorics of the high-multiplicity environment. The steps taken to mitigate this increase and stay within the available computing resources while maintaining the excellent performance of the tracking software in terms of the information provided to the physics analyses will be presented. Particular focus will be given to changes to the Event Data Model, replacement of the maths library, and adoption of a new persistent output format. The resulting CPU profiling results will be discussed, as well as the performance of the algorithms for physics processes under the expected conditions for the next LHC run.

Magic star puzzle for educational mathematics

NASA Astrophysics Data System (ADS)

Gan, Yee Siang; Fong, Wan Heng; Sarmin, Nor Haniza

2013-04-01

One of the interesting fields in recreational mathematics is the magic number arrangement. There are different kinds of arrays in the arrangement for a group of numbers. In particular, one of the arrays in magic number arrangement is called magic star. In fact, magic star involves combinatorics that contributes to geometrical analysis and number theory. Hence, magic star is suitable to be introduced as educational mathematics to cultivate interest in different area of mathematics. To obtain the solutions of normal magic stars of order six, the possible sets of numbers for every line in a magic star have been considered. Previously, the calculation for obtaining the solutions has been done manually which is time-consuming. Therefore, a programming code to generate all the fundamental solutions for normal magic star of order six without including the properties of rotation and reflection has been done. In this puzzle, a magic star puzzle is created by using Matlab software, which enables a user to verify the entries for the cells of magic star of order six. Moreover, it is also user-friendly as it provides interactive commands on the inputs given by the user, which enables the user to detect the incorrect inputs. In addition, user can also choose to view all the fundamental solutions as generated by the programming code.

A combinatorial morphospace for angiosperm pollen

NASA Astrophysics Data System (ADS)

Mander, Luke

2016-04-01

The morphology of angiosperm (flowering plant) pollen is extraordinarily diverse. This diversity results from variations in the morphology of discrete anatomical components. These components include the overall shape of a pollen grain, the stratification of the exine, the number and form of any apertures, the type of dispersal unit, and the nature of any surface ornamentation. Different angiosperm pollen morphotypes reflect different combinations of these discrete components. In this talk, I ask the following question: given the anatomical components of angiosperm pollen that are known to exist in the plant kingdom, how many unique biologically plausible combinations of these components are there? I explore this question from the perspective of enumerative combinatorics using an algorithm I have written in the Python programming language. This algorithm (1) calculates the number of combinations of these components; (2) enumerates those combinations; and (3) graphically displays those combinations. The result is a combinatorial morphospace that reflects an underlying notion that the process of morphogenesis in angiosperm pollen can be thought of as an n choose k counting problem. I compare the morphology of extant and fossil angiosperm pollen grains to this morphospace, and suggest that from a combinatorial point of view angiosperm pollen is not as diverse as it could be, which may be a result of developmental constraints.

On Special Functions in the Context of Clifford Analysis

NASA Astrophysics Data System (ADS)

Malonek, H. R.; Falcão, M. I.

2010-09-01

Considering the foundation of Quaternionic Analysis by R. Fueter and his collaborators in the beginning of the 1930s as starting point of Clifford Analysis, we can look back to 80 years of work in this field. However the interest in multivariate analysis using Clifford algebras only started to grow significantly in the 70s. Since then a great amount of papers on Clifford Analysis referring different classes of Special Functions have appeared. This situation may have been triggered by a more systematic treatment of monogenic functions by their multiple series development derived from Gegenbauer or associated Legendre polynomials (and not only by their integral representation). Also approaches to Special Functions by means of algebraic methods, either Lie algebras or through Lie groups and symmetric spaces gained by that time importance and influenced their treatment in Clifford Analysis. In our talk we will rely on the generalization of the classical approach to Special Functions through differential equations with respect to the hypercomplex derivative, which is a more recently developed tool in Clifford Analysis. In this context special attention will be payed to the role of Special Functions as intermediator between continuous and discrete mathematics. This corresponds to a more recent trend in combinatorics, since it has been revealed that many algebraic structures have hidden combinatorial underpinnings.

Coalescent histories for caterpillar-like families.

PubMed

Rosenberg, Noah A

2013-01-01

A coalescent history is an assignment of branches of a gene tree to branches of a species tree on which coalescences in the gene tree occur. The number of coalescent histories for a pair consisting of a labeled gene tree topology and a labeled species tree topology is important in gene tree probability computations, and more generally, in studying evolutionary possibilities for gene trees on species trees. Defining the Tr-caterpillar-like family as a sequence of n-taxon trees constructed by replacing the r-taxon subtree of n-taxon caterpillars by a specific r-taxon labeled topology Tr, we examine the number of coalescent histories for caterpillar-like families with matching gene tree and species tree labeled topologies. For each Tr with size r≤8, we compute the number of coalescent histories for n-taxon trees in the Tr-caterpillar-like family. Next, as n→∞, we find that the limiting ratio of the numbers of coalescent histories for the Tr family and caterpillars themselves is correlated with the number of labeled histories for Tr. The results support a view that large numbers of coalescent histories occur when a tree has both a relatively balanced subtree and a high tree depth, contributing to deeper understanding of the combinatorics of gene trees and species trees.

Analytic first derivatives for a spin-adapted open-shell coupled cluster theory: Evaluation of first-order electrical properties

DOE Office of Scientific and Technical Information (OSTI.GOV)

Datta, Dipayan, E-mail: datta@uni-mainz.de; Gauss, Jürgen, E-mail: gauss@uni-mainz.de

2014-09-14

An analytic scheme is presented for the evaluation of first derivatives of the energy for a unitary group based spin-adapted coupled cluster (CC) theory, namely, the combinatoric open-shell CC (COSCC) approach within the singles and doubles approximation. The widely used Lagrange multiplier approach is employed for the derivation of an analytical expression for the first derivative of the energy, which in combination with the well-established density-matrix formulation, is used for the computation of first-order electrical properties. Derivations of the spin-adapted lambda equations for determining the Lagrange multipliers and the expressions for the spin-free effective density matrices for the COSCC approachmore » are presented. Orbital-relaxation effects due to the electric-field perturbation are treated via the Z-vector technique. We present calculations of the dipole moments for a number of doublet radicals in their ground states using restricted open-shell Hartree-Fock (ROHF) and quasi-restricted HF (QRHF) orbitals in order to demonstrate the applicability of our analytic scheme for computing energy derivatives. We also report calculations of the chlorine electric-field gradients and nuclear quadrupole-coupling constants for the CCl, CH{sub 2}Cl, ClO{sub 2}, and SiCl radicals.« less

The hypergraph regularity method and its applications

PubMed Central

Rödl, V.; Nagle, B.; Skokan, J.; Schacht, M.; Kohayakawa, Y.

2005-01-01

Szemerédi's regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a given isomorphism type, yielding the so-called counting lemma for graphs. The combined application of these two lemmas is known as the regularity method for graphs and has proved useful in graph theory, combinatorial geometry, combinatorial number theory, and theoretical computer science. Here, we report on recent advances in the regularity method for k-uniform hypergraphs, for arbitrary k ≥ 2. This method, purely combinatorial in nature, gives alternative proofs of density theorems originally due to E. Szemerédi, H. Furstenberg, and Y. Katznelson. Further results in extremal combinatorics also have been obtained with this approach. The two main components of the regularity method for k-uniform hypergraphs, the regularity lemma and the counting lemma, have been obtained recently: Rödl and Skokan (based on earlier work of Frankl and Rödl) generalized Szemerédi's regularity lemma to k-uniform hypergraphs, and Nagle, Rödl, and Schacht succeeded in proving a counting lemma accompanying the Rödl–Skokan hypergraph regularity lemma. The counting lemma is proved by reducing the counting problem to a simpler one previously investigated by Kohayakawa, Rödl, and Skokan. Similar results were obtained independently by W. T. Gowers, following a different approach. PMID:15919821

Mining for recurrent long-range interactions in RNA structures reveals embedded hierarchies in network families.

PubMed

Reinharz, Vladimir; Soulé, Antoine; Westhof, Eric; Waldispühl, Jérôme; Denise, Alain

2018-05-04

The wealth of the combinatorics of nucleotide base pairs enables RNA molecules to assemble into sophisticated interaction networks, which are used to create complex 3D substructures. These interaction networks are essential to shape the 3D architecture of the molecule, and also to provide the key elements to carry molecular functions such as protein or ligand binding. They are made of organised sets of long-range tertiary interactions which connect distinct secondary structure elements in 3D structures. Here, we present a de novo data-driven approach to extract automatically from large data sets of full RNA 3D structures the recurrent interaction networks (RINs). Our methodology enables us for the first time to detect the interaction networks connecting distinct components of the RNA structure, highlighting their diversity and conservation through non-related functional RNAs. We use a graphical model to perform pairwise comparisons of all RNA structures available and to extract RINs and modules. Our analysis yields a complete catalog of RNA 3D structures available in the Protein Data Bank and reveals the intricate hierarchical organization of the RNA interaction networks and modules. We assembled our results in an online database (http://carnaval.lri.fr) which will be regularly updated. Within the site, a tool allows users with a novel RNA structure to detect automatically whether the novel structure contains previously observed RINs.

RNA Secondary Structure Prediction by Using Discrete Mathematics: An Interdisciplinary Research Experience for Undergraduate Students

PubMed Central

Ellington, Roni; Wachira, James

2010-01-01

The focus of this Research Experience for Undergraduates (REU) project was on RNA secondary structure prediction by using a lattice walk approach. The lattice walk approach is a combinatorial and computational biology method used to enumerate possible secondary structures and predict RNA secondary structure from RNA sequences. The method uses discrete mathematical techniques and identifies specified base pairs as parameters. The goal of the REU was to introduce upper-level undergraduate students to the principles and challenges of interdisciplinary research in molecular biology and discrete mathematics. At the beginning of the project, students from the biology and mathematics departments of a mid-sized university received instruction on the role of secondary structure in the function of eukaryotic RNAs and RNA viruses, RNA related to combinatorics, and the National Center for Biotechnology Information resources. The student research projects focused on RNA secondary structure prediction on a regulatory region of the yellow fever virus RNA genome and on an untranslated region of an mRNA of a gene associated with the neurological disorder epilepsy. At the end of the project, the REU students gave poster and oral presentations, and they submitted written final project reports to the program director. The outcome of the REU was that the students gained transferable knowledge and skills in bioinformatics and an awareness of the applications of discrete mathematics to biological research problems. PMID:20810968

RNA secondary structure prediction by using discrete mathematics: an interdisciplinary research experience for undergraduate students.

PubMed

Ellington, Roni; Wachira, James; Nkwanta, Asamoah

2010-01-01

The focus of this Research Experience for Undergraduates (REU) project was on RNA secondary structure prediction by using a lattice walk approach. The lattice walk approach is a combinatorial and computational biology method used to enumerate possible secondary structures and predict RNA secondary structure from RNA sequences. The method uses discrete mathematical techniques and identifies specified base pairs as parameters. The goal of the REU was to introduce upper-level undergraduate students to the principles and challenges of interdisciplinary research in molecular biology and discrete mathematics. At the beginning of the project, students from the biology and mathematics departments of a mid-sized university received instruction on the role of secondary structure in the function of eukaryotic RNAs and RNA viruses, RNA related to combinatorics, and the National Center for Biotechnology Information resources. The student research projects focused on RNA secondary structure prediction on a regulatory region of the yellow fever virus RNA genome and on an untranslated region of an mRNA of a gene associated with the neurological disorder epilepsy. At the end of the project, the REU students gave poster and oral presentations, and they submitted written final project reports to the program director. The outcome of the REU was that the students gained transferable knowledge and skills in bioinformatics and an awareness of the applications of discrete mathematics to biological research problems.

Hoeffding Type Inequalities and their Applications in Statistics and Operations Research

NASA Astrophysics Data System (ADS)

Daras, Tryfon

2007-09-01

Large Deviation theory is the branch of Probability theory that deals with rare events. Sometimes, these events can be described by the sum of random variables that deviates from its mean more than a "normal" amount. A precise calculation of the probabilities of such events turns out to be crucial in a variety of different contents (e.g. in Probability Theory, Statistics, Operations Research, Statistical Physics, Financial Mathematics e.t.c.). Recent applications of the theory deal with random walks in random environments, interacting diffusions, heat conduction, polymer chains [1]. In this paper we prove an inequality of exponential type, namely theorem 2.1, which gives a large deviation upper bound for a specific sequence of r.v.s. Inequalities of this type have many applications in Combinatorics [2]. The inequality generalizes already proven results of this type, in the case of symmetric probability measures. We get as consequences to the inequality: (a) large deviations upper bounds for exchangeable Bernoulli sequences of random variables, generalizing results proven for independent and identically distributed Bernoulli sequences of r.v.s. and (b) a general form of Bernstein's inequality. We compare the inequality with large deviation results already proven by the author and try to see its advantages. Finally, using the inequality, we solve one of the basic problems of Operations Research (bin packing problem) in the case of exchangeable r.v.s.

A brief historical introduction to Euler's formula for polyhedra, topology, graph theory and networks

NASA Astrophysics Data System (ADS)

Debnath, Lokenath

2010-09-01

This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Königsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included.

A note on probabilistic models over strings: the linear algebra approach.

PubMed

Bouchard-Côté, Alexandre

2013-12-01

Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems.

Markov chains at the interface of combinatorics, computing, and statistical physics

NASA Astrophysics Data System (ADS)

Streib, Amanda Pascoe

The fields of statistical physics, discrete probability, combinatorics, and theoretical computer science have converged around efforts to understand random structures and algorithms. Recent activity in the interface of these fields has enabled tremendous breakthroughs in each domain and has supplied a new set of techniques for researchers approaching related problems. This thesis makes progress on several problems in this interface whose solutions all build on insights from multiple disciplinary perspectives. First, we consider a dynamic growth process arising in the context of DNA-based self-assembly. The assembly process can be modeled as a simple Markov chain. We prove that the chain is rapidly mixing for large enough bias in regions of Zd. The proof uses a geometric distance function and a variant of path coupling in order to handle distances that can be exponentially large. We also provide the first results in the case of fluctuating bias, where the bias can vary depending on the location of the tile, which arises in the nanotechnology application. Moreover, we use intuition from statistical physics to construct a choice of the biases for which the Markov chain Mmon requires exponential time to converge. Second, we consider a related problem regarding the convergence rate of biased permutations that arises in the context of self-organizing lists. The Markov chain Mnn in this case is a nearest-neighbor chain that allows adjacent transpositions, and the rate of these exchanges is governed by various input parameters. It was conjectured that the chain is always rapidly mixing when the inversion probabilities are positively biased, i.e., we put nearest neighbor pair x < y in order with bias 1/2 ≤ pxy ≤ 1 and out of order with bias 1 - pxy. The Markov chain Mmon was known to have connections to a simplified version of this biased card-shuffling. We provide new connections between Mnn and Mmon by using simple combinatorial bijections, and we prove that Mnn is always rapidly mixing for two general classes of positively biased { pxy}. More significantly, we also prove that the general conjecture is false by exhibiting values for the pxy, with 1/2 ≤ pxy ≤ 1 for all x < y, but for which the transposition chain will require exponential time to converge. Finally, we consider a model of colloids, which are binary mixtures of molecules with one type of molecule suspended in another. It is believed that at low density typical configurations will be well-mixed throughout, while at high density they will separate into clusters. This clustering has proved elusive to verify, since all local sampling algorithms are known to be inefficient at high density, and in fact a new nonlocal algorithm was recently shown to require exponential time in some cases. We characterize the high and low density phases for a general family of discrete interfering binary mixtures by showing that they exhibit a "clustering property" at high density and not at low density. The clustering property states that there will be a region that has very high area, very small perimeter, and high density of one type of molecule. Special cases of interfering binary mixtures include the Ising model at fixed magnetization and independent sets.

Supercritical entanglement in local systems: Counterexample to the area law for quantum matter.

PubMed

Movassagh, Ramis; Shor, Peter W

2016-11-22

Quantum entanglement is the most surprising feature of quantum mechanics. Entanglement is simultaneously responsible for the difficulty of simulating quantum matter on a classical computer and the exponential speedups afforded by quantum computers. Ground states of quantum many-body systems typically satisfy an "area law": The amount of entanglement between a subsystem and the rest of the system is proportional to the area of the boundary. A system that obeys an area law has less entanglement and can be simulated more efficiently than a generic quantum state whose entanglement could be proportional to the total system's size. Moreover, an area law provides useful information about the low-energy physics of the system. It is widely believed that for physically reasonable quantum systems, the area law cannot be violated by more than a logarithmic factor in the system's size. We introduce a class of exactly solvable one-dimensional physical models which we can prove have exponentially more entanglement than suggested by the area law, and violate the area law by a square-root factor. This work suggests that simple quantum matter is richer and can provide much more quantum resources (i.e., entanglement) than expected. In addition to using recent advances in quantum information and condensed matter theory, we have drawn upon various branches of mathematics such as combinatorics of random walks, Brownian excursions, and fractional matching theory. We hope that the techniques developed herein may be useful for other problems in physics as well.

Supercritical entanglement in local systems: Counterexample to the area law for quantum matter

PubMed Central

Movassagh, Ramis; Shor, Peter W.

2016-01-01

Quantum entanglement is the most surprising feature of quantum mechanics. Entanglement is simultaneously responsible for the difficulty of simulating quantum matter on a classical computer and the exponential speedups afforded by quantum computers. Ground states of quantum many-body systems typically satisfy an “area law”: The amount of entanglement between a subsystem and the rest of the system is proportional to the area of the boundary. A system that obeys an area law has less entanglement and can be simulated more efficiently than a generic quantum state whose entanglement could be proportional to the total system’s size. Moreover, an area law provides useful information about the low-energy physics of the system. It is widely believed that for physically reasonable quantum systems, the area law cannot be violated by more than a logarithmic factor in the system’s size. We introduce a class of exactly solvable one-dimensional physical models which we can prove have exponentially more entanglement than suggested by the area law, and violate the area law by a square-root factor. This work suggests that simple quantum matter is richer and can provide much more quantum resources (i.e., entanglement) than expected. In addition to using recent advances in quantum information and condensed matter theory, we have drawn upon various branches of mathematics such as combinatorics of random walks, Brownian excursions, and fractional matching theory. We hope that the techniques developed herein may be useful for other problems in physics as well. PMID:27821725

Perturbative Power Counting, Lowest-Index Operators and Their Renormalization in Standard Model Effective Field Theory

NASA Astrophysics Data System (ADS)

Liao, Yi; Ma, Xiao-Dong

2018-03-01

We study two aspects of higher dimensional operators in standard model effective field theory. We first introduce a perturbative power counting rule for the entries in the anomalous dimension matrix of operators with equal mass dimension. The power counting is determined by the number of loops and the difference of the indices of the two operators involved, which in turn is defined by assuming that all terms in the standard model Lagrangian have an equal perturbative power. Then we show that the operators with the lowest index are unique at each mass dimension d, i.e., (H † H) d/2 for even d ≥ 4, and (LT∈ H)C(LT∈ H) T (H † H)(d-5)/2 for odd d ≥ 5. Here H, L are the Higgs and lepton doublet, and ∈, C the antisymmetric matrix of rank two and the charge conjugation matrix, respectively. The renormalization group running of these operators can be studied separately from other operators of equal mass dimension at the leading order in power counting. We compute their anomalous dimensions at one loop for general d and find that they are enhanced quadratically in d due to combinatorics. We also make connections with classification of operators in terms of their holomorphic and anti-holomorphic weights. Supported by the National Natural Science Foundation of China under Grant Nos. 11025525, 11575089, and by the CAS Center for Excellence in Particle Physics (CCEPP)

Design and testing of the first 2D Prototype Vertically Integrated Pattern Recognition Associative Memory

NASA Astrophysics Data System (ADS)

Liu, T.; Deptuch, G.; Hoff, J.; Jindariani, S.; Joshi, S.; Olsen, J.; Tran, N.; Trimpl, M.

2015-02-01

An associative memory-based track finding approach has been proposed for a Level 1 tracking trigger to cope with increasing luminosities at the LHC. The associative memory uses a massively parallel architecture to tackle the intrinsically complex combinatorics of track finding algorithms, thus avoiding the typical power law dependence of execution time on occupancy and solving the pattern recognition in times roughly proportional to the number of hits. This is of crucial importance given the large occupancies typical of hadronic collisions. The design of an associative memory system capable of dealing with the complexity of HL-LHC collisions and with the short latency required by Level 1 triggering poses significant, as yet unsolved, technical challenges. For this reason, an aggressive R&D program has been launched at Fermilab to advance state of-the-art associative memory technology, the so called VIPRAM (Vertically Integrated Pattern Recognition Associative Memory) project. The VIPRAM leverages emerging 3D vertical integration technology to build faster and denser Associative Memory devices. The first step is to implement in conventional VLSI the associative memory building blocks that can be used in 3D stacking; in other words, the building blocks are laid out as if it is a 3D design. In this paper, we report on the first successful implementation of a 2D VIPRAM demonstrator chip (protoVIPRAM00). The results show that these building blocks are ready for 3D stacking.

Design and testing of the first 2D Prototype Vertically Integrated Pattern Recognition Associative Memory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, T.; Deptuch, G.; Hoff, J.

An associative memory-based track finding approach has been proposed for a Level 1 tracking trigger to cope with increasing luminosities at the LHC. The associative memory uses a massively parallel architecture to tackle the intrinsically complex combinatorics of track finding algorithms, thus avoiding the typical power law dependence of execution time on occupancy and solving the pattern recognition in times roughly proportional to the number of hits. This is of crucial importance given the large occupancies typical of hadronic collisions. The design of an associative memory system capable of dealing with the complexity of HL-LHC collisions and with the shortmore » latency required by Level 1 triggering poses significant, as yet unsolved, technical challenges. For this reason, an aggressive R&D program has been launched at Fermilab to advance state of-the-art associative memory technology, the so called VIPRAM (Vertically Integrated Pattern Recognition Associative Memory) project. The VIPRAM leverages emerging 3D vertical integration technology to build faster and denser Associative Memory devices. The first step is to implement in conventional VLSI the associative memory building blocks that can be used in 3D stacking, in other words, the building blocks are laid out as if it is a 3D design. In this paper, we report on the first successful implementation of a 2D VIPRAM demonstrator chip (protoVIPRAM00). The results show that these building blocks are ready for 3D stacking.« less

Countability of Planck Boxes in Quantum Branching Models

NASA Astrophysics Data System (ADS)

Berezin, Alexander A.

2002-04-01

Two popular paradigms of cosmological quantum branching are Many World (MW) model of parallel universes (Everett, Deutsch) and inflationary quantum foam (IQF) model (Guth, Linde). Taking Planck L,T units as physically smallest, our Big Bang miniverse with size 10E28 cm and duration 10E18 sec has some 10E244 (N) elementary 4D Planck Boxes (PB) in its entire spacetime history. Using combinatorics, N! (about 10E10E247) is upper estimate for number of all possible 4D states, i.e. scale of "eternal return" (ER; Nietzsche, Eliade) for such miniverses. To count all states in full Megaverse (all up and down branches of infinite tree of all MW and/or IQF miniverses) we recall that all countable infinities have same (aleph-naught) cardinality (Cantor). Using Godel-type numbering, count PB in our miniverse by primes. This uses first N primes. Both MW and IQF models presume splitting of miniverses as springing (potentially) from each PB, making each PB infinitely rich, inexhaustible and unique. Next branching level is counted by integers p1Ep2, third level by p1Ep2Ep3 integers, etc, ad infinitum. To count in up and down directions from "our" miniverse, different branching subsets of powers of primes can be used at all levels of tower exponentiation. Thus, all PB in all infinitude of MW and/or IQF branches can be uniquely counted by never repeating integers (tower exponents of primes), offering escape from grim ER scenarios.

An Enumerative Combinatorics Model for Fragmentation Patterns in RNA Sequencing Provides Insights into Nonuniformity of the Expected Fragment Starting-Point and Coverage Profile.

PubMed

Prakash, Celine; Haeseler, Arndt Von

2017-03-01

RNA sequencing (RNA-seq) has emerged as the method of choice for measuring the expression of RNAs in a given cell population. In most RNA-seq technologies, sequencing the full length of RNA molecules requires fragmentation into smaller pieces. Unfortunately, the issue of nonuniform sequencing coverage across a genomic feature has been a concern in RNA-seq and is attributed to biases for certain fragments in RNA-seq library preparation and sequencing. To investigate the expected coverage obtained from fragmentation, we develop a simple fragmentation model that is independent of bias from the experimental method and is not specific to the transcript sequence. Essentially, we enumerate all configurations for maximal placement of a given fragment length, F, on transcript length, T, to represent every possible fragmentation pattern, from which we compute the expected coverage profile across a transcript. We extend this model to incorporate general empirical attributes such as read length, fragment length distribution, and number of molecules of the transcript. We further introduce the fragment starting-point, fragment coverage, and read coverage profiles. We find that the expected profiles are not uniform and that factors such as fragment length to transcript length ratio, read length to fragment length ratio, fragment length distribution, and number of molecules influence the variability of coverage across a transcript. Finally, we explore a potential application of the model where, with simulations, we show that it is possible to correctly estimate the transcript copy number for any transcript in the RNA-seq experiment.

An Enumerative Combinatorics Model for Fragmentation Patterns in RNA Sequencing Provides Insights into Nonuniformity of the Expected Fragment Starting-Point and Coverage Profile

PubMed Central

Haeseler, Arndt Von

2017-01-01

Abstract RNA sequencing (RNA-seq) has emerged as the method of choice for measuring the expression of RNAs in a given cell population. In most RNA-seq technologies, sequencing the full length of RNA molecules requires fragmentation into smaller pieces. Unfortunately, the issue of nonuniform sequencing coverage across a genomic feature has been a concern in RNA-seq and is attributed to biases for certain fragments in RNA-seq library preparation and sequencing. To investigate the expected coverage obtained from fragmentation, we develop a simple fragmentation model that is independent of bias from the experimental method and is not specific to the transcript sequence. Essentially, we enumerate all configurations for maximal placement of a given fragment length, F, on transcript length, T, to represent every possible fragmentation pattern, from which we compute the expected coverage profile across a transcript. We extend this model to incorporate general empirical attributes such as read length, fragment length distribution, and number of molecules of the transcript. We further introduce the fragment starting-point, fragment coverage, and read coverage profiles. We find that the expected profiles are not uniform and that factors such as fragment length to transcript length ratio, read length to fragment length ratio, fragment length distribution, and number of molecules influence the variability of coverage across a transcript. Finally, we explore a potential application of the model where, with simulations, we show that it is possible to correctly estimate the transcript copy number for any transcript in the RNA-seq experiment. PMID:27661099

Renormalization in Quantum Field Theory and the Riemann-Hilbert Problem I: The Hopf Algebra Structure of Graphs and the Main Theorem

NASA Astrophysics Data System (ADS)

Connes, Alain; Kreimer, Dirk

This paper gives a complete selfcontained proof of our result announced in [6] showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on the Riemann-Hilbert problem. We shall first show that for any quantum field theory, the combinatorics of Feynman graphs gives rise to a Hopf algebra which is commutative as an algebra. It is the dual Hopf algebra of the enveloping algebra of a Lie algebra whose basis is labelled by the one particle irreducible Feynman graphs. The Lie bracket of two such graphs is computed from insertions of one graph in the other and vice versa. The corresponding Lie group G is the group of characters of . We shall then show that, using dimensional regularization, the bare (unrenormalized) theory gives rise to a loop where C is a small circle of complex dimensions around the integer dimension D of space-time. Our main result is that the renormalized theory is just the evaluation at z=D of the holomorphic part γ+ of the Birkhoff decomposition of γ. We begin to analyse the group G and show that it is a semi-direct product of an easily understood abelian group by a highly non-trivial group closely tied up with groups of diffeomorphisms. The analysis of this latter group as well as the interpretation of the renormalization group and of anomalous dimensions are the content of our second paper with the same overall title.

Reformulating Non-Monotonic Theories for Inference and Updating

NASA Technical Reports Server (NTRS)

Grosof, Benjamin N.

1992-01-01

We aim to help build programs that do large-scale, expressive non-monotonic reasoning (NMR): especially, 'learning agents' that store, and revise, a body of conclusions while continually acquiring new, possibly defeasible, premise beliefs. Currently available procedures for forward inference and belief revision are exhaustive, and thus impractical: they compute the entire non-monotonic theory, then re-compute from scratch upon updating with new axioms. These methods are thus badly intractable. In most theories of interest, even backward reasoning is combinatoric (at least NP-hard). Here, we give theoretical results for prioritized circumscription that show how to reformulate default theories so as to make forward inference be selective, as well as concurrent; and to restrict belief revision to a part of the theory. We elaborate a detailed divide-and-conquer strategy. We develop concepts of structure in NM theories, by showing how to reformulate them in a particular fashion: to be conjunctively decomposed into a collection of smaller 'part' theories. We identify two well-behaved special cases that are easily recognized in terms of syntactic properties: disjoint appearances of predicates, and disjoint appearances of individuals (terms). As part of this, we also definitionally reformulate the global axioms, one by one, in addition to applying decomposition. We identify a broad class of prioritized default theories, generalizing default inheritance, for which our results especially bear fruit. For this asocially monadic class, decomposition permits reasoning to be localized to individuals (ground terms), and reduced to propositional. Our reformulation methods are implementable in polynomial time, and apply to several other NM formalisms beyond circumscription.

Stationary Random Metrics on Hierarchical Graphs Via {(min,+)}-type Recursive Distributional Equations

NASA Astrophysics Data System (ADS)

Khristoforov, Mikhail; Kleptsyn, Victor; Triestino, Michele

2016-07-01

This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite graphs: these are the so-called hierarchical graphs. They possess a well-defined level structure and any level is built using a simple recursion. Stopping the construction at any finite level, we have a discrete random metric space when we set the edges to have random length (using a multiplicative cascade with fixed law {m}). We introduce a tool, the cut-off process, by means of which one finds that renormalizing the sequence of metrics by an exponential factor, they converge in law to a non-trivial metric on the limit space. Such limit law is stationary, in the sense that glueing together a certain number of copies of the random limit space, according to the combinatorics of the brick graph, the obtained random metric has the same law when rescaled by a random factor of law {m} . In other words, the stationary random metric is the solution of a distributional equation. When the measure m has continuous positive density on {mathbf{R}+}, the stationary law is unique up to rescaling and any other distribution tends to a rescaled stationary law under the iterations of the hierarchical transformation. We also investigate topological and geometric properties of the random space when m is log-normal, detecting a phase transition influenced by the branching random walk associated to the multiplicative cascade.

Cohomological rigidity of manifolds defined by 3-dimensional polytopes

NASA Astrophysics Data System (ADS)

Buchstaber, V. M.; Erokhovets, N. Yu.; Masuda, M.; Panov, T. E.; Park, S.

2017-04-01

A family of closed manifolds is said to be cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. Cohomological rigidity is established here for large families of 3-dimensional and 6-dimensional manifolds defined by 3-dimensional polytopes. The class \\mathscr{P} of 3-dimensional combinatorial simple polytopes P different from tetrahedra and without facets forming 3- and 4-belts is studied. This class includes mathematical fullerenes, that is, simple 3- polytopes with only 5-gonal and 6-gonal facets. By a theorem of Pogorelov, any polytope in \\mathscr{P} admits in Lobachevsky 3-space a right-angled realisation which is unique up to isometry. Our families of smooth manifolds are associated with polytopes in the class \\mathscr{P}. The first family consists of 3-dimensional small covers of polytopes in \\mathscr{P}, or equivalently, hyperbolic 3-manifolds of Löbell type. The second family consists of 6-dimensional quasitoric manifolds over polytopes in \\mathscr{P}. Our main result is that both families are cohomologically rigid, that is, two manifolds M and M' from either family are diffeomorphic if and only if their cohomology rings are isomorphic. It is also proved that if M and M' are diffeomorphic, then their corresponding polytopes P and P' are combinatorially equivalent. These results are intertwined with classical subjects in geometry and topology such as the combinatorics of 3-polytopes, the Four Colour Theorem, aspherical manifolds, a diffeomorphism classification of 6-manifolds, and invariance of Pontryagin classes. The proofs use techniques of toric topology. Bibliography: 69 titles.

Elliptic integral evaluations of Bessel moments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bailey, David H.; Borwein, Jonathan M.; Broadhurst, David

2008-01-06

We record what is known about the closed forms for variousBessel function moments arising in quantum field theory, condensed mattertheory and other parts of mathematical physics. More generally, wedevelop formulae for integrals of products of six or fewer Besselfunctions. In consequence, we are able to discover and prove closed formsfor c(n,k) := Int_0 inf tk K_0 n(t) dt, with integers n = 1, 2, 3, 4 andk greater than or equal to 0, obtaining new results for the even momentsc3,2k and c4,2k . We also derive new closed forms for the odd momentss(n,2k+1) := Int_0 inf t(2k+1) I_0(t) K_0n(t) dt,withmore » n = 3, 4 and fort(n,2k+1) := Int_0 inf t(2k+1) I_02(t) K_0(n-2) dt, with n = 5, relatingthe latter to Green functions on hexagonal, diamond and cubic lattices.We conjecture the values of s(5,2k+1), make substantial progress on theevaluation of c(5,2k+1), s(6,2k+1) and t(6,2k+1) and report more limitedprogress regarding c(5,2k), c(6,2k+1) and c(6,2k). In the process, weobtain 8 conjectural evaluations, each of which has been checked to 1200decimal places. One of these lies deep in 4-dimensional quantum fieldtheory and two are probably provable by delicate combinatorics. Thereremains a hard core of five conjectures whose proofs would be mostinstructive, to mathematicians and physicists alike.« less

Application of Nearly Linear Solvers to Electric Power System Computation

NASA Astrophysics Data System (ADS)

Grant, Lisa L.

To meet the future needs of the electric power system, improvements need to be made in the areas of power system algorithms, simulation, and modeling, specifically to achieve a time frame that is useful to industry. If power system time-domain simulations could run in real-time, then system operators would have situational awareness to implement online control and avoid cascading failures, significantly improving power system reliability. Several power system applications rely on the solution of a very large linear system. As the demands on power systems continue to grow, there is a greater computational complexity involved in solving these large linear systems within reasonable time. This project expands on the current work in fast linear solvers, developed for solving symmetric and diagonally dominant linear systems, in order to produce power system specific methods that can be solved in nearly-linear run times. The work explores a new theoretical method that is based on ideas in graph theory and combinatorics. The technique builds a chain of progressively smaller approximate systems with preconditioners based on the system's low stretch spanning tree. The method is compared to traditional linear solvers and shown to reduce the time and iterations required for an accurate solution, especially as the system size increases. A simulation validation is performed, comparing the solution capabilities of the chain method to LU factorization, which is the standard linear solver for power flow. The chain method was successfully demonstrated to produce accurate solutions for power flow simulation on a number of IEEE test cases, and a discussion on how to further improve the method's speed and accuracy is included.

Aspects géométriques et intégrables des modèles de matrices aléatoires

NASA Astrophysics Data System (ADS)

Marchal, Olivier

2010-12-01

This thesis deals with the geometric and integrable aspects associated with random matrix models. Its purpose is to provide various applications of random matrix theory, from algebraic geometry to partial differential equations of integrable systems. The variety of these applications shows why matrix models are important from a mathematical point of view. First, the thesis will focus on the study of the merging of two intervals of the eigenvalues density near a singular point. Specifically, we will show why this special limit gives universal equations from the Painlevé II hierarchy of integrable systems theory. Then, following the approach of (bi) orthogonal polynomials introduced by Mehta to compute partition functions, we will find Riemann-Hilbert and isomonodromic problems connected to matrix models, making the link with the theory of Jimbo, Miwa and Ueno. In particular, we will describe how the hermitian two-matrix models provide a degenerate case of Jimbo-Miwa-Ueno's theory that we will generalize in this context. Furthermore, the loop equations method, with its central notions of spectral curve and topological expansion, will lead to the symplectic invariants of algebraic geometry recently proposed by Eynard and Orantin. This last point will be generalized to the case of non-hermitian matrix models (arbitrary beta) paving the way to "quantum algebraic geometry" and to the generalization of symplectic invariants to "quantum curves". Finally, this set up will be applied to combinatorics in the context of topological string theory, with the explicit computation of an hermitian random matrix model enumerating the Gromov-Witten invariants of a toric Calabi-Yau threefold.

Revealing compressed stops using high-momentum recoils

DOE PAGES

Macaluso, Sebastian; Park, Michael; Shih, David; ...

2016-03-22

In this study, searches for supersymmetric top quarks at the LHC have been making great progress in pushing sensitivity out to higher mass, but are famously plagued by gaps in coverage around lower-mass regions where the decay phase space is closing off. Within the common stop-NLSP/neutralino-LSP simplified model, the line in the mass plane where there is just enough phase space to produce an on-shell top quark remains almost completely unconstrained. Here, we show that is possible to define searches capable of probing a large patch of this difficult region, with S/B ~ 1 and significances often well beyond 5σ.more » The basic strategy is to leverage the large energy gain of LHC Run 2, leading to a sizable population of stop pair events recoiling against a hard jet. The recoil not only re-establishes a E T, but also leads to a distinctive anti-correlation between the E T and the recoil jet transverse vectors when the stops decay all-hadronically. Accounting for jet combinatorics, backgrounds, and imperfections in E T measurements, we estimate that Run 2 will already start to close the gap in exclusion sensitivity with the first few 10s of fb –1. By 300 fb –1, exclusion sensitivity may extend from stop masses of 550 GeV on the high side down to below 200 GeV on the low side, approaching the “stealth” point at m t¯ = m t and potentially overlapping with limits from tt¯ cross section and spin correlation measurements.« less

Track reconstruction for the Mu3e experiment based on a novel Multiple Scattering fit

NASA Astrophysics Data System (ADS)

Kozlinskiy, Alexandr

2017-08-01

The Mu3e experiment is designed to search for the lepton flavor violating decay μ+ → e+e+e-. The aim of the experiment is to reach a branching ratio sensitivity of 10-16. In a first phase the experiment will be performed at an existing beam line at the Paul-Scherrer Institute (Switzerland) providing 108 muons per second, which will allow to reach a sensitivity of 2 · 10-15. The muons with a momentum of about 28 MeV/c are stopped and decay at rest on a target. The decay products (positrons and electrons) with energies below 53MeV are measured by a tracking detector consisting of two double layers of 50 μm thin silicon pixel sensors. The high granularity of the pixel detector with a pixel size of 80 μm × 80 μm allows for a precise track reconstruction in the high multiplicity environment of the Mu3e experiment, reaching 100 tracks per reconstruction frame of 50 ns in the final phase of the experiment. To deal with such high rates and combinatorics, the Mu3e track reconstruction uses a novel fit algorithm that in the simplest case takes into account only the multiple scattering, which allows for a fast online tracking on a GPU based filter farm. An implementation of the 3-dimensional multiple scattering fit based on hit triplets is described. The extension of the fit that takes into account energy losses and pixel size is used for offline track reconstruction. The algorithm and performance of the offline track reconstruction based on a full Geant4 simulation of the Mu3e detector are presented.

Nanostructure of and structural defects in a Mo2BC hard coating investigated by transmission electron microscopy and atom probe tomography

NASA Astrophysics Data System (ADS)

Gleich, Stephan; Fager, Hanna; Bolvardi, Hamid; Achenbach, Jan-Ole; Soler, Rafael; Pradeep, Konda Gokuldoss; Schneider, Jochen M.; Dehm, Gerhard; Scheu, Christina

2017-08-01

In this work, the nanostructure of a Mo2BC hard coating was determined by several transmission electron microscopy methods and correlated with the mechanical properties. The coating was deposited on a Si (100) wafer by bipolar pulsed direct current magnetron sputtering from a Mo2BC compound target in Ar at a substrate temperature of 630 °C. Transmission electron microscopy investigations revealed structural features at various length scales: bundles (30 nm to networks of several micrometers) consisting of columnar grains (˜10 nm in diameter), grain boundary regions with a less ordered atomic arrangement, and defects including disordered clusters (˜1.5 nm in diameter) as well as stacking faults within the grains. The most prominent defect with a volume fraction of ˜0.5% is the disordered clusters, which were investigated in detail by electron energy loss spectroscopy and atom probe tomography. The results provide conclusive evidence that Ar is incorporated into the Mo2BC film as disordered Ar-rich Mo-B-C clusters of approximately 1.5 nm in diameter. Hardness values of 28 ± 1 GPa were obtained by nanoindentation tests. The Young's modulus of the Mo2BC coating exhibits a value of 462 ± 9 GPa, which is consistent with ab initio calculations for crystalline and defect free Mo2BC and measurements of combinatorically deposited Mo2BC thin films at a substrate temperature of 900 °C. We conclude that a reduction of the substrate temperature of 270 °C has no significant influence on hardness and Young's modulus of the Mo2BC hard coating, even if its nanostructure exhibits defects.

Bernhard Riemann, a(rche)typical mathematical-physicist?

NASA Astrophysics Data System (ADS)

Elizalde, Emilio

2013-09-01

The work of Bernhard Riemann is discussed under the perspective of present day mathematics and physics, and with a prospective view towards the future, too. Against the (unfortunately rather widespread) trend---which predominantly dominated national scientific societies in Europe during the last Century---of strictly classifying the work of scientists with the aim to constrain them to separated domains of knowledge, without any possible interaction among those and often even fighting against each other (and which, no doubt, was in part responsible for the decline of European in favor of American science), it will be here argued, using Riemann as a model, archetypical example, that good research transcends any classification. Its uses and applications arguably permeate all domains, subjects and disciplines one can possibly define, to the point that it can be considered to be universally useful. After providing a very concise review of the main publications of Bernhard Riemann on physical problems, some connections between Riemann's papers and contemporary physics will be considered: (i) the uses of Riemann's work on the zeta function for devising applications to the regularization of quantum field theories in curved space-time, in particular, of quantum vacuum fluctuations; (ii) the uses of the Riemann tensor in general relativity and in recent generalizations of this theory, which aim at understanding the presently observed acceleration of the universe expansion (the dark energy issue). Finally, it will be argued that mathematical physics, which was yet not long ago a model paradigm for interdisciplinary activity---and had a very important pioneering role in this sense---is now quickly being surpassed by the extraordinarily fruitful interconnections which seem to pop up from nothing every day and simultaneously involve several disciplines, in the classical sense, including genetics, combinatorics, nanoelectronics, biochemistry, medicine, and even ps

All-loop Mondrian diagrammatics and 4-particle amplituhedron

NASA Astrophysics Data System (ADS)

An, Yang; Li, Yi; Li, Zhinan; Rao, Junjie

2018-06-01

Based on 1712.09990 which handles the 4-particle amplituhedron at 3-loop, we have found an extremely simple pattern, yet far more non-trivial than one might naturally expect: the all-loop Mondrian diagrammatics. By further simplifying and rephrasing the key relation of positivity in the amplituhedron setting, remarkably, we find a completeness relation unifying all diagrams of the Mondrian types for the 4-particle integrand of planar N = 4 SYM to all loop orders, each of which can be mapped to a simple product following a few plain rules designed for this relation. The explicit examples we investigate span from 3-loop to 7-loop order, and based on them, we classify the basic patterns of Mondrian diagrams into four types: the ladder, cross, brick-wall and spiral patterns. Interestingly, for some special combinations of ordered subspaces (a concept defined in the previous work), we find failed exceptions of the completeness relation which are called "anomalies", nevertheless, they substantially give hints on the all-loop recursive proof of this relation. These investigations are closely related to the combinatoric knowledge of separable permutations and Schröder numbers, and go even further from a diagrammatic perspective. For physical relevance, we need to further consider dual conformal invariance for two basic diagrammatic patterns to correct the numerator for a local integrand involving one or both of such patterns, while the denominator encoding its pole structure and also the sign factor, are already fixed by rules of the completeness relation. With this extra treatment to ensure the integrals are dual conformally invariant, each Mondrian diagram can be exactly translated to its corresponding physical loop integrand after being summed over all ordered subspaces that admit it.

Observation of long-range elliptic azimuthal anisotropies in √s = 13 and 2.76 TeV pp collisions with the ATLAS detector

DOE PAGES

Aad, G.

2016-04-27

In this study, ATLAS has measured two-particle correlations as a function of the relative azimuthal angle, ΔΦ, and pseudorapidity, Δη, in √s = 13 and 2.76 TeV pp collisions at the LHC using charged particles measured in the pseudorapidity interval |η|<2.5. The correlation functions evaluated in different intervals of measured charged-particle multiplicity show a multiplicity-dependent enhancement at ΔΦ~0 that extends over a wide range of Δη, which has been referred to as the “ridge.” Per-trigger-particle yields, Y(ΔΦ), are measured over 2<|Δη|<5. For both collision energies, the Y(ΔΦ) distribution in all multiplicity intervals is found to be consistent with a linearmore » combination of the per-trigger-particle yields measured in collisions with less than 20 reconstructed tracks, and a constant combinatoric contribution modulated by cos(2ΔΦ). The fitted Fourier coefficient, v 2 ,2, exhibits factorization, suggesting that the ridge results from per-event cos(2Φ) modulation of the single-particle distribution with Fourier coefficients v 2. The v 2 values are presented as a function of multiplicity and transverse momentum. They are found to be approximately constant as a function of multiplicity and to have a p T dependence similar to that measured in p+Pb and Pb+Pb collisions. The v 2 values in the 13 and 2.76 TeV data are consistent within uncertainties. These results suggest that the ridge in pp collisions arises from the same or similar underlying physics as observed in p+Pb collisions, and that the dynamics responsible for the ridge has no strong √s dependence.« less

Observation of Long-Range Elliptic Azimuthal Anisotropies in √{s }=13 and 2.76 TeV p p Collisions with the ATLAS Detector

NASA Astrophysics Data System (ADS)

Aad, G.; Abbott, B.; Abdallah, J.; Abdinov, O.; Aben, R.; Abolins, M.; Abouzeid, O. S.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Affolder, A. A.; Agatonovic-Jovin, T.; Agricola, J.; Aguilar-Saavedra, J. A.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akerstedt, H.; Åkesson, T. P. A.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albrand, S.; Alconada Verzini, M. J.; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexopoulos, T.; Alhroob, M.; Alimonti, G.; Alio, L.; Alison, J.; Alkire, S. P.; Allbrooke, B. M. M.; Allport, P. P.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Altheimer, A.; Alvarez Gonzalez, B.; Álvarez Piqueras, D.; Alviggi, M. G.; Amadio, B. T.; Amako, K.; Amaral Coutinho, Y.; Amelung, C.; Amidei, D.; Amor Dos Santos, S. P.; Amorim, A.; Amoroso, S.; Amram, N.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anders, J. K.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Angelidakis, S.; Angelozzi, I.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoki, M.; Aperio Bella, L.; Arabidze, G.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arduh, F. A.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Arnaez, O.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Artz, S.; Asai, S.; Asbah, N.; Ashkenazi, A.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Augsten, K.; Aurousseau, M.; Avolio, G.; Axen, B.; Ayoub, M. K.; Azuelos, G.; Baak, M. A.; Baas, A. E.; Baca, M. J.; Bacci, C.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Bain, T.; Baines, J. T.; Baker, O. K.; Baldin, E. M.; Balek, P.; Balestri, T.; Balli, F.; Balunas, W. K.; Banas, E.; Banerjee, Sw.; Bannoura, A. A. E.; Barak, L.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnes, S. L.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barreiro, F.; Barreiro Guimarães da Costa, J.; Bartoldus, R.; Barton, A. E.; Bartos, P.; Basalaev, A.; Bassalat, A.; Basye, A.; Bates, R. L.; Batista, S. J.; Batley, J. R.; Battaglia, M.; Bauce, M.; Bauer, F.; Bawa, H. S.; Beacham, J. B.; Beattie, M. D.; Beau, T.; Beauchemin, P. H.; Beccherle, R.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, M.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bednyakov, V. A.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, J. K.; Belanger-Champagne, C.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Benary, O.; Benchekroun, D.; Bender, M.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez Garcia, J. A.; Benjamin, D. P.; Bensinger, J. R.; Bentvelsen, S.; Beresford, L.; Beretta, M.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Berghaus, F.; Beringer, J.; Bernard, C.; Bernard, N. R.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertolucci, F.; Bertsche, C.; Bertsche, D.; Besana, M. I.; Besjes, G. J.; Bessidskaia Bylund, O.; Bessner, M.; Besson, N.; Betancourt, C.; Bethke, S.; Bevan, A. J.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Biedermann, D.; Biesuz, N. V.; Biglietti, M.; Bilbao de Mendizabal, J.; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Biondi, S.; Bjergaard, D. M.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blanco, J. E.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Blunier, S.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boehler, M.; Bogaerts, J. A.; Bogavac, D.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bold, T.; Boldea, V.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Borroni, S.; Bortfeldt, J.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Bousson, N.; Boutle, S. K.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bozic, I.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Breaden Madden, W. D.; Brendlinger, K.; Brennan, A. J.; Brenner, L.; Brenner, R.; Bressler, S.; Bristow, T. M.; Britton, D.; Britzger, D.; Brochu, F. M.; Brock, I.; Brock, R.; Bronner, J.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Bruckman de Renstrom, P. A.; Bruncko, D.; Bruneliere, R.; Bruni, A.; Bruni, G.; Bruschi, M.; Bruscino, N.; Bryngemark, L.; Buanes, T.; Buat, Q.; Buchholz, P.; Buckley, A. G.; Budagov, I. A.; Buehrer, F.; Bugge, L.; Bugge, M. K.; Bulekov, O.; Bullock, D.; Burckhart, H.; Burdin, S.; Burgard, C. D.; Burghgrave, B.; Burke, S.; Burmeister, I.; Busato, E.; Büscher, D.; Büscher, V.; Bussey, P.; Butler, J. M.; Butt, A. I.; Buttar, C. M.; Butterworth, J. M.; Butti, P.; Buttinger, W.; Buzatu, A.; Buzykaev, A. R.; Cabrera Urbán, S.; Caforio, D.; Cairo, V. M.; Cakir, O.; Calace, N.; Calafiura, P.; Calandri, A.; Calderini, G.; Calfayan, P.; Caloba, L. P.; Calvet, D.; Calvet, S.; Camacho Toro, R.; Camarda, S.; Camarri, P.; Cameron, D.; Caminal Armadans, R.; Campana, S.; Campanelli, M.; Campoverde, A.; Canale, V.; Canepa, A.; Cano Bret, M.; Cantero, J.; Cantrill, R.; Cao, T.; Capeans Garrido, M. D. M.; Caprini, I.; Caprini, M.; Capua, M.; Caputo, R.; Carbone, R. M.; Cardarelli, R.; Cardillo, F.; Carli, T.; Carlino, G.; Carminati, L.; Caron, S.; Carquin, E.; Carrillo-Montoya, G. D.; Carter, J. R.; Carvalho, J.; Casadei, D.; Casado, M. P.; Casolino, M.; Casper, D. W.; Castaneda-Miranda, E.; Castelli, A.; Castillo Gimenez, V.; Castro, N. F.; Catastini, P.; Catinaccio, A.; Catmore, J. R.; Cattai, A.; Caudron, J.; Cavaliere, V.; Cavalli, D.; Cavalli-Sforza, M.; Cavasinni, V.; Ceradini, F.; Cerda Alberich, L.; Cerio, B. C.; Cerny, K.; Cerqueira, A. S.; Cerri, A.; Cerrito, L.; Cerutti, F.; Cerv, M.; Cervelli, A.; Cetin, S. A.; Chafaq, A.; Chakraborty, D.; Chalupkova, I.; Chan, Y. L.; Chang, P.; Chapman, J. D.; Charlton, D. G.; Chau, C. C.; Chavez Barajas, C. A.; Cheatham, S.; Chegwidden, A.; Chekanov, S.; Chekulaev, S. V.; Chelkov, G. A.; Chelstowska, M. A.; Chen, C.; Chen, H.; Chen, K.; Chen, L.; Chen, S.; Chen, S.; Chen, X.; Chen, Y.; Cheng, H. C.; Cheng, Y.; Cheplakov, A.; Cheremushkina, E.; Cherkaoui El Moursli, R.; Chernyatin, V.; Cheu, E.; Chevalier, L.; Chiarella, V.; Chiarelli, G.; Chiodini, G.; Chisholm, A. S.; Chislett, R. T.; Chitan, A.; Chizhov, M. V.; Choi, K.; Chouridou, S.; Chow, B. K. B.; Christodoulou, V.; Chromek-Burckhart, D.; Chudoba, J.; Chuinard, A. J.; Chwastowski, J. J.; Chytka, L.; Ciapetti, G.; Ciftci, A. K.; Cinca, D.; Cindro, V.; Cioara, I. A.; Ciocio, A.; Cirotto, F.; Citron, Z. H.; Ciubancan, M.; Clark, A.; Clark, B. L.; Clark, P. J.; Clarke, R. N.; Clement, C.; Coadou, Y.; Cobal, M.; Coccaro, A.; Cochran, J.; Coffey, L.; Colasurdo, L.; Cole, B.; Cole, S.; Colijn, A. P.; Collot, J.; Colombo, T.; Compostella, G.; Conde Muiño, P.; Coniavitis, E.; Connell, S. H.; Connelly, I. A.; Consorti, V.; Constantinescu, S.; Conta, C.; Conti, G.; Conventi, F.; Cooke, M.; Cooper, B. D.; Cooper-Sarkar, A. M.; Cornelissen, T.; Corradi, M.; Corriveau, F.; Corso-Radu, A.; Cortes-Gonzalez, A.; Cortiana, G.; Costa, G.; Costa, M. J.; Costanzo, D.; Côté, D.; Cottin, G.; Cowan, G.; Cox, B. E.; Cranmer, K.; Cree, G.; Crépé-Renaudin, S.; Crescioli, F.; Cribbs, W. A.; Crispin Ortuzar, M.; Cristinziani, M.; Croft, V.; Crosetti, G.; Cuhadar Donszelmann, T.; Cummings, J.; Curatolo, M.; Cúth, J.; Cuthbert, C.; Czirr, H.; Czodrowski, P.; D'Auria, S.; D'Onofrio, M.; da Cunha Sargedas de Sousa, M. J.; da Via, C.; Dabrowski, W.; Dafinca, A.; Dai, T.; Dale, O.; Dallaire, F.; Dallapiccola, C.; Dam, M.; Dandoy, J. R.; Dang, N. P.; Daniells, A. C.; Danninger, M.; Dano Hoffmann, M.; Dao, V.; Darbo, G.; Darmora, S.; Dassoulas, J.; Dattagupta, A.; Davey, W.; David, C.; Davidek, T.; Davies, E.; Davies, M.; Davison, P.; Davygora, Y.; Dawe, E.; Dawson, I.; Daya-Ishmukhametova, R. K.; de, K.; de Asmundis, R.; de Benedetti, A.; de Castro, S.; de Cecco, S.; de Groot, N.; de Jong, P.; de la Torre, H.; de Lorenzi, F.; de Pedis, D.; de Salvo, A.; de Sanctis, U.; de Santo, A.; de Vivie de Regie, J. B.; Dearnaley, W. J.; Debbe, R.; Debenedetti, C.; Dedovich, D. V.; Deigaard, I.; Del Peso, J.; Del Prete, T.; Delgove, D.; Deliot, F.; Delitzsch, C. M.; Deliyergiyev, M.; Dell'Acqua, A.; Dell'Asta, L.; Dell'Orso, M.; Della Pietra, M.; Della Volpe, D.; Delmastro, M.; Delsart, P. A.; Deluca, C.; Demarco, D. A.; Demers, S.; Demichev, M.; Demilly, A.; Denisov, S. P.; Derendarz, D.; Derkaoui, J. E.; Derue, F.; Dervan, P.; Desch, K.; Deterre, C.; Dette, K.; Deviveiros, P. O.; Dewhurst, A.; Dhaliwal, S.; di Ciaccio, A.; di Ciaccio, L.; di Domenico, A.; di Donato, C.; di Girolamo, A.; di Girolamo, B.; di Mattia, A.; di Micco, B.; di Nardo, R.; di Simone, A.; di Sipio, R.; di Valentino, D.; Diaconu, C.; Diamond, M.; Dias, F. A.; Diaz, M. A.; Diehl, E. B.; Dietrich, J.; Diglio, S.; Dimitrievska, A.; Dingfelder, J.; Dita, P.; Dita, S.; Dittus, F.; Djama, F.; Djobava, T.; Djuvsland, J. I.; Do Vale, M. A. B.; Dobos, D.; Dobre, M.; Doglioni, C.; Dohmae, T.; Dolejsi, J.; Dolezal, Z.; Dolgoshein, B. A.; Donadelli, M.; Donati, S.; Dondero, P.; Donini, J.; Dopke, J.; Doria, A.; Dova, M. T.; Doyle, A. T.; Drechsler, E.; Dris, M.; Du, Y.; Dubreuil, E.; Duchovni, E.; Duckeck, G.; Ducu, O. A.; Duda, D.; Dudarev, A.; Duflot, L.; Duguid, L.; Dührssen, M.; Dunford, M.; Duran Yildiz, H.; Düren, M.; Durglishvili, A.; Duschinger, D.; Dutta, B.; Dyndal, M.; Eckardt, C.; Ecker, K. M.; Edgar, R. C.; Edson, W.; Edwards, N. C.; Ehrenfeld, W.; Eifert, T.; Eigen, G.; Einsweiler, K.; Ekelof, T.; El Kacimi, M.; Ellert, M.; Elles, S.; Ellinghaus, F.; Elliot, A. A.; Ellis, N.; Elmsheuser, J.; Elsing, M.; Emeliyanov, D.; Enari, Y.; Endner, O. C.; Endo, M.; Erdmann, J.; Ereditato, A.; Ernis, G.; Ernst, J.; Ernst, M.; Errede, S.; Ertel, E.; Escalier, M.; Esch, H.; Escobar, C.; Esposito, B.; Etienvre, A. I.; Etzion, E.; Evans, H.; Ezhilov, A.; Fabbri, L.; Facini, G.; Fakhrutdinov, R. M.; Falciano, S.; Falla, R. J.; Faltova, J.; Fang, Y.; Fanti, M.; Farbin, A.; Farilla, A.; Farooque, T.; Farrell, S.; Farrington, S. M.; Farthouat, P.; Fassi, F.; Fassnacht, P.; Fassouliotis, D.; Faucci Giannelli, M.; Favareto, A.; Fayard, L.; Fedin, O. L.; Fedorko, W.; Feigl, S.; Feligioni, L.; Feng, C.; Feng, E. J.; Feng, H.; Fenyuk, A. B.; Feremenga, L.; Fernandez Martinez, P.; Fernandez Perez, S.; Ferrando, J.; Ferrari, A.; Ferrari, P.; Ferrari, R.; Ferreira de Lima, D. E.; Ferrer, A.; Ferrere, D.; Ferretti, C.; Ferretto Parodi, A.; Fiascaris, M.; Fiedler, F.; Filipčič, A.; Filipuzzi, M.; Filthaut, F.; Fincke-Keeler, M.; Finelli, K. D.; Fiolhais, M. C. N.; Fiorini, L.; Firan, A.; Fischer, A.; Fischer, C.; Fischer, J.; Fisher, W. C.; Flaschel, N.; Fleck, I.; Fleischmann, P.; Fletcher, G. T.; Fletcher, G.; Fletcher, R. R. M.; Flick, T.; Floderus, A.; Flores Castillo, L. R.; Flowerdew, M. J.; Forcolin, G. T.; Formica, A.; Forti, A.; Fournier, D.; Fox, H.; Fracchia, S.; Francavilla, P.; Franchini, M.; Francis, D.; Franconi, L.; Franklin, M.; Frate, M.; Fraternali, M.; Freeborn, D.; French, S. T.; Fressard-Batraneanu, S. M.; Friedrich, F.; Froidevaux, D.; Frost, J. A.; Fukunaga, C.; Fullana Torregrosa, E.; Fulsom, B. G.; Fusayasu, T.; Fuster, J.; Gabaldon, C.; Gabizon, O.; Gabrielli, A.; Gabrielli, A.; Gach, G. P.; Gadatsch, S.; Gadomski, S.; Gagliardi, G.; Gagnon, P.; Galea, C.; Galhardo, B.; Gallas, E. J.; Gallop, B. J.; Gallus, P.; Galster, G.; Gan, K. K.; Gao, J.; Gao, Y.; Gao, Y. S.; Garay Walls, F. M.; Garberson, F.; García, C.; García Navarro, J. E.; Garcia-Sciveres, M.; Gardner, R. W.; Garelli, N.; Garonne, V.; Gatti, C.; Gaudiello, A.; Gaudio, G.; Gaur, B.; Gauthier, L.; Gauzzi, P.; Gavrilenko, I. L.; Gay, C.; Gaycken, G.; Gazis, E. N.; Ge, P.; Gecse, Z.; Gee, C. N. P.; Geich-Gimbel, Ch.; Geisler, M. P.; Gemme, C.; Genest, M. H.; Geng, C.; Gentile, S.; George, S.; Gerbaudo, D.; Gershon, A.; Ghasemi, S.; Ghazlane, H.; Giacobbe, B.; Giagu, S.; Giangiobbe, V.; Giannetti, P.; Gibbard, B.; Gibson, S. M.; Gignac, M.; Gilchriese, M.; Gillam, T. P. S.; Gillberg, D.; Gilles, G.; Gingrich, D. M.; Giokaris, N.; Giordani, M. P.; Giorgi, F. M.; Giorgi, F. M.; Giraud, P. F.; Giromini, P.; Giugni, D.; Giuliani, C.; Giulini, M.; Gjelsten, B. K.; Gkaitatzis, S.; Gkialas, I.; Gkougkousis, E. L.; Gladilin, L. K.; Glasman, C.; Glatzer, J.; Glaysher, P. C. F.; Glazov, A.; Goblirsch-Kolb, M.; Goddard, J. R.; Godlewski, J.; Goldfarb, S.; Golling, T.; Golubkov, D.; Gomes, A.; Gonçalo, R.; Goncalves Pinto Firmino da Costa, J.; Gonella, L.; González de La Hoz, S.; Gonzalez Parra, G.; Gonzalez-Sevilla, S.; Goossens, L.; Gorbounov, P. A.; Gordon, H. A.; Gorelov, I.; Gorini, B.; Gorini, E.; Gorišek, A.; Gornicki, E.; Goshaw, A. T.; Gössling, C.; Gostkin, M. I.; Goujdami, D.; Goussiou, A. G.; Govender, N.; Gozani, E.; Graber, L.; Grabowska-Bold, I.; Gradin, P. O. J.; Grafström, P.; Gramling, J.; Gramstad, E.; Grancagnolo, S.; Gratchev, V.; Gray, H. M.; Graziani, E.; Greenwood, Z. D.; Grefe, C.; Gregersen, K.; Gregor, I. M.; Grenier, P.; Griffiths, J.; Grillo, A. A.; Grimm, K.; Grinstein, S.; Gris, Ph.; Grivaz, J.-F.; Groh, S.; Grohs, J. P.; Grohsjean, A.; Gross, E.; Grosse-Knetter, J.; Grossi, G. C.; Grout, Z. J.; Guan, L.; Guenther, J.; Guescini, F.; Guest, D.; Gueta, O.; Guido, E.; Guillemin, T.; Guindon, S.; Gul, U.; Gumpert, C.; Guo, J.; Guo, Y.; Gupta, S.; Gustavino, G.; Gutierrez, P.; Gutierrez Ortiz, N. G.; Gutschow, C.; Guyot, C.; Gwenlan, C.; Gwilliam, C. B.; Haas, A.; Haber, C.; Hadavand, H. K.; Haddad, N.; Haefner, P.; Hageböck, S.; Hajduk, Z.; Hakobyan, H.; Haleem, M.; Haley, J.; Hall, D.; Halladjian, G.; Hallewell, G. D.; Hamacher, K.; Hamal, P.; Hamano, K.; Hamilton, A.; Hamity, G. N.; Hamnett, P. G.; Han, L.; Hanagaki, K.; Hanawa, K.; Hance, M.; Haney, B.; Hanke, P.; Hanna, R.; Hansen, J. B.; Hansen, J. D.; Hansen, M. C.; Hansen, P. H.; Hara, K.; Hard, A. S.; Harenberg, T.; Hariri, F.; Harkusha, S.; Harrington, R. D.; Harrison, P. F.; Hartjes, F.; Hasegawa, M.; Hasegawa, Y.; Hasib, A.; Hassani, S.; Haug, S.; Hauser, R.; Hauswald, L.; Havranek, M.; Hawkes, C. M.; Hawkings, R. J.; Hawkins, A. D.; Hayashi, T.; Hayden, D.; Hays, C. P.; Hays, J. M.; Hayward, H. S.; Haywood, S. J.; Head, S. J.; Heck, T.; Hedberg, V.; Heelan, L.; Heim, S.; Heim, T.; Heinemann, B.; Heinrich, L.; Hejbal, J.; Helary, L.; Hellman, S.; Helsens, C.; Henderson, J.; Henderson, R. C. W.; Heng, Y.; Hengler, C.; Henkelmann, S.; Henrichs, A.; Henriques Correia, A. M.; Henrot-Versille, S.; Herbert, G. H.; Hernández Jiménez, Y.; Herten, G.; Hertenberger, R.; Hervas, L.; Hesketh, G. G.; Hessey, N. P.; Hetherly, J. W.; Hickling, R.; Higón-Rodriguez, E.; Hill, E.; Hill, J. C.; Hiller, K. H.; Hillier, S. J.; Hinchliffe, I.; Hines, E.; Hinman, R. R.; Hirose, M.; Hirschbuehl, D.; Hobbs, J.; Hod, N.; Hodgkinson, M. C.; Hodgson, P.; Hoecker, A.; Hoeferkamp, M. R.; Hoenig, F.; Hohlfeld, M.; Hohn, D.; Holmes, T. R.; Homann, M.; Hong, T. M.; Hooberman, B. H.; Hopkins, W. H.; Horii, Y.; Horton, A. J.; Hostachy, J.-Y.; Hou, S.; Hoummada, A.; Howard, J.; Howarth, J.; Hrabovsky, M.; Hristova, I.; Hrivnac, J.; Hryn'ova, T.; Hrynevich, A.; Hsu, C.; Hsu, P. J.; Hsu, S.-C.; Hu, D.; Hu, Q.; Hu, X.; Huang, Y.; Hubacek, Z.; Hubaut, F.; Huegging, F.; Huffman, T. B.; Hughes, E. W.; Hughes, G.; Huhtinen, M.; Hülsing, T. A.; Huseynov, N.; Huston, J.; Huth, J.; Iacobucci, G.; Iakovidis, G.; Ibragimov, I.; Iconomidou-Fayard, L.; Ideal, E.; Idrissi, Z.; Iengo, P.; Igonkina, O.; Iizawa, T.; Ikegami, Y.; Ikematsu, K.; Ikeno, M.; Ilchenko, Y.; Iliadis, D.; Ilic, N.; Ince, T.; Introzzi, G.; Ioannou, P.; Iodice, M.; Iordanidou, K.; Ippolito, V.; Irles Quiles, A.; Isaksson, C.; Ishino, M.; Ishitsuka, M.; Ishmukhametov, R.; Issever, C.; Istin, S.; Iturbe Ponce, J. M.; Iuppa, R.; Ivarsson, J.; Iwanski, W.; Iwasaki, H.; Izen, J. M.; Izzo, V.; Jabbar, S.; Jackson, B.; Jackson, M.; Jackson, P.; Jaekel, M. R.; Jain, V.; Jakobi, K. B.; Jakobs, K.; Jakobsen, S.; Jakoubek, T.; Jakubek, J.; Jamin, D. O.; Jana, D. K.; Jansen, E.; Jansky, R.; Janssen, J.; Janus, M.; Jarlskog, G.; Javadov, N.; Javå¯Rek, T.; Jeanty, L.; Jejelava, J.; Jeng, G.-Y.; Jennens, D.; Jenni, P.; Jentzsch, J.; Jeske, C.; Jézéquel, S.; Ji, H.; Jia, J.; Jiang, Y.; Jiggins, S.; Jimenez Pena, J.; Jin, S.; Jinaru, A.; Jinnouchi, O.; Joergensen, M. D.; Johansson, P.; Johns, K. A.; Johnson, W. J.; Jon-And, K.; Jones, G.; Jones, R. W. L.; Jones, T. J.; Jongmanns, J.; Jorge, P. M.; Joshi, K. D.; Jovicevic, J.; Ju, X.; Juste Rozas, A.; Kaci, M.; Kaczmarska, A.; Kado, M.; Kagan, H.; Kagan, M.; Kahn, S. J.; Kajomovitz, E.; Kalderon, C. W.; Kaluza, A.; Kama, S.; Kamenshchikov, A.; Kanaya, N.; Kaneti, S.; Kantserov, V. A.; Kanzaki, J.; Kaplan, B.; Kaplan, L. S.; Kapliy, A.; Kar, D.; Karakostas, K.; Karamaoun, A.; Karastathis, N.; Kareem, M. J.; Karentzos, E.; Karnevskiy, M.; Karpov, S. N.; Karpova, Z. M.; Karthik, K.; Kartvelishvili, V.; Karyukhin, A. N.; Kasahara, K.; Kashif, L.; Kass, R. D.; Kastanas, A.; Kataoka, Y.; Kato, C.; Katre, A.; Katzy, J.; Kawade, K.; Kawagoe, K.; Kawamoto, T.; Kawamura, G.; Kazama, S.; Kazanin, V. F.; Keeler, R.; Kehoe, R.; Keller, J. S.; Kempster, J. J.; Keoshkerian, H.; Kepka, O.; Kerševan, B. P.; Kersten, S.; Keyes, R. A.; Khalil-Zada, F.; Khandanyan, H.; Khanov, A.; Kharlamov, A. G.; Khoo, T. J.; Khovanskiy, V.; Khramov, E.; Khubua, J.; Kido, S.; Kim, H. Y.; Kim, S. H.; Kim, Y. K.; Kimura, N.; Kind, O. M.; King, B. T.; King, M.; King, S. B.; Kirk, J.; Kiryunin, A. E.; Kishimoto, T.; Kisielewska, D.; Kiss, F.; Kiuchi, K.; Kivernyk, O.; Kladiva, E.; Klein, M. H.; Klein, M.; Klein, U.; Kleinknecht, K.; Klimek, P.; Klimentov, A.; Klingenberg, R.; Klinger, J. A.; Klioutchnikova, T.; Kluge, E.-E.; Kluit, P.; Kluth, S.; Knapik, J.; Kneringer, E.; Knoops, E. B. F. G.; Knue, A.; Kobayashi, A.; Kobayashi, D.; Kobayashi, T.; Kobel, M.; Kocian, M.; Kodys, P.; Koffas, T.; Koffeman, E.; Kogan, L. A.; Kohlmann, S.; Kohout, Z.; Kohriki, T.; Koi, T.; Kolanoski, H.; Kolb, M.; Koletsou, I.; Komar, A. A.; Komori, Y.; Kondo, T.; Kondrashova, N.; Köneke, K.; König, A. C.; Kono, T.; Konoplich, R.; Konstantinidis, N.; Kopeliansky, R.; Koperny, S.; Köpke, L.; Kopp, A. K.; Korcyl, K.; Kordas, K.; Korn, A.; Korol, A. A.; Korolkov, I.; Korolkova, E. V.; Kortner, O.; Kortner, S.; Kosek, T.; Kostyukhin, V. V.; Kotov, V. M.; Kotwal, A.; Kourkoumeli-Charalampidi, A.; Kourkoumelis, C.; Kouskoura, V.; Koutsman, A.; Kowalewski, R.; Kowalski, T. Z.; Kozanecki, W.; Kozhin, A. S.; Kramarenko, V. A.; Kramberger, G.; Krasnopevtsev, D.; Krasny, M. W.; Krasznahorkay, A.; Kraus, J. K.; Kravchenko, A.; Kreiss, S.; Kretz, M.; Kretzschmar, J.; Kreutzfeldt, K.; Krieger, P.; Krizka, K.; Kroeninger, K.; Kroha, H.; Kroll, J.; Kroseberg, J.; Krstic, J.; Kruchonak, U.; Krüger, H.; Krumnack, N.; Kruse, A.; Kruse, M. C.; Kruskal, M.; Kubota, T.; Kucuk, H.; Kuday, S.; Kuehn, S.; Kugel, A.; Kuger, F.; Kuhl, A.; Kuhl, T.; Kukhtin, V.; Kukla, R.; Kulchitsky, Y.; Kuleshov, S.; Kuna, M.; Kunigo, T.; Kupco, A.; Kurashige, H.; Kurochkin, Y. A.; Kus, V.; Kuwertz, E. S.; Kuze, M.; Kvita, J.; Kwan, T.; Kyriazopoulos, D.; La Rosa, A.; La Rosa Navarro, J. L.; La Rotonda, L.; Lacasta, C.; Lacava, F.; Lacey, J.; Lacker, H.; Lacour, D.; Lacuesta, V. R.; Ladygin, E.; Lafaye, R.; Laforge, B.; Lagouri, T.; Lai, S.; Lambourne, L.; Lammers, S.; Lampen, C. L.; Lampl, W.; Lançon, E.; Landgraf, U.; Landon, M. P. J.; Lang, V. S.; Lange, J. C.; Lankford, A. J.; Lanni, F.; Lantzsch, K.; Lanza, A.; Laplace, S.; Lapoire, C.; Laporte, J. F.; Lari, T.; Lasagni Manghi, F.; Lassnig, M.; Laurelli, P.; Lavrijsen, W.; Law, A. T.; Laycock, P.; Lazovich, T.; Le Dortz, O.; Le Guirriec, E.; Le Menedeu, E.; Leblanc, M.; Lecompte, T.; Ledroit-Guillon, F.; Lee, C. A.; Lee, S. C.; Lee, L.; Lefebvre, G.; Lefebvre, M.; Legger, F.; Leggett, C.; Lehan, A.; Lehmann Miotto, G.; Lei, X.; Leight, W. A.; Leisos, A.; Leister, A. G.; Leite, M. A. L.; Leitner, R.; Lellouch, D.; Lemmer, B.; Leney, K. J. C.; Lenz, T.; Lenzi, B.; Leone, R.; Leone, S.; Leonidopoulos, C.; Leontsinis, S.; Leroy, C.; Lester, C. G.; Levchenko, M.; Levêque, J.; Levin, D.; Levinson, L. J.; Levy, M.; Lewis, A.; Leyko, A. M.; Leyton, M.; Li, B.; Li, H.; Li, H. L.; Li, L.; Li, L.; Li, S.; Li, X.; Li, Y.; Liang, Z.; Liao, H.; Liberti, B.; Liblong, A.; Lichard, P.; Lie, K.; Liebal, J.; Liebig, W.; Limbach, C.; Limosani, A.; Lin, S. C.; Lin, T. H.; Linde, F.; Lindquist, B. E.; Linnemann, J. T.; Lipeles, E.; Lipniacka, A.; Lisovyi, M.; Liss, T. M.; Lissauer, D.; Lister, A.; Litke, A. M.; Liu, B.; Liu, D.; Liu, H.; Liu, J.; Liu, J. B.; Liu, K.; Liu, L.; Liu, M.; Liu, M.; Liu, Y.; Livan, M.; Lleres, A.; Llorente Merino, J.; Lloyd, S. L.; Lo Sterzo, F.; Lobodzinska, E.; Loch, P.; Lockman, W. S.; Loebinger, F. K.; Loevschall-Jensen, A. E.; Loew, K. M.; Loginov, A.; Lohse, T.; Lohwasser, K.; Lokajicek, M.; Long, B. A.; Long, J. D.; Long, R. E.; Looper, K. A.; Lopes, L.; Lopez Mateos, D.; Lopez Paredes, B.; Lopez Paz, I.; Lorenz, J.; Lorenzo Martinez, N.; Losada, M.; Lösel, P. J.; Lou, X.; Lounis, A.; Love, J.; Love, P. A.; Lu, H.; Lu, N.; Lubatti, H. J.; Luci, C.; Lucotte, A.; Luedtke, C.; Luehring, F.; Lukas, W.; Luminari, L.; Lundberg, O.; Lund-Jensen, B.; Lynn, D.; Lysak, R.; Lytken, E.; Ma, H.; Ma, L. L.; Maccarrone, G.; Macchiolo, A.; MacDonald, C. M.; Maček, B.; Machado Miguens, J.; Macina, D.; Madaffari, D.; Madar, R.; Maddocks, H. J.; Mader, W. F.; Madsen, A.; Maeda, J.; Maeland, S.; Maeno, T.; Maevskiy, A.; Magradze, E.; Mahboubi, K.; Mahlstedt, J.; Maiani, C.; Maidantchik, C.; Maier, A. A.; Maier, T.; Maio, A.; Majewski, S.; Makida, Y.; Makovec, N.; Malaescu, B.; Malecki, Pa.; Maleev, V. P.; Malek, F.; Mallik, U.; Malon, D.; Malone, C.; Maltezos, S.; Malyshev, V. M.; Malyukov, S.; Mamuzic, J.; Mancini, G.; Mandelli, B.; Mandelli, L.; Mandić, I.; Mandrysch, R.; Maneira, J.; Manhaes de Andrade Filho, L.; Manjarres Ramos, J.; Mann, A.; Manousakis-Katsikakis, A.; Mansoulie, B.; Mantifel, R.; Mantoani, M.; Mapelli, L.; March, L.; Marchiori, G.; Marcisovsky, M.; Marino, C. P.; Marjanovic, M.; Marley, D. E.; Marroquim, F.; Marsden, S. P.; Marshall, Z.; Marti, L. F.; Marti-Garcia, S.; Martin, B.; Martin, T. A.; Martin, V. J.; Martin Dit Latour, B.; Martinez, M.; Martin-Haugh, S.; Martoiu, V. S.; Martyniuk, A. C.; Marx, M.; Marzano, F.; Marzin, A.; Masetti, L.; Mashimo, T.; Mashinistov, R.; Masik, J.; Maslennikov, A. L.; Massa, I.; Massa, L.; Mastrandrea, P.; Mastroberardino, A.; Masubuchi, T.; Mättig, P.; Mattmann, J.; Maurer, J.; Maxfield, S. J.; Maximov, D. A.; Mazini, R.; Mazza, S. M.; Mc Goldrick, G.; Mc Kee, S. P.; McCarn, A.; McCarthy, R. L.; McCarthy, T. G.; McCubbin, N. A.; McFarlane, K. W.; McFayden, J. A.; McHedlidze, G.; McMahon, S. J.; McPherson, R. A.; Medinnis, M.; Meehan, S.; Mehlhase, S.; Mehta, A.; Meier, K.; Meineck, C.; Meirose, B.; Mellado Garcia, B. R.; Meloni, F.; Mengarelli, A.; Menke, S.; Meoni, E.; Mercurio, K. M.; Mergelmeyer, S.; Mermod, P.; Merola, L.; Meroni, C.; Merritt, F. S.; Messina, A.; Metcalfe, J.; Mete, A. S.; Meyer, C.; Meyer, C.; Meyer, J.-P.; Meyer, J.; Meyer Zu Theenhausen, H.; Middleton, R. P.; Miglioranzi, S.; Mijović, L.; Mikenberg, G.; Mikestikova, M.; Mikuž, M.; Milesi, M.; Milic, A.; Miller, D. W.; Mills, C.; Milov, A.; Milstead, D. A.; Minaenko, A. A.; Minami, Y.; Minashvili, I. A.; Mincer, A. I.; Mindur, B.; Mineev, M.; Ming, Y.; Mir, L. M.; Mistry, K. P.; Mitani, T.; Mitrevski, J.; Mitsou, V. A.; Miucci, A.; Miyagawa, P. S.; Mjörnmark, J. U.; Moa, T.; Mochizuki, K.; Mohapatra, S.; Mohr, W.; Molander, S.; Moles-Valls, R.; Monden, R.; Mondragon, M. C.; Mönig, K.; Monini, C.; Monk, J.; Monnier, E.; Montalbano, A.; Montejo Berlingen, J.; Monticelli, F.; Monzani, S.; Moore, R. W.; Morange, N.; Moreno, D.; Moreno Llácer, M.; Morettini, P.; Mori, D.; Mori, T.; Morii, M.; Morinaga, M.; Morisbak, V.; Moritz, S.; Morley, A. K.; Mornacchi, G.; Morris, J. D.; Mortensen, S. S.; Morton, A.; Morvaj, L.; Mosidze, M.; Moss, J.; Motohashi, K.; Mount, R.; Mountricha, E.; Mouraviev, S. V.; Moyse, E. J. W.; Muanza, S.; Mudd, R. D.; Mueller, F.; Mueller, J.; Mueller, R. S. P.; Mueller, T.; Muenstermann, D.; Mullen, P.; Mullier, G. A.; Munoz Sanchez, F. J.; Murillo Quijada, J. A.; Murray, W. J.; Musheghyan, H.; Musto, E.; Myagkov, A. G.; Myska, M.; Nachman, B. P.; Nackenhorst, O.; Nadal, J.; Nagai, K.; Nagai, R.; Nagai, Y.; Nagano, K.; Nagarkar, A.; Nagasaka, Y.; Nagata, K.; Nagel, M.; Nagy, E.; Nairz, A. M.; Nakahama, Y.; Nakamura, K.; Nakamura, T.; Nakano, I.; Namasivayam, H.; Naranjo Garcia, R. F.; Narayan, R.; Narrias Villar, D. I.; Naumann, T.; Navarro, G.; Nayyar, R.; Neal, H. A.; Nechaeva, P. Yu.; Neep, T. J.; Nef, P. D.; Negri, A.; Negrini, M.; Nektarijevic, S.; Nellist, C.; Nelson, A.; Nemecek, S.; Nemethy, P.; Nepomuceno, A. A.; Nessi, M.; Neubauer, M. S.; Neumann, M.; Neves, R. M.; Nevski, P.; Newman, P. R.; Nguyen, D. H.; Nickerson, R. B.; Nicolaidou, R.; Nicquevert, B.; Nielsen, J.; Nikiforou, N.; Nikiforov, A.; Nikolaenko, V.; Nikolic-Audit, I.; Nikolopoulos, K.; Nilsen, J. K.; Nilsson, P.; Ninomiya, Y.; Nisati, A.; Nisius, R.; Nobe, T.; Nomachi, M.; Nomidis, I.; Nooney, T.; Norberg, S.; Nordberg, M.; Novgorodova, O.; Nowak, S.; Nozaki, M.; Nozka, L.; Ntekas, K.; Nunes Hanninger, G.; Nunnemann, T.; Nurse, E.; Nuti, F.; O'Grady, F.; O'Neil, D. C.; O'Shea, V.; Oakham, F. G.; Oberlack, H.; Obermann, T.; Ocariz, J.; Ochi, A.; Ochoa, I.; Ochoa-Ricoux, J. P.; Oda, S.; Odaka, S.; Ogren, H.; Oh, A.; Oh, S. H.; Ohm, C. C.; Ohman, H.; Oide, H.; Okamura, W.; Okawa, H.; Okumura, Y.; Okuyama, T.; Olariu, A.; Olivares Pino, S. A.; Oliveira Damazio, D.; Olszewski, A.; Olszowska, J.; Onofre, A.; Onogi, K.; Onyisi, P. U. E.; Oram, C. J.; Oreglia, M. J.; Oren, Y.; Orestano, D.; Orlando, N.; Oropeza Barrera, C.; Orr, R. S.; Osculati, B.; Ospanov, R.; Otero Y Garzon, G.; Otono, H.; Ouchrif, M.; Ould-Saada, F.; Ouraou, A.; Oussoren, K. P.; Ouyang, Q.; Ovcharova, A.; Owen, M.; Owen, R. E.; Ozcan, V. E.; Ozturk, N.; Pachal, K.; Pacheco Pages, A.; Padilla Aranda, C.; Pagáčová, M.; Pagan Griso, S.; Paganis, E.; Paige, F.; Pais, P.; Pajchel, K.; Palacino, G.; Palestini, S.; Palka, M.; Pallin, D.; Palma, A.; Pan, Y. B.; Panagiotopoulou, E. St.; Pandini, C. E.; Panduro Vazquez, J. G.; Pani, P.; Panitkin, S.; Pantea, D.; Paolozzi, L.; Papadopoulou, Th. D.; Papageorgiou, K.; Paramonov, A.; Paredes Hernandez, D.; Parker, M. A.; Parker, K. A.; Parodi, F.; Parsons, J. A.; Parzefall, U.; Pasqualucci, E.; Passaggio, S.; Pastore, F.; Pastore, Fr.; Pásztor, G.; Pataraia, S.; Patel, N. D.; Pater, J. R.; Pauly, T.; Pearce, J.; Pearson, B.; Pedersen, L. E.; Pedersen, M.; Pedraza Lopez, S.; Pedro, R.; Peleganchuk, S. V.; Pelikan, D.; Penc, O.; Peng, C.; Peng, H.; Penning, B.; Penwell, J.; Perepelitsa, D. V.; Perez Codina, E.; Pérez García-Estañ, M. T.; Perini, L.; Pernegger, H.; Perrella, S.; Peschke, R.; Peshekhonov, V. D.; Peters, K.; Peters, R. F. Y.; Petersen, B. A.; Petersen, T. C.; Petit, E.; Petridis, A.; Petridou, C.; Petroff, P.; Petrolo, E.; Petrucci, F.; Pettersson, N. E.; Pezoa, R.; Phillips, P. W.; Piacquadio, G.; Pianori, E.; Picazio, A.; Piccaro, E.; Piccinini, M.; Pickering, M. A.; Piegaia, R.; Pignotti, D. T.; Pilcher, J. E.; Pilkington, A. D.; Pin, A. W. J.; Pina, J.; Pinamonti, M.; Pinfold, J. L.; Pingel, A.; Pires, S.; Pirumov, H.; Pitt, M.; Pizio, C.; Plazak, L.; Pleier, M.-A.; Pleskot, V.; Plotnikova, E.; Plucinski, P.; Pluth, D.; Poettgen, R.; Poggioli, L.; Pohl, D.; Polesello, G.; Poley, A.; Policicchio, A.; Polifka, R.; Polini, A.; Pollard, C. S.; Polychronakos, V.; Pommès, K.; Pontecorvo, L.; Pope, B. G.; Popeneciu, G. A.; Popovic, D. S.; Poppleton, A.; Pospisil, S.; Potamianos, K.; Potrap, I. N.; Potter, C. J.; Potter, C. T.; Poulard, G.; Poveda, J.; Pozdnyakov, V.; Pozo Astigarraga, M. E.; Pralavorio, P.; Pranko, A.; Prasad, S.; Prell, S.; Price, D.; Price, L. E.; Primavera, M.; Prince, S.; Proissl, M.; Prokofiev, K.; Prokoshin, F.; Protopapadaki, E.; Protopopescu, S.; Proudfoot, J.; Przybycien, M.; Ptacek, E.; Puddu, D.; Pueschel, E.; Puldon, D.; Purohit, M.; Puzo, P.; Qian, J.; Qin, G.; Qin, Y.; Quadt, A.; Quarrie, D. R.; Quayle, W. B.; Queitsch-Maitland, M.; Quilty, D.; Raddum, S.; Radeka, V.; Radescu, V.; Radhakrishnan, S. K.; Radloff, P.; Rados, P.; Ragusa, F.; Rahal, G.; Rajagopalan, S.; Rammensee, M.; Rangel-Smith, C.; Rauscher, F.; Rave, S.; Ravenscroft, T.; Raymond, M.; Read, A. L.; Readioff, N. P.; Rebuzzi, D. M.; Redelbach, A.; Redlinger, G.; Reece, R.; Reeves, K.; Rehnisch, L.; Reichert, J.; Reisin, H.; Rembser, C.; Ren, H.; Renaud, A.; Rescigno, M.; Resconi, S.; Rezanova, O. L.; Reznicek, P.; Rezvani, R.; Richter, R.; Richter, S.; Richter-Was, E.; Ricken, O.; Ridel, M.; Rieck, P.; Riegel, C. J.; Rieger, J.; Rifki, O.; Rijssenbeek, M.; Rimoldi, A.; Rinaldi, L.; Ristić, B.; Ritsch, E.; Riu, I.; Rizatdinova, F.; Rizvi, E.; Robertson, S. H.; Robichaud-Veronneau, A.; Robinson, D.; Robinson, J. E. M.; Robson, A.; Roda, C.; Roe, S.; Røhne, O.; Romaniouk, A.; Romano, M.; Romano Saez, S. M.; Romero Adam, E.; Rompotis, N.; Ronzani, M.; Roos, L.; Ros, E.; Rosati, S.; Rosbach, K.; Rose, P.; Rosenthal, O.; Rossetti, V.; Rossi, E.; Rossi, L. P.; Rosten, J. H. N.; Rosten, R.; Rotaru, M.; Roth, I.; Rothberg, J.; Rousseau, D.; Royon, C. R.; Rozanov, A.; Rozen, Y.; Ruan, X.; Rubbo, F.; Rubinskiy, I.; Rud, V. I.; Rudolph, C.; Rudolph, M. S.; Rühr, F.; Ruiz-Martinez, A.; Rurikova, Z.; Rusakovich, N. A.; Ruschke, A.; Russell, H. L.; Rutherfoord, J. P.; Ruthmann, N.; Ryabov, Y. F.; Rybar, M.; Rybkin, G.; Ryder, N. C.; Ryzhov, A.; Saavedra, A. F.; Sabato, G.; Sacerdoti, S.; Saddique, A.; Sadrozinski, H. F.-W.; Sadykov, R.; Safai Tehrani, F.; Saha, P.; Sahinsoy, M.; Saimpert, M.; Saito, T.; Sakamoto, H.; Sakurai, Y.; Salamanna, G.; Salamon, A.; Salazar Loyola, J. E.; Saleem, M.; Salek, D.; Sales de Bruin, P. H.; Salihagic, D.; Salnikov, A.; Salt, J.; Salvatore, D.; Salvatore, F.; Salvucci, A.; Salzburger, A.; Sammel, D.; Sampsonidis, D.; Sanchez, A.; Sánchez, J.; Sanchez Martinez, V.; Sandaker, H.; Sandbach, R. L.; Sander, H. G.; Sanders, M. P.; Sandhoff, M.; Sandoval, C.; Sandstroem, R.; Sankey, D. P. C.; Sannino, M.; Sansoni, A.; Santoni, C.; Santonico, R.; Santos, H.; Santoyo Castillo, I.; Sapp, K.; Sapronov, A.; Saraiva, J. G.; Sarrazin, B.; Sasaki, O.; Sasaki, Y.; Sato, K.; Sauvage, G.; Sauvan, E.; Savage, G.; Savard, P.; Sawyer, C.; Sawyer, L.; Saxon, J.; Sbarra, C.; Sbrizzi, A.; Scanlon, T.; Scannicchio, D. A.; Scarcella, M.; Scarfone, V.; Schaarschmidt, J.; Schacht, P.; Schaefer, D.; Schaefer, R.; Schaeffer, J.; Schaepe, S.; Schaetzel, S.; Schäfer, U.; Schaffer, A. C.; Schaile, D.; Schamberger, R. D.; Scharf, V.; Schegelsky, V. A.; Scheirich, D.; Schernau, M.; Schiavi, C.; Schillo, C.; Schioppa, M.; Schlenker, S.; Schmieden, K.; Schmitt, C.; Schmitt, S.; Schmitt, S.; Schmitz, S.; Schneider, B.; Schnellbach, Y. J.; Schnoor, U.; Schoeffel, L.; Schoening, A.; Schoenrock, B. D.; Schopf, E.; Schorlemmer, A. L. S.; Schott, M.; Schouten, D.; Schovancova, J.; Schramm, S.; Schreyer, M.; Schuh, N.; Schultens, M. J.; Schultz-Coulon, H.-C.; Schulz, H.; Schumacher, M.; Schumm, B. A.; Schune, Ph.; Schwanenberger, C.; Schwartzman, A.; Schwarz, T. A.; Schwegler, Ph.; Schweiger, H.; Schwemling, Ph.; Schwienhorst, R.; Schwindling, J.; Schwindt, T.; Scifo, E.; Sciolla, G.; Scuri, F.; Scutti, F.; Searcy, J.; Sedov, G.; Sedykh, E.; Seema, P.; Seidel, S. C.; Seiden, A.; Seifert, F.; Seixas, J. M.; Sekhniaidze, G.; Sekhon, K.; Sekula, S. J.; Seliverstov, D. M.; Semprini-Cesari, N.; Serfon, C.; Serin, L.; Serkin, L.; Serre, T.; Sessa, M.; Seuster, R.; Severini, H.; Sfiligoj, T.; Sforza, F.; Sfyrla, A.; Shabalina, E.; Shamim, M.; Shan, L. Y.; Shang, R.; Shank, J. T.; Shapiro, M.; Shatalov, P. B.; Shaw, K.; Shaw, S. M.; Shcherbakova, A.; Shehu, C. Y.; Sherwood, P.; Shi, L.; Shimizu, S.; Shimmin, C. O.; Shimojima, M.; Shiyakova, M.; Shmeleva, A.; Shoaleh Saadi, D.; Shochet, M. J.; Shojaii, S.; Shrestha, S.; Shulga, E.; Shupe, M. A.; Sicho, P.; Sidebo, P. E.; Sidiropoulou, O.; Sidorov, D.; Sidoti, A.; Siegert, F.; Sijacki, Dj.; Silva, J.; Silver, Y.; Silverstein, S. B.; Simak, V.; Simard, O.; Simic, Lj.; Simion, S.; Simioni, E.; Simmons, B.; Simon, D.; Simon, M.; Sinervo, P.; Sinev, N. B.; Sioli, M.; Siragusa, G.; Sisakyan, A. N.; Sivoklokov, S. Yu.; Sjölin, J.; Sjursen, T. B.; Skinner, M. B.; Skottowe, H. P.; Skubic, P.; Slater, M.; Slavicek, T.; Slawinska, M.; Sliwa, K.; Smakhtin, V.; Smart, B. H.; Smestad, L.; Smirnov, S. Yu.; Smirnov, Y.; Smirnova, L. N.; Smirnova, O.; Smith, M. N. K.; Smith, R. W.; Smizanska, M.; Smolek, K.; Snesarev, A. A.; Snidero, G.; Snyder, S.; Sobie, R.; Socher, F.; Soffer, A.; Soh, D. A.; Sokhrannyi, G.; Solans, C. A.; Solar, M.; Solc, J.; Soldatov, E. Yu.; Soldevila, U.; Solodkov, A. A.; Soloshenko, A.; Solovyanov, O. V.; Solovyev, V.; Sommer, P.; Song, H. Y.; Soni, N.; Sood, A.; Sopczak, A.; Sopko, B.; Sopko, V.; Sorin, V.; Sosa, D.; Sosebee, M.; Sotiropoulou, C. L.; Soualah, R.; Soukharev, A. M.; South, D.; Sowden, B. C.; Spagnolo, S.; Spalla, M.; Spangenberg, M.; Spanò, F.; Spearman, W. R.; Sperlich, D.; Spettel, F.; Spighi, R.; Spigo, G.; Spiller, L. A.; Spousta, M.; St. Denis, R. D.; Stabile, A.; Staerz, S.; Stahlman, J.; Stamen, R.; Stamm, S.; Stanecka, E.; Stanescu, C.; Stanescu-Bellu, M.; Stanitzki, M. M.; Stapnes, S.; Starchenko, E. A.; Stark, J.; Staroba, P.; Starovoitov, P.; Staszewski, R.; Steinberg, P.; Stelzer, B.; Stelzer, H. J.; Stelzer-Chilton, O.; Stenzel, H.; Stewart, G. A.; Stillings, J. A.; Stockton, M. C.; Stoebe, M.; Stoicea, G.; Stolte, P.; Stonjek, S.; Stradling, A. R.; Straessner, A.; Stramaglia, M. E.; Strandberg, J.; Strandberg, S.; Strandlie, A.; Strauss, E.; Strauss, M.; Strizenec, P.; Ströhmer, R.; Strom, D. M.; Stroynowski, R.; Strubig, A.; Stucci, S. A.; Stugu, B.; Styles, N. A.; Su, D.; Su, J.; Subramaniam, R.; Succurro, A.; Suchek, S.; Sugaya, Y.; Suk, M.; Sulin, V. V.; Sultansoy, S.; Sumida, T.; Sun, S.; Sun, X.; Sundermann, J. E.; Suruliz, K.; Susinno, G.; Sutton, M. R.; Suzuki, S.; Svatos, M.; Swiatlowski, M.; Sykora, I.; Sykora, T.; Ta, D.; Taccini, C.; Tackmann, K.; Taenzer, J.; Taffard, A.; Tafirout, R.; Taiblum, N.; Takai, H.; Takashima, R.; Takeda, H.; Takeshita, T.; Takubo, Y.; Talby, M.; Talyshev, A. A.; Tam, J. Y. C.; Tan, K. G.; Tanaka, J.; Tanaka, R.; Tanaka, S.; Tannenwald, B. B.; Tapia Araya, S.; Tapprogge, S.; Tarem, S.; Tarrade, F.; Tartarelli, G. F.; Tas, P.; Tasevsky, M.; Tashiro, T.; Tassi, E.; Tavares Delgado, A.; Tayalati, Y.; Taylor, A. C.; Taylor, F. E.; Taylor, G. N.; Taylor, P. T. E.; Taylor, W.; Teischinger, F. A.; Teixeira Dias Castanheira, M.; Teixeira-Dias, P.; Temming, K. K.; Temple, D.; Ten Kate, H.; Teng, P. K.; Teoh, J. J.; Tepel, F.; Terada, S.; Terashi, K.; Terron, J.; Terzo, S.; Testa, M.; Teuscher, R. J.; Theveneaux-Pelzer, T.; Thomas, J. P.; Thomas-Wilsker, J.; Thompson, E. N.; Thompson, P. D.; Thompson, R. J.; Thompson, A. S.; Thomsen, L. A.; Thomson, E.; Thomson, M.; Thun, R. P.; Tibbetts, M. J.; Ticse Torres, R. E.; Tikhomirov, V. O.; Tikhonov, Yu. A.; Timoshenko, S.; Tiouchichine, E.; Tipton, P.; Tisserant, S.; Todome, K.; Todorov, T.; Todorova-Nova, S.; Tojo, J.; Tokár, S.; Tokushuku, K.; Tollefson, K.; Tolley, E.; Tomlinson, L.; Tomoto, M.; Tompkins, L.; Toms, K.; Torrence, E.; Torres, H.; Torró Pastor, E.; Toth, J.; Touchard, F.; Tovey, D. R.; Trefzger, T.; Tremblet, L.; Tricoli, A.; Trigger, I. M.; Trincaz-Duvoid, S.; Tripiana, M. F.; Trischuk, W.; Trocmé, B.; Troncon, C.; Trottier-McDonald, M.; Trovatelli, M.; Truong, L.; Trzebinski, M.; Trzupek, A.; Tsarouchas, C.; Tseng, J. C.-L.; Tsiareshka, P. V.; Tsionou, D.; Tsipolitis, G.; Tsirintanis, N.; Tsiskaridze, S.; Tsiskaridze, V.; Tskhadadze, E. G.; Tsui, K. M.; Tsukerman, I. I.; Tsulaia, V.; Tsuno, S.; Tsybychev, D.; Tudorache, A.; Tudorache, V.; Tuna, A. N.; Tupputi, S. A.; Turchikhin, S.; Turecek, D.; Turra, R.; Turvey, A. J.; Tuts, P. M.; Tykhonov, A.; Tylmad, M.; Tyndel, M.; Ueda, I.; Ueno, R.; Ughetto, M.; Ukegawa, F.; Unal, G.; Undrus, A.; Unel, G.; Ungaro, F. C.; Unno, Y.; Unverdorben, C.; Urban, J.; Urquijo, P.; Urrejola, P.; Usai, G.; Usanova, A.; Vacavant, L.; Vacek, V.; Vachon, B.; Valderanis, C.; Valencic, N.; Valentinetti, S.; Valero, A.; Valery, L.; Valkar, S.; Vallecorsa, S.; Valls Ferrer, J. A.; van den Wollenberg, W.; van der Deijl, P. C.; van der Geer, R.; van der Graaf, H.; van Eldik, N.; van Gemmeren, P.; van Nieuwkoop, J.; van Vulpen, I.; van Woerden, M. C.; Vanadia, M.; Vandelli, W.; Vanguri, R.; Vaniachine, A.; Vannucci, F.; Vardanyan, G.; Vari, R.; Varnes, E. W.; Varol, T.; Varouchas, D.; Vartapetian, A.; Varvell, K. E.; Vazeille, F.; Vazquez Schroeder, T.; Veatch, J.; Veloce, L. M.; Veloso, F.; Velz, T.; Veneziano, S.; Ventura, A.; Ventura, D.; Venturi, M.; Venturi, N.; Venturini, A.; Vercesi, V.; Verducci, M.; Verkerke, W.; Vermeulen, J. C.; Vest, A.; Vetterli, M. C.; Viazlo, O.; Vichou, I.; Vickey, T.; Vickey Boeriu, O. E.; Viehhauser, G. H. A.; Viel, S.; Vigne, R.; Villa, M.; Villaplana Perez, M.; Vilucchi, E.; Vincter, M. G.; Vinogradov, V. B.; Vivarelli, I.; Vlachos, S.; Vladoiu, D.; Vlasak, M.; Vogel, M.; Vokac, P.; Volpi, G.; Volpi, M.; von der Schmitt, H.; von Radziewski, H.; von Toerne, E.; Vorobel, V.; Vorobev, K.; Vos, M.; Voss, R.; Vossebeld, J. H.; Vranjes, N.; Vranjes Milosavljevic, M.; Vrba, V.; Vreeswijk, M.; Vuillermet, R.; Vukotic, I.; Vykydal, Z.; Wagner, P.; Wagner, W.; Wahlberg, H.; Wahrmund, S.; Wakabayashi, J.; Walder, J.; Walker, R.; Walkowiak, W.; Wang, C.; Wang, F.; Wang, H.; Wang, H.; Wang, J.; Wang, J.; Wang, K.; Wang, R.; Wang, S. M.; Wang, T.; Wang, T.; Wang, X.; Wanotayaroj, C.; Warburton, A.; Ward, C. P.; Wardrope, D. R.; Washbrook, A.; Wasicki, C.; Watkins, P. M.; Watson, A. T.; Watson, I. J.; Watson, M. F.; Watts, G.; Watts, S.; Waugh, B. M.; Webb, S.; Weber, M. S.; Weber, S. W.; Webster, J. S.; Weidberg, A. R.; Weinert, B.; Weingarten, J.; Weiser, C.; Weits, H.; Wells, P. S.; Wenaus, T.; Wengler, T.; Wenig, S.; Wermes, N.; Werner, M.; Werner, P.; Wessels, M.; Wetter, J.; Whalen, K.; Wharton, A. M.; White, A.; White, M. J.; White, R.; White, S.; Whiteson, D.; Wickens, F. J.; Wiedenmann, W.; Wielers, M.; Wienemann, P.; Wiglesworth, C.; Wiik-Fuchs, L. A. M.; Wildauer, A.; Wilkens, H. G.; Williams, H. H.; Williams, S.; Willis, C.; Willocq, S.; Wilson, A.; Wilson, J. A.; Wingerter-Seez, I.; Winklmeier, F.; Winter, B. T.; Wittgen, M.; Wittkowski, J.; Wollstadt, S. J.; Wolter, M. W.; Wolters, H.; Wosiek, B. K.; Wotschack, J.; Woudstra, M. J.; Wozniak, K. W.; Wu, M.; Wu, M.; Wu, S. L.; Wu, X.; Wu, Y.; Wyatt, T. R.; Wynne, B. M.; Xella, S.; Xu, D.; Xu, L.; Yabsley, B.; Yacoob, S.; Yakabe, R.; Yamada, M.; Yamaguchi, D.; Yamaguchi, Y.; Yamamoto, A.; Yamamoto, S.; Yamanaka, T.; Yamauchi, K.; Yamazaki, Y.; Yan, Z.; Yang, H.; Yang, H.; Yang, Y.; Yao, W.-M.; Yap, Y. C.; Yasu, Y.; Yatsenko, E.; Yau Wong, K. H.; Ye, J.; Ye, S.; Yeletskikh, I.; Yen, A. L.; Yildirim, E.; Yorita, K.; Yoshida, R.; Yoshihara, K.; Young, C.; Young, C. J. S.; Youssef, S.; Yu, D. R.; Yu, J.; Yu, J. M.; Yu, J.; Yuan, L.; Yuen, S. P. Y.; Yurkewicz, A.; Yusuff, I.; Zabinski, B.; Zaidan, R.; Zaitsev, A. M.; Zalieckas, J.; Zaman, A.; Zambito, S.; Zanello, L.; Zanzi, D.; Zeitnitz, C.; Zeman, M.; Zemla, A.; Zeng, J. C.; Zeng, Q.; Zengel, K.; Zenin, O.; Ženiš, T.; Zerwas, D.; Zhang, D.; Zhang, F.; Zhang, G.; Zhang, H.; Zhang, J.; Zhang, L.; Zhang, R.; Zhang, X.; Zhang, Z.; Zhao, X.; Zhao, Y.; Zhao, Z.; Zhemchugov, A.; Zhong, J.; Zhou, B.; Zhou, C.; Zhou, L.; Zhou, L.; Zhou, M.; Zhou, N.; Zhu, C. G.; Zhu, H.; Zhu, J.; Zhu, Y.; Zhuang, X.; Zhukov, K.; Zibell, A.; Zieminska, D.; Zimine, N. I.; Zimmermann, C.; Zimmermann, S.; Zinonos, Z.; Zinser, M.; Ziolkowski, M.; Živković, L.; Zobernig, G.; Zoccoli, A.; Zur Nedden, M.; Zurzolo, G.; Zwalinski, L.; Atlas Collaboration

2016-04-01

ATLAS has measured two-particle correlations as a function of the relative azimuthal angle, Δ ϕ , and pseudorapidity, Δ η , in √{s }=13 and 2.76 TeV p p collisions at the LHC using charged particles measured in the pseudorapidity interval |η |<2.5 . The correlation functions evaluated in different intervals of measured charged-particle multiplicity show a multiplicity-dependent enhancement at Δ ϕ ˜0 that extends over a wide range of Δ η , which has been referred to as the "ridge." Per-trigger-particle yields, Y (Δ ϕ ), are measured over 2 <|Δ η |<5 . For both collision energies, the Y (Δ ϕ ) distribution in all multiplicity intervals is found to be consistent with a linear combination of the per-trigger-particle yields measured in collisions with less than 20 reconstructed tracks, and a constant combinatoric contribution modulated by cos (2 Δ ϕ ) . The fitted Fourier coefficient, v2 ,2, exhibits factorization, suggesting that the ridge results from per-event cos (2 ϕ ) modulation of the single-particle distribution with Fourier coefficients v2. The v2 values are presented as a function of multiplicity and transverse momentum. They are found to be approximately constant as a function of multiplicity and to have a pT dependence similar to that measured in p +Pb and Pb +Pb collisions. The v2 values in the 13 and 2.76 TeV data are consistent within uncertainties. These results suggest that the ridge in p p collisions arises from the same or similar underlying physics as observed in p +Pb collisions, and that the dynamics responsible for the ridge has no strong √{s } dependence.

Sign rank versus Vapnik-Chervonenkis dimension

NASA Astrophysics Data System (ADS)

Alon, N.; Moran, Sh; Yehudayoff, A.

2017-12-01

This work studies the maximum possible sign rank of sign (N × N)-matrices with a given Vapnik-Chervonenkis dimension d. For d=1, this maximum is three. For d=2, this maximum is \\widetilde{\\Theta}(N1/2). For d >2, similar but slightly less accurate statements hold. The lower bounds improve on previous ones by Ben-David et al., and the upper bounds are novel. The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given Vapnik-Chervonenkis dimension, and the number of maximum classes of a given Vapnik-Chervonenkis dimension--answering a question of Frankl from 1989, and (ii) design an efficient algorithm that provides an O(N/log(N)) multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the adjacency (N × N)-matrix of a Δ-regular graph with a second eigenvalue of absolute value λ and Δ ≤ N/2. We show that the sign rank of the signed version of this matrix is at least Δ/λ. We use this connection to prove the existence of a maximum class C\\subseteq\\{+/- 1\\}^N with Vapnik-Chervonenkis dimension 2 and sign rank \\widetilde{\\Theta}(N1/2). This answers a question of Ben-David et al. regarding the sign rank of large Vapnik-Chervonenkis classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics. Bibliography: 69 titles.

Observation of Long-Range Elliptic Azimuthal Anisotropies in sqrt[s]=13 and 2.76 TeV pp Collisions with the ATLAS Detector.

PubMed

Aad, G; Abbott, B; Abdallah, J; Abdinov, O; Aben, R; Abolins, M; AbouZeid, O S; Abramowicz, H; Abreu, H; Abreu, R; Abulaiti, Y; Acharya, B S; Adamczyk, L; Adams, D L; Adelman, J; Adomeit, S; Adye, T; Affolder, A A; Agatonovic-Jovin, T; Agricola, J; Aguilar-Saavedra, J A; Ahlen, S P; Ahmadov, F; Aielli, G; Akerstedt, H; Åkesson, T P A; Akimov, A V; Alberghi, G L; Albert, J; Albrand, S; Alconada Verzini, M J; Aleksa, M; Aleksandrov, I N; Alexa, C; Alexander, G; Alexopoulos, T; Alhroob, M; Alimonti, G; Alio, L; Alison, J; Alkire, S P; Allbrooke, B M M; Allport, P P; Aloisio, A; Alonso, A; Alonso, F; Alpigiani, C; Altheimer, A; Alvarez Gonzalez, B; Álvarez Piqueras, D; Alviggi, M G; Amadio, B T; Amako, K; Amaral Coutinho, Y; Amelung, C; Amidei, D; Amor Dos Santos, S P; Amorim, A; Amoroso, S; Amram, N; Amundsen, G; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, G; Anders, J K; Anderson, K J; Andreazza, A; Andrei, V; Angelidakis, S; Angelozzi, I; Anger, P; Angerami, A; Anghinolfi, F; Anisenkov, A V; Anjos, N; Annovi, A; Antonelli, M; Antonov, A; Antos, J; Anulli, F; Aoki, M; Aperio Bella, L; Arabidze, G; Arai, Y; Araque, J P; Arce, A T H; Arduh, F A; Arguin, J-F; Argyropoulos, S; Arik, M; Armbruster, A J; Arnaez, O; Arnold, H; Arratia, M; Arslan, O; Artamonov, A; Artoni, G; Artz, S; Asai, S; Asbah, N; Ashkenazi, A; Åsman, B; Asquith, L; Assamagan, K; Astalos, R; Atkinson, M; Atlay, N B; Augsten, K; Aurousseau, M; Avolio, G; Axen, B; Ayoub, M K; Azuelos, G; Baak, M A; Baas, A E; Baca, M J; Bacci, C; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Bagiacchi, P; Bagnaia, P; Bai, Y; Bain, T; Baines, J T; Baker, O K; Baldin, E M; Balek, P; Balestri, T; Balli, F; Balunas, W K; Banas, E; Banerjee, Sw; Bannoura, A A E; Barak, L; Barberio, E L; Barberis, D; Barbero, M; Barillari, T; Barisonzi, M; Barklow, T; Barlow, N; Barnes, S L; Barnett, B M; Barnett, R M; Barnovska, Z; Baroncelli, A; Barone, G; Barr, A J; Barreiro, F; Barreiro Guimarães da Costa, J; Bartoldus, R; Barton, A E; Bartos, P; Basalaev, A; Bassalat, A; Basye, A; Bates, R L; Batista, S J; Batley, J R; Battaglia, M; Bauce, M; Bauer, F; Bawa, H S; Beacham, J B; Beattie, M D; Beau, T; Beauchemin, P H; Beccherle, R; Bechtle, P; Beck, H P; Becker, K; Becker, M; Beckingham, M; Becot, C; Beddall, A J; Beddall, A; Bednyakov, V A; Bee, C P; Beemster, L J; Beermann, T A; Begel, M; Behr, J K; Belanger-Champagne, C; Bell, W H; Bella, G; Bellagamba, L; Bellerive, A; Bellomo, M; Belotskiy, K; Beltramello, O; Benary, O; Benchekroun, D; Bender, M; Bendtz, K; Benekos, N; Benhammou, Y; Benhar Noccioli, E; Benitez Garcia, J A; Benjamin, D P; Bensinger, J R; Bentvelsen, S; Beresford, L; Beretta, M; Berge, D; Bergeaas Kuutmann, E; Berger, N; Berghaus, F; Beringer, J; Bernard, C; Bernard, N R; Bernius, C; Bernlochner, F U; Berry, T; Berta, P; Bertella, C; Bertoli, G; Bertolucci, F; Bertsche, C; Bertsche, D; Besana, M I; Besjes, G J; Bessidskaia Bylund, O; Bessner, M; Besson, N; Betancourt, C; Bethke, S; Bevan, A J; Bhimji, W; Bianchi, R M; Bianchini, L; Bianco, M; Biebel, O; Biedermann, D; Biesuz, N V; Biglietti, M; Bilbao De Mendizabal, J; Bilokon, H; Bindi, M; Binet, S; Bingul, A; Bini, C; Biondi, S; Bjergaard, D M; Black, C W; Black, J E; Black, K M; Blackburn, D; Blair, R E; Blanchard, J-B; Blanco, J E; Blazek, T; Bloch, I; Blocker, C; Blum, W; Blumenschein, U; Blunier, S; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Bock, C; Boehler, M; Bogaerts, J A; Bogavac, D; Bogdanchikov, A G; Bohm, C; Boisvert, V; Bold, T; Boldea, V; Boldyrev, A S; Bomben, M; Bona, M; Boonekamp, M; Borisov, A; Borissov, G; Borroni, S; Bortfeldt, J; Bortolotto, V; Bos, K; Boscherini, D; Bosman, M; Boudreau, J; Bouffard, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Bousson, N; Boutle, S K; Boveia, A; Boyd, J; Boyko, I R; Bozic, I; Bracinik, J; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Braun, H M; Breaden Madden, W D; Brendlinger, K; Brennan, A J; Brenner, L; Brenner, R; Bressler, S; Bristow, T M; Britton, D; Britzger, D; Brochu, F M; Brock, I; Brock, R; Bronner, J; Brooijmans, G; Brooks, T; Brooks, W K; Brosamer, J; Brost, E; Bruckman de Renstrom, P A; Bruncko, D; Bruneliere, R; Bruni, A; Bruni, G; Bruschi, M; Bruscino, N; Bryngemark, L; Buanes, T; Buat, Q; Buchholz, P; Buckley, A G; Budagov, I A; Buehrer, F; Bugge, L; Bugge, M K; Bulekov, O; Bullock, D; Burckhart, H; Burdin, S; Burgard, C D; Burghgrave, B; Burke, S; Burmeister, I; Busato, E; Büscher, D; Büscher, V; Bussey, P; Butler, J M; Butt, A I; Buttar, C M; Butterworth, J M; Butti, P; Buttinger, W; Buzatu, A; Buzykaev, A R; Cabrera Urbán, S; Caforio, D; Cairo, V M; Cakir, O; Calace, N; Calafiura, P; Calandri, A; Calderini, G; Calfayan, P; Caloba, L P; Calvet, D; Calvet, S; Camacho Toro, R; Camarda, S; Camarri, P; Cameron, D; Caminal Armadans, R; Campana, S; Campanelli, M; Campoverde, A; Canale, V; Canepa, A; Cano Bret, M; Cantero, J; Cantrill, R; Cao, T; Capeans Garrido, M D M; Caprini, I; Caprini, M; Capua, M; Caputo, R; Carbone, R M; Cardarelli, R; Cardillo, F; Carli, T; Carlino, G; Carminati, L; Caron, S; Carquin, E; Carrillo-Montoya, G D; Carter, J R; Carvalho, J; Casadei, D; Casado, M P; Casolino, M; Casper, D W; Castaneda-Miranda, E; Castelli, A; Castillo Gimenez, V; Castro, N F; Catastini, P; Catinaccio, A; Catmore, J R; Cattai, A; Caudron, J; Cavaliere, V; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Ceradini, F; Cerda Alberich, L; Cerio, B C; Cerny, K; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cerv, M; Cervelli, A; Cetin, S A; Chafaq, A; Chakraborty, D; Chalupkova, I; Chan, Y L; Chang, P; Chapman, J D; Charlton, D G; Chau, C C; Chavez Barajas, C A; Cheatham, S; Chegwidden, A; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, H; Chen, K; Chen, L; Chen, S; Chen, S; Chen, X; Chen, Y; Cheng, H C; Cheng, Y; Cheplakov, A; Cheremushkina, E; Cherkaoui El Moursli, R; Chernyatin, V; Cheu, E; Chevalier, L; Chiarella, V; Chiarelli, G; Chiodini, G; Chisholm, A S; Chislett, R T; Chitan, A; Chizhov, M V; Choi, K; Chouridou, S; Chow, B K B; Christodoulou, V; Chromek-Burckhart, D; Chudoba, J; Chuinard, A J; Chwastowski, J J; Chytka, L; Ciapetti, G; Ciftci, A K; Cinca, D; Cindro, V; Cioara, I A; Ciocio, A; Cirotto, F; Citron, Z H; Ciubancan, M; Clark, A; Clark, B L; Clark, P J; Clarke, R N; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Coffey, L; Colasurdo, L; Cole, B; Cole, S; Colijn, A P; Collot, J; Colombo, T; Compostella, G; Conde Muiño, P; Coniavitis, E; Connell, S H; Connelly, I A; Consorti, V; Constantinescu, S; Conta, C; Conti, G; Conventi, F; Cooke, M; Cooper, B D; Cooper-Sarkar, A M; Cornelissen, T; Corradi, M; Corriveau, F; Corso-Radu, A; Cortes-Gonzalez, A; Cortiana, G; Costa, G; Costa, M J; Costanzo, D; Côté, D; Cottin, G; Cowan, G; Cox, B E; Cranmer, K; Cree, G; Crépé-Renaudin, S; Crescioli, F; Cribbs, W A; Crispin Ortuzar, M; Cristinziani, M; Croft, V; Crosetti, G; Cuhadar Donszelmann, T; Cummings, J; Curatolo, M; Cúth, J; Cuthbert, C; Czirr, H; Czodrowski, P; D'Auria, S; D'Onofrio, M; Da Cunha Sargedas De Sousa, M J; Da Via, C; Dabrowski, W; Dafinca, A; Dai, T; Dale, O; Dallaire, F; Dallapiccola, C; Dam, M; Dandoy, J R; Dang, N P; Daniells, A C; Danninger, M; Dano Hoffmann, M; Dao, V; Darbo, G; Darmora, S; Dassoulas, J; Dattagupta, A; Davey, W; David, C; Davidek, T; Davies, E; Davies, M; Davison, P; Davygora, Y; Dawe, E; Dawson, I; Daya-Ishmukhametova, R K; De, K; de Asmundis, R; De Benedetti, A; De Castro, S; De Cecco, S; De Groot, N; de Jong, P; De la Torre, H; De Lorenzi, F; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Vivie De Regie, J B; Dearnaley, W J; Debbe, R; Debenedetti, C; Dedovich, D V; Deigaard, I; Del Peso, J; Del Prete, T; Delgove, D; Deliot, F; Delitzsch, C M; Deliyergiyev, M; Dell'Acqua, A; Dell'Asta, L; Dell'Orso, M; Della Pietra, M; Della Volpe, D; Delmastro, M; Delsart, P A; Deluca, C; DeMarco, D A; Demers, S; Demichev, M; Demilly, A; Denisov, S P; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deterre, C; Dette, K; Deviveiros, P O; Dewhurst, A; Dhaliwal, S; Di Ciaccio, A; Di Ciaccio, L; Di Domenico, A; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Mattia, A; Di Micco, B; Di Nardo, R; Di Simone, A; Di Sipio, R; Di Valentino, D; Diaconu, C; Diamond, M; Dias, F A; Diaz, M A; Diehl, E B; Dietrich, J; Diglio, S; Dimitrievska, A; Dingfelder, J; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; Djuvsland, J I; do Vale, M A B; Dobos, D; Dobre, M; Doglioni, C; Dohmae, T; Dolejsi, J; Dolezal, Z; Dolgoshein, B A; Donadelli, M; Donati, S; Dondero, P; Donini, J; Dopke, J; Doria, A; Dova, M T; Doyle, A T; Drechsler, E; Dris, M; Du, Y; Dubreuil, E; Duchovni, E; Duckeck, G; Ducu, O A; Duda, D; Dudarev, A; Duflot, L; Duguid, L; Dührssen, M; Dunford, M; Duran Yildiz, H; Düren, M; Durglishvili, A; Duschinger, D; Dutta, B; Dyndal, M; Eckardt, C; Ecker, K M; Edgar, R C; Edson, W; Edwards, N C; Ehrenfeld, W; Eifert, T; Eigen, G; Einsweiler, K; Ekelof, T; El Kacimi, M; Ellert, M; Elles, S; Ellinghaus, F; Elliot, A A; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Endner, O C; Endo, M; Erdmann, J; Ereditato, A; Ernis, G; Ernst, J; Ernst, M; Errede, S; Ertel, E; Escalier, M; Esch, H; Escobar, C; Esposito, B; Etienvre, A I; Etzion, E; Evans, H; Ezhilov, A; Fabbri, L; Facini, G; Fakhrutdinov, R M; Falciano, S; Falla, R J; Faltova, J; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Faucci Giannelli, M; Favareto, A; Fayard, L; Fedin, O L; Fedorko, W; Feigl, S; Feligioni, L; Feng, C; Feng, E J; Feng, H; Fenyuk, A B; Feremenga, L; Fernandez Martinez, P; Fernandez Perez, S; Ferrando, J; Ferrari, A; Ferrari, P; Ferrari, R; Ferreira de Lima, D E; Ferrer, A; Ferrere, D; Ferretti, C; Ferretto Parodi, A; Fiascaris, M; Fiedler, F; Filipčič, A; Filipuzzi, M; Filthaut, F; Fincke-Keeler, M; Finelli, K D; Fiolhais, M C N; Fiorini, L; Firan, A; Fischer, A; Fischer, C; Fischer, J; Fisher, W C; Flaschel, N; Fleck, I; Fleischmann, P; Fletcher, G T; Fletcher, G; Fletcher, R R M; Flick, T; Floderus, A; Flores Castillo, L R; Flowerdew, M J; Forcolin, G T; Formica, A; Forti, A; Fournier, D; Fox, H; Fracchia, S; Francavilla, P; Franchini, M; Francis, D; Franconi, L; Franklin, M; Frate, M; Fraternali, M; Freeborn, D; French, S T; Fressard-Batraneanu, S M; Friedrich, F; Froidevaux, D; Frost, J A; Fukunaga, C; Fullana Torregrosa, E; Fulsom, B G; Fusayasu, T; Fuster, J; Gabaldon, C; Gabizon, O; Gabrielli, A; Gabrielli, A; Gach, G P; Gadatsch, S; Gadomski, S; Gagliardi, G; Gagnon, P; Galea, C; Galhardo, B; Gallas, E J; Gallop, B J; Gallus, P; Galster, G; Gan, K K; Gao, J; Gao, Y; Gao, Y S; Garay Walls, F M; Garberson, F; García, C; García Navarro, J E; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Gatti, C; Gaudiello, A; Gaudio, G; Gaur, B; Gauthier, L; Gauzzi, P; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Ge, P; Gecse, Z; Gee, C N P; Geich-Gimbel, Ch; Geisler, M P; Gemme, C; Genest, M H; Geng, C; Gentile, S; George, S; Gerbaudo, D; Gershon, A; Ghasemi, S; Ghazlane, H; Giacobbe, B; Giagu, S; Giangiobbe, V; Giannetti, P; Gibbard, B; Gibson, S M; Gignac, M; Gilchriese, M; Gillam, T P S; Gillberg, D; Gilles, G; Gingrich, D M; Giokaris, N; Giordani, M P; Giorgi, F M; Giorgi, F M; Giraud, P F; Giromini, P; Giugni, D; Giuliani, C; Giulini, M; Gjelsten, B K; Gkaitatzis, S; Gkialas, I; Gkougkousis, E L; Gladilin, L K; Glasman, C; Glatzer, J; Glaysher, P C F; Glazov, A; Goblirsch-Kolb, M; Goddard, J R; Godlewski, J; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gonçalo, R; Goncalves Pinto Firmino Da Costa, J; Gonella, L; González de la Hoz, S; Gonzalez Parra, G; Gonzalez-Sevilla, S; Goossens, L; Gorbounov, P A; Gordon, H A; Gorelov, I; Gorini, B; Gorini, E; Gorišek, A; Gornicki, E; Goshaw, A T; Gössling, C; Gostkin, M I; Goujdami, D; Goussiou, A G; Govender, N; Gozani, E; Graber, L; Grabowska-Bold, I; Gradin, P O J; Grafström, P; Gramling, J; Gramstad, E; Grancagnolo, S; Gratchev, V; Gray, H M; Graziani, E; Greenwood, Z D; Grefe, C; Gregersen, K; Gregor, I M; Grenier, P; Griffiths, J; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grivaz, J-F; Groh, S; Grohs, J P; Grohsjean, A; Gross, E; Grosse-Knetter, J; Grossi, G C; Grout, Z J; Guan, L; Guenther, J; Guescini, F; Guest, D; Gueta, O; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gumpert, C; Guo, J; Guo, Y; Gupta, S; Gustavino, G; Gutierrez, P; Gutierrez Ortiz, N G; Gutschow, C; Guyot, C; Gwenlan, C; Gwilliam, C B; Haas, A; Haber, C; Hadavand, H K; Haddad, N; Haefner, P; Hageböck, S; Hajduk, Z; Hakobyan, H; Haleem, M; Haley, J; Hall, D; Halladjian, G; Hallewell, G D; Hamacher, K; Hamal, P; Hamano, K; Hamilton, A; Hamity, G N; Hamnett, P G; Han, L; Hanagaki, K; Hanawa, K; Hance, M; Haney, B; Hanke, P; Hanna, R; Hansen, J B; Hansen, J D; Hansen, M C; Hansen, P H; Hara, K; Hard, A S; Harenberg, T; Hariri, F; Harkusha, S; Harrington, R D; Harrison, P F; Hartjes, F; Hasegawa, M; Hasegawa, Y; Hasib, A; Hassani, S; Haug, S; Hauser, R; Hauswald, L; Havranek, M; Hawkes, C M; Hawkings, R J; Hawkins, A D; Hayashi, T; Hayden, D; Hays, C P; Hays, J M; Hayward, H S; Haywood, S J; Head, S J; Heck, T; Hedberg, V; Heelan, L; Heim, S; Heim, T; Heinemann, B; Heinrich, L; Hejbal, J; Helary, L; Hellman, S; Helsens, C; Henderson, J; Henderson, R C W; Heng, Y; Hengler, C; Henkelmann, S; Henrichs, A; Henriques Correia, A M; Henrot-Versille, S; Herbert, G H; Hernández Jiménez, Y; Herten, G; Hertenberger, R; Hervas, L; Hesketh, G G; Hessey, N P; Hetherly, J W; Hickling, R; Higón-Rodriguez, E; Hill, E; Hill, J C; Hiller, K H; Hillier, S J; Hinchliffe, I; Hines, E; Hinman, R R; Hirose, M; Hirschbuehl, D; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoenig, F; Hohlfeld, M; Hohn, D; Holmes, T R; Homann, M; Hong, T M; Hooberman, B H; Hopkins, W H; Horii, Y; Horton, A J; Hostachy, J-Y; Hou, S; Hoummada, A; Howard, J; Howarth, J; Hrabovsky, M; Hristova, I; Hrivnac, J; Hryn'ova, T; Hrynevich, A; Hsu, C; Hsu, P J; Hsu, S-C; Hu, D; Hu, Q; Hu, X; Huang, Y; Hubacek, Z; Hubaut, F; Huegging, F; Huffman, T B; Hughes, E W; Hughes, G; Huhtinen, M; Hülsing, T A; Huseynov, N; Huston, J; Huth, J; Iacobucci, G; Iakovidis, G; Ibragimov, I; Iconomidou-Fayard, L; Ideal, E; Idrissi, Z; Iengo, P; Igonkina, O; Iizawa, T; Ikegami, Y; Ikematsu, K; Ikeno, M; Ilchenko, Y; Iliadis, D; Ilic, N; Ince, T; Introzzi, G; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Irles Quiles, A; Isaksson, C; Ishino, M; Ishitsuka, M; Ishmukhametov, R; Issever, C; Istin, S; Iturbe Ponce, J M; Iuppa, R; Ivarsson, J; Iwanski, W; Iwasaki, H; Izen, J M; Izzo, V; Jabbar, S; Jackson, B; Jackson, M; Jackson, P; Jaekel, M R; Jain, V; Jakobi, K B; Jakobs, K; Jakobsen, S; Jakoubek, T; Jakubek, J; Jamin, D O; Jana, D K; Jansen, E; Jansky, R; Janssen, J; Janus, M; Jarlskog, G; Javadov, N; Javůrek, T; Jeanty, L; Jejelava, J; Jeng, G-Y; Jennens, D; Jenni, P; Jentzsch, J; Jeske, C; Jézéquel, S; Ji, H; Jia, J; Jiang, Y; Jiggins, S; Jimenez Pena, J; Jin, S; Jinaru, A; Jinnouchi, O; Joergensen, M D; Johansson, P; Johns, K A; Johnson, W J; Jon-And, K; Jones, G; Jones, R W L; Jones, T J; Jongmanns, J; Jorge, P M; Joshi, K D; Jovicevic, J; Ju, X; Juste Rozas, A; Kaci, M; Kaczmarska, A; Kado, M; Kagan, H; Kagan, M; Kahn, S J; Kajomovitz, E; Kalderon, C W; Kaluza, A; Kama, S; Kamenshchikov, A; Kanaya, N; Kaneti, S; Kantserov, V A; Kanzaki, J; Kaplan, B; Kaplan, L S; Kapliy, A; Kar, D; Karakostas, K; Karamaoun, A; Karastathis, N; Kareem, M J; Karentzos, E; Karnevskiy, M; Karpov, S N; Karpova, Z M; Karthik, K; Kartvelishvili, V; Karyukhin, A N; Kasahara, K; Kashif, L; Kass, R D; Kastanas, A; Kataoka, Y; Kato, C; Katre, A; Katzy, J; Kawade, K; Kawagoe, K; Kawamoto, T; Kawamura, G; Kazama, S; Kazanin, V F; Keeler, R; Kehoe, R; Keller, J S; Kempster, J J; Keoshkerian, H; Kepka, O; Kerševan, B P; Kersten, S; Keyes, R A; Khalil-Zada, F; Khandanyan, H; Khanov, A; Kharlamov, A G; Khoo, T J; Khovanskiy, V; Khramov, E; Khubua, J; Kido, S; Kim, H Y; Kim, S H; Kim, Y K; Kimura, N; Kind, O M; King, B T; King, M; King, S B; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kiss, F; Kiuchi, K; Kivernyk, O; Kladiva, E; Klein, M H; Klein, M; Klein, U; Kleinknecht, K; Klimek, P; Klimentov, A; Klingenberg, R; Klinger, J A; Klioutchnikova, T; Kluge, E-E; Kluit, P; Kluth, S; Knapik, J; Kneringer, E; Knoops, E B F G; Knue, A; Kobayashi, A; Kobayashi, D; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koffas, T; Koffeman, E; Kogan, L A; Kohlmann, S; Kohout, Z; Kohriki, T; Koi, T; Kolanoski, H; Kolb, M; Koletsou, I; Komar, A A; Komori, Y; Kondo, T; Kondrashova, N; Köneke, K; König, A C; Kono, T; Konoplich, R; Konstantinidis, N; Kopeliansky, R; Koperny, S; Köpke, L; Kopp, A K; Korcyl, K; Kordas, K; Korn, A; Korol, A A; Korolkov, I; Korolkova, E V; Kortner, O; Kortner, S; Kosek, T; Kostyukhin, V V; Kotov, V M; Kotwal, A; Kourkoumeli-Charalampidi, A; Kourkoumelis, C; Kouskoura, V; Koutsman, A; Kowalewski, R; Kowalski, T Z; Kozanecki, W; Kozhin, A S; Kramarenko, V A; Kramberger, G; Krasnopevtsev, D; Krasny, M W; Krasznahorkay, A; Kraus, J K; Kravchenko, A; Kreiss, S; Kretz, M; Kretzschmar, J; Kreutzfeldt, K; Krieger, P; Krizka, K; Kroeninger, K; Kroha, H; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Krumnack, N; Kruse, A; Kruse, M C; Kruskal, M; Kubota, T; Kucuk, H; Kuday, S; Kuehn, S; Kugel, A; Kuger, F; Kuhl, A; Kuhl, T; Kukhtin, V; Kukla, R; Kulchitsky, Y; Kuleshov, S; Kuna, M; Kunigo, T; Kupco, A; Kurashige, H; Kurochkin, Y A; Kus, V; Kuwertz, E S; Kuze, M; Kvita, J; Kwan, T; Kyriazopoulos, D; La Rosa, A; La Rosa Navarro, J L; La Rotonda, L; Lacasta, C; Lacava, F; Lacey, J; Lacker, H; Lacour, D; Lacuesta, V R; Ladygin, E; Lafaye, R; Laforge, B; Lagouri, T; Lai, S; Lambourne, L; Lammers, S; Lampen, C L; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lang, V S; Lange, J C; Lankford, A J; Lanni, F; Lantzsch, K; Lanza, A; Laplace, S; Lapoire, C; Laporte, J F; Lari, T; Lasagni Manghi, F; Lassnig, M; Laurelli, P; Lavrijsen, W; Law, A T; Laycock, P; Lazovich, T; Le Dortz, O; Le Guirriec, E; Le Menedeu, E; LeBlanc, M; LeCompte, T; Ledroit-Guillon, F; Lee, C A; Lee, S C; Lee, L; Lefebvre, G; Lefebvre, M; Legger, F; Leggett, C; Lehan, A; Lehmann Miotto, G; Lei, X; Leight, W A; Leisos, A; Leister, A G; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Leney, K J C; Lenz, T; Lenzi, B; Leone, R; Leone, S; Leonidopoulos, C; Leontsinis, S; Leroy, C; Lester, C G; Levchenko, M; Levêque, J; Levin, D; Levinson, L J; Levy, M; Lewis, A; Leyko, A M; Leyton, M; Li, B; Li, H; Li, H L; Li, L; Li, L; Li, S; Li, X; Li, Y; Liang, Z; Liao, H; Liberti, B; Liblong, A; Lichard, P; Lie, K; Liebal, J; Liebig, W; Limbach, C; Limosani, A; Lin, S C; Lin, T H; Linde, F; Lindquist, B E; Linnemann, J T; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lissauer, D; Lister, A; Litke, A M; Liu, B; Liu, D; Liu, H; Liu, J; Liu, J B; Liu, K; Liu, L; Liu, M; Liu, M; Liu, Y; Livan, M; Lleres, A; Llorente Merino, J; Lloyd, S L; Lo Sterzo, F; Lobodzinska, E; Loch, P; Lockman, W S; Loebinger, F K; Loevschall-Jensen, A E; Loew, K M; Loginov, A; Lohse, T; Lohwasser, K; Lokajicek, M; Long, B A; Long, J D; Long, R E; Looper, K A; Lopes, L; Lopez Mateos, D; Lopez Paredes, B; Lopez Paz, I; Lorenz, J; Lorenzo Martinez, N; Losada, M; Lösel, P J; Lou, X; Lounis, A; Love, J; Love, P A; Lu, H; Lu, N; Lubatti, H J; Luci, C; Lucotte, A; Luedtke, C; Luehring, F; Lukas, W; Luminari, L; Lundberg, O; Lund-Jensen, B; Lynn, D; Lysak, R; Lytken, E; Ma, H; Ma, L L; Maccarrone, G; Macchiolo, A; Macdonald, C M; Maček, B; Machado Miguens, J; Macina, D; Madaffari, D; Madar, R; Maddocks, H J; Mader, W F; Madsen, A; Maeda, J; Maeland, S; Maeno, T; Maevskiy, A; Magradze, E; Mahboubi, K; Mahlstedt, J; Maiani, C; Maidantchik, C; Maier, A A; Maier, T; Maio, A; Majewski, S; Makida, Y; Makovec, N; Malaescu, B; Malecki, Pa; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyshev, V M; Malyukov, S; Mamuzic, J; Mancini, G; Mandelli, B; Mandelli, L; Mandić, I; Mandrysch, R; Maneira, J; Manhaes de Andrade Filho, L; Manjarres Ramos, J; Mann, A; Manousakis-Katsikakis, A; Mansoulie, B; Mantifel, R; Mantoani, M; Mapelli, L; March, L; Marchiori, G; Marcisovsky, M; Marino, C P; Marjanovic, M; Marley, D E; Marroquim, F; Marsden, S P; Marshall, Z; Marti, L F; Marti-Garcia, S; Martin, B; Martin, T A; Martin, V J; Martin Dit Latour, B; Martinez, M; Martin-Haugh, S; Martoiu, V S; Martyniuk, A C; Marx, M; Marzano, F; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Massa, I; Massa, L; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Mättig, P; Mattmann, J; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Mazza, S M; Mc Goldrick, G; Mc Kee, S P; McCarn, A; McCarthy, R L; McCarthy, T G; McCubbin, N A; McFarlane, K W; Mcfayden, J A; Mchedlidze, G; McMahon, S J; McPherson, R A; Medinnis, M; Meehan, S; Mehlhase, S; Mehta, A; Meier, K; Meineck, C; Meirose, B; Mellado Garcia, B R; Meloni, F; Mengarelli, A; Menke, S; Meoni, E; Mercurio, K M; Mergelmeyer, S; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, C; Meyer, J-P; Meyer, J; Meyer Zu Theenhausen, H; Middleton, R P; Miglioranzi, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Milesi, M; Milic, A; Miller, D W; Mills, C; Milov, A; Milstead, D A; Minaenko, A A; Minami, Y; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Ming, Y; Mir, L M; Mistry, K P; Mitani, T; Mitrevski, J; Mitsou, V A; Miucci, A; Miyagawa, P S; Mjörnmark, J U; Moa, T; Mochizuki, K; Mohapatra, S; Mohr, W; Molander, S; Moles-Valls, R; Monden, R; Mondragon, M C; Mönig, K; Monini, C; Monk, J; Monnier, E; Montalbano, A; Montejo Berlingen, J; Monticelli, F; Monzani, S; Moore, R W; Morange, N; Moreno, D; Moreno Llácer, M; Morettini, P; Mori, D; Mori, T; Morii, M; Morinaga, M; Morisbak, V; Moritz, S; Morley, A K; Mornacchi, G; Morris, J D; Mortensen, S S; Morton, A; Morvaj, L; Mosidze, M; Moss, J; Motohashi, K; Mount, R; Mountricha, E; Mouraviev, S V; Moyse, E J W; Muanza, S; Mudd, R D; Mueller, F; Mueller, J; Mueller, R S P; Mueller, T; Muenstermann, D; Mullen, P; Mullier, G A; Munoz Sanchez, F J; Murillo Quijada, J A; Murray, W J; Musheghyan, H; Musto, E; Myagkov, A G; Myska, M; Nachman, B P; Nackenhorst, O; Nadal, J; Nagai, K; Nagai, R; Nagai, Y; Nagano, K; Nagarkar, A; Nagasaka, Y; Nagata, K; Nagel, M; Nagy, E; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Namasivayam, H; Naranjo Garcia, R F; Narayan, R; Narrias Villar, D I; Naumann, T; Navarro, G; Nayyar, R; Neal, H A; Nechaeva, P Yu; Neep, T J; Nef, P D; Negri, A; Negrini, M; Nektarijevic, S; Nellist, C; Nelson, A; Nemecek, S; Nemethy, P; Nepomuceno, A A; Nessi, M; Neubauer, M S; Neumann, M; Neves, R M; Nevski, P; Newman, P R; Nguyen, D H; Nickerson, R B; Nicolaidou, R; Nicquevert, B; Nielsen, J; Nikiforou, N; Nikiforov, A; Nikolaenko, V; Nikolic-Audit, I; Nikolopoulos, K; Nilsen, J K; Nilsson, P; Ninomiya, Y; Nisati, A; Nisius, R; Nobe, T; Nomachi, M; Nomidis, I; Nooney, T; Norberg, S; Nordberg, M; Novgorodova, O; Nowak, S; Nozaki, M; Nozka, L; Ntekas, K; Nunes Hanninger, G; Nunnemann, T; Nurse, E; Nuti, F; O'grady, F; O'Neil, D C; O'Shea, V; Oakham, F G; Oberlack, H; Obermann, T; Ocariz, J; Ochi, A; Ochoa, I; Ochoa-Ricoux, J P; Oda, S; Odaka, S; Ogren, H; Oh, A; Oh, S H; Ohm, C C; Ohman, H; Oide, H; Okamura, W; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Olivares Pino, S A; Oliveira Damazio, D; Olszewski, A; Olszowska, J; Onofre, A; Onogi, K; Onyisi, P U E; Oram, C J; Oreglia, M J; Oren, Y; Orestano, D; Orlando, N; Oropeza Barrera, C; Orr, R S; Osculati, B; Ospanov, R; Otero Y Garzon, G; Otono, H; Ouchrif, M; Ould-Saada, F; Ouraou, A; Oussoren, K P; Ouyang, Q; Ovcharova, A; Owen, M; Owen, R E; Ozcan, V E; Ozturk, N; Pachal, K; Pacheco Pages, A; Padilla Aranda, C; Pagáčová, M; Pagan Griso, S; Paganis, E; Paige, F; Pais, P; Pajchel, K; Palacino, G; Palestini, S; Palka, M; Pallin, D; Palma, A; Pan, Y B; Panagiotopoulou, E St; Pandini, C E; Panduro Vazquez, J G; Pani, P; Panitkin, S; Pantea, D; Paolozzi, L; Papadopoulou, Th D; Papageorgiou, K; Paramonov, A; Paredes Hernandez, D; Parker, M A; Parker, K A; Parodi, F; Parsons, J A; Parzefall, U; Pasqualucci, E; Passaggio, S; Pastore, F; Pastore, Fr; Pásztor, G; Pataraia, S; Patel, N D; Pater, J R; Pauly, T; Pearce, J; Pearson, B; Pedersen, L E; Pedersen, M; Pedraza Lopez, S; Pedro, R; Peleganchuk, S V; Pelikan, D; Penc, O; Peng, C; Peng, H; Penning, B; Penwell, J; Perepelitsa, D V; Perez Codina, E; Pérez García-Estañ, M T; Perini, L; Pernegger, H; Perrella, S; Peschke, R; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petroff, P; Petrolo, E; Petrucci, F; Pettersson, N E; Pezoa, R; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Piccaro, E; Piccinini, M; Pickering, M A; Piegaia, R; Pignotti, D T; Pilcher, J E; Pilkington, A D; Pin, A W J; Pina, J; Pinamonti, M; Pinfold, J L; Pingel, A; Pires, S; Pirumov, H; Pitt, M; Pizio, C; Plazak, L; Pleier, M-A; Pleskot, V; Plotnikova, E; Plucinski, P; Pluth, D; Poettgen, R; Poggioli, L; Pohl, D; Polesello, G; Poley, A; Policicchio, A; Polifka, R; Polini, A; Pollard, C S; Polychronakos, V; Pommès, K; Pontecorvo, L; Pope, B G; Popeneciu, G A; Popovic, D S; Poppleton, A; Pospisil, S; Potamianos, K; Potrap, I N; Potter, C J; Potter, C T; Poulard, G; Poveda, J; Pozdnyakov, V; Pozo Astigarraga, M E; Pralavorio, P; Pranko, A; Prasad, S; Prell, S; Price, D; Price, L E; Primavera, M; Prince, S; Proissl, M; Prokofiev, K; Prokoshin, F; Protopapadaki, E; Protopopescu, S; Proudfoot, J; Przybycien, M; Ptacek, E; Puddu, D; Pueschel, E; Puldon, D; Purohit, M; Puzo, P; Qian, J; Qin, G; Qin, Y; Quadt, A; Quarrie, D R; Quayle, W B; Queitsch-Maitland, M; Quilty, D; Raddum, S; Radeka, V; Radescu, V; Radhakrishnan, S K; Radloff, P; Rados, P; Ragusa, F; Rahal, G; Rajagopalan, S; Rammensee, M; Rangel-Smith, C; Rauscher, F; Rave, S; Ravenscroft, T; Raymond, M; Read, A L; Readioff, N P; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reeves, K; Rehnisch, L; Reichert, J; Reisin, H; Rembser, C; Ren, H; Renaud, A; Rescigno, M; Resconi, S; Rezanova, O L; Reznicek, P; Rezvani, R; Richter, R; Richter, S; Richter-Was, E; Ricken, O; Ridel, M; Rieck, P; Riegel, C J; Rieger, J; Rifki, O; Rijssenbeek, M; Rimoldi, A; Rinaldi, L; Ristić, B; Ritsch, E; Riu, I; Rizatdinova, F; Rizvi, E; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Roda, C; Roe, S; Røhne, O; Romaniouk, A; Romano, M; Romano Saez, S M; Romero Adam, E; Rompotis, N; Ronzani, M; Roos, L; Ros, E; Rosati, S; Rosbach, K; Rose, P; Rosenthal, O; Rossetti, V; Rossi, E; Rossi, L P; Rosten, J H N; Rosten, R; Rotaru, M; Roth, I; Rothberg, J; Rousseau, D; Royon, C R; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rubinskiy, I; Rud, V I; Rudolph, C; Rudolph, M S; Rühr, F; Ruiz-Martinez, A; Rurikova, Z; Rusakovich, N A; Ruschke, A; Russell, H L; Rutherfoord, J P; Ruthmann, N; Ryabov, Y F; Rybar, M; Rybkin, G; Ryder, N C; Ryzhov, A; Saavedra, A F; Sabato, G; Sacerdoti, S; Saddique, A; Sadrozinski, H F-W; Sadykov, R; Safai Tehrani, F; Saha, P; Sahinsoy, M; Saimpert, M; Saito, T; Sakamoto, H; Sakurai, Y; Salamanna, G; Salamon, A; Salazar Loyola, J E; Saleem, M; Salek, D; Sales De Bruin, P H; Salihagic, D; Salnikov, A; Salt, J; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sammel, D; Sampsonidis, D; Sanchez, A; Sánchez, J; Sanchez Martinez, V; Sandaker, H; Sandbach, R L; Sander, H G; Sanders, M P; Sandhoff, M; Sandoval, C; Sandstroem, R; Sankey, D P C; Sannino, M; Sansoni, A; Santoni, C; Santonico, R; Santos, H; Santoyo Castillo, I; Sapp, K; Sapronov, A; Saraiva, J G; Sarrazin, B; Sasaki, O; Sasaki, Y; Sato, K; Sauvage, G; Sauvan, E; Savage, G; Savard, P; Sawyer, C; Sawyer, L; Saxon, J; Sbarra, C; Sbrizzi, A; Scanlon, T; Scannicchio, D A; Scarcella, M; Scarfone, V; Schaarschmidt, J; Schacht, P; Schaefer, D; Schaefer, R; Schaeffer, J; Schaepe, S; Schaetzel, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Scharf, V; Schegelsky, V A; Scheirich, D; Schernau, M; Schiavi, C; Schillo, C; Schioppa, M; Schlenker, S; Schmieden, K; Schmitt, C; Schmitt, S; Schmitt, S; Schmitz, S; Schneider, B; Schnellbach, Y J; Schnoor, U; Schoeffel, L; Schoening, A; Schoenrock, B D; Schopf, E; Schorlemmer, A L S; Schott, M; Schouten, D; Schovancova, J; Schramm, S; Schreyer, M; Schuh, N; Schultens, M J; Schultz-Coulon, H-C; Schulz, H; Schumacher, M; Schumm, B A; Schune, Ph; Schwanenberger, C; Schwartzman, A; Schwarz, T A; Schwegler, Ph; Schweiger, H; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Schwindt, T; Scifo, E; Sciolla, G; Scuri, F; Scutti, F; Searcy, J; Sedov, G; Sedykh, E; Seema, P; Seidel, S C; Seiden, A; Seifert, F; Seixas, J M; Sekhniaidze, G; Sekhon, K; Sekula, S J; Seliverstov, D M; Semprini-Cesari, N; Serfon, C; Serin, L; Serkin, L; Serre, T; Sessa, M; Seuster, R; Severini, H; Sfiligoj, T; Sforza, F; Sfyrla, A; Shabalina, E; Shamim, M; Shan, L Y; Shang, R; Shank, J T; Shapiro, M; Shatalov, P B; Shaw, K; Shaw, S M; Shcherbakova, A; Shehu, C Y; Sherwood, P; Shi, L; Shimizu, S; Shimmin, C O; Shimojima, M; Shiyakova, M; Shmeleva, A; Shoaleh Saadi, D; Shochet, M J; Shojaii, S; Shrestha, S; Shulga, E; Shupe, M A; Sicho, P; Sidebo, P E; Sidiropoulou, O; Sidorov, D; Sidoti, A; Siegert, F; Sijacki, Dj; Silva, J; Silver, Y; Silverstein, S B; Simak, V; Simard, O; Simic, Lj; Simion, S; Simioni, E; Simmons, B; Simon, D; Simon, M; Sinervo, P; Sinev, N B; Sioli, M; Siragusa, G; Sisakyan, A N; Sivoklokov, S Yu; Sjölin, J; Sjursen, T B; Skinner, M B; Skottowe, H P; Skubic, P; Slater, M; Slavicek, T; Slawinska, M; Sliwa, K; Smakhtin, V; Smart, B H; Smestad, L; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, M N K; Smith, R W; Smizanska, M; Smolek, K; Snesarev, A A; Snidero, G; Snyder, S; Sobie, R; Socher, F; Soffer, A; Soh, D A; Sokhrannyi, G; Solans, C A; Solar, M; Solc, J; Soldatov, E Yu; Soldevila, U; Solodkov, A A; Soloshenko, A; Solovyanov, O V; Solovyev, V; Sommer, P; Song, H Y; Soni, N; Sood, A; Sopczak, A; Sopko, B; Sopko, V; Sorin, V; Sosa, D; Sosebee, M; Sotiropoulou, C L; Soualah, R; Soukharev, A M; South, D; Sowden, B C; Spagnolo, S; Spalla, M; Spangenberg, M; Spanò, F; Spearman, W R; Sperlich, D; Spettel, F; Spighi, R; Spigo, G; Spiller, L A; Spousta, M; St Denis, R D; Stabile, A; Staerz, S; Stahlman, J; Stamen, R; Stamm, S; Stanecka, E; Stanescu, C; Stanescu-Bellu, M; Stanitzki, M M; Stapnes, S; Starchenko, E A; Stark, J; Staroba, P; Starovoitov, P; Staszewski, R; Steinberg, P; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stewart, G A; Stillings, J A; Stockton, M C; Stoebe, M; Stoicea, G; Stolte, P; Stonjek, S; Stradling, A R; Straessner, A; Stramaglia, M E; Strandberg, J; Strandberg, S; Strandlie, A; Strauss, E; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Stroynowski, R; Strubig, A; Stucci, S A; Stugu, B; Styles, N A; Su, D; Su, J; Subramaniam, R; Succurro, A; Suchek, S; Sugaya, Y; Suk, M; Sulin, V V; Sultansoy, S; Sumida, T; Sun, S; Sun, X; Sundermann, J E; Suruliz, K; Susinno, G; Sutton, M R; Suzuki, S; Svatos, M; Swiatlowski, M; Sykora, I; Sykora, T; Ta, D; Taccini, C; Tackmann, K; Taenzer, J; Taffard, A; Tafirout, R; Taiblum, N; Takai, H; Takashima, R; Takeda, H; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A A; Tam, J Y C; Tan, K G; Tanaka, J; Tanaka, R; Tanaka, S; Tannenwald, B B; Tapia Araya, S; Tapprogge, S; Tarem, S; Tarrade, F; Tartarelli, G F; Tas, P; Tasevsky, M; Tashiro, T; Tassi, E; Tavares Delgado, A; Tayalati, Y; Taylor, A C; Taylor, F E; Taylor, G N; Taylor, P T E; Taylor, W; Teischinger, F A; Teixeira Dias Castanheira, M; Teixeira-Dias, P; Temming, K K; Temple, D; Ten Kate, H; Teng, P K; Teoh, J J; Tepel, F; Terada, S; Terashi, K; Terron, J; Terzo, S; Testa, M; Teuscher, R J; Theveneaux-Pelzer, T; Thomas, J P; Thomas-Wilsker, J; Thompson, E N; Thompson, P D; Thompson, R J; Thompson, A S; Thomsen, L A; Thomson, E; Thomson, M; Thun, R P; Tibbetts, M J; Ticse Torres, R E; Tikhomirov, V O; Tikhonov, Yu A; Timoshenko, S; Tiouchichine, E; Tipton, P; Tisserant, S; Todome, K; Todorov, T; Todorova-Nova, S; Tojo, J; Tokár, S; Tokushuku, K; Tollefson, K; Tolley, E; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Torrence, E; Torres, H; Torró Pastor, E; Toth, J; Touchard, F; Tovey, D R; Trefzger, T; Tremblet, L; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Trischuk, W; Trocmé, B; Troncon, C; Trottier-McDonald, M; Trovatelli, M; Truong, L; Trzebinski, M; Trzupek, A; Tsarouchas, C; Tseng, J C-L; Tsiareshka, P V; Tsionou, D; Tsipolitis, G; Tsirintanis, N; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsui, K M; Tsukerman, I I; Tsulaia, V; Tsuno, S; Tsybychev, D; Tudorache, A; Tudorache, V; Tuna, A N; Tupputi, S A; Turchikhin, S; Turecek, D; Turra, R; Turvey, A J; Tuts, P M; Tykhonov, A; Tylmad, M; Tyndel, M; Ueda, I; Ueno, R; Ughetto, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Unverdorben, C; Urban, J; Urquijo, P; Urrejola, P; Usai, G; Usanova, A; Vacavant, L; Vacek, V; Vachon, B; Valderanis, C; Valencic, N; Valentinetti, S; Valero, A; Valery, L; Valkar, S; Vallecorsa, S; Valls Ferrer, J A; Van Den Wollenberg, W; Van Der Deijl, P C; van der Geer, R; van der Graaf, H; van Eldik, N; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; van Woerden, M C; Vanadia, M; Vandelli, W; Vanguri, R; Vaniachine, A; Vannucci, F; Vardanyan, G; Vari, R; Varnes, E W; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vazeille, F; Vazquez Schroeder, T; Veatch, J; Veloce, L M; Veloso, F; Velz, T; Veneziano, S; Ventura, A; Ventura, D; Venturi, M; Venturi, N; Venturini, A; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, J C; Vest, A; Vetterli, M C; Viazlo, O; Vichou, I; Vickey, T; Vickey Boeriu, O E; Viehhauser, G H A; Viel, S; Vigne, R; Villa, M; Villaplana Perez, M; Vilucchi, E; Vincter, M G; Vinogradov, V B; Vivarelli, I; Vlachos, S; Vladoiu, D; Vlasak, M; Vogel, M; Vokac, P; Volpi, G; Volpi, M; von der Schmitt, H; von Radziewski, H; von Toerne, E; Vorobel, V; Vorobev, K; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Vranjes Milosavljevic, M; Vrba, V; Vreeswijk, M; Vuillermet, R; Vukotic, I; Vykydal, Z; Wagner, P; Wagner, W; Wahlberg, H; Wahrmund, S; Wakabayashi, J; Walder, J; Walker, R; Walkowiak, W; Wang, C; Wang, F; Wang, H; Wang, H; Wang, J; Wang, J; Wang, K; Wang, R; Wang, S M; Wang, T; Wang, T; Wang, X; Wanotayaroj, C; Warburton, A; Ward, C P; Wardrope, D R; Washbrook, A; Wasicki, C; Watkins, P M; Watson, A T; Watson, I J; Watson, M F; Watts, G; Watts, S; Waugh, B M; Webb, S; Weber, M S; Weber, S W; Webster, J S; Weidberg, A R; Weinert, B; Weingarten, J; Weiser, C; Weits, H; Wells, P S; Wenaus, T; Wengler, T; Wenig, S; Wermes, N; Werner, M; Werner, P; Wessels, M; Wetter, J; Whalen, K; Wharton, A M; White, A; White, M J; White, R; White, S; Whiteson, D; Wickens, F J; Wiedenmann, W; Wielers, M; Wienemann, P; Wiglesworth, C; Wiik-Fuchs, L A M; Wildauer, A; Wilkens, H G; Williams, H H; Williams, S; Willis, C; Willocq, S; Wilson, A; Wilson, J A; Wingerter-Seez, I; Winklmeier, F; Winter, B T; Wittgen, M; Wittkowski, J; Wollstadt, S J; Wolter, M W; Wolters, H; Wosiek, B K; Wotschack, J; Woudstra, M J; Wozniak, K W; Wu, M; Wu, M; Wu, S L; Wu, X; Wu, Y; Wyatt, T R; Wynne, B M; Xella, S; Xu, D; Xu, L; Yabsley, B; Yacoob, S; Yakabe, R; Yamada, M; Yamaguchi, D; Yamaguchi, Y; Yamamoto, A; Yamamoto, S; Yamanaka, T; Yamauchi, K; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, Y; Yao, W-M; Yap, Y C; Yasu, Y; Yatsenko, E; Yau Wong, K H; Ye, J; Ye, S; Yeletskikh, I; Yen, A L; Yildirim, E; Yorita, K; Yoshida, R; Yoshihara, K; Young, C; Young, C J S; Youssef, S; Yu, D R; Yu, J; Yu, J M; Yu, J; Yuan, L; Yuen, S P Y; Yurkewicz, A; Yusuff, I; Zabinski, B; Zaidan, R; Zaitsev, A M; Zalieckas, J; Zaman, A; Zambito, S; Zanello, L; Zanzi, D; Zeitnitz, C; Zeman, M; Zemla, A; Zeng, J C; Zeng, Q; Zengel, K; Zenin, O; Ženiš, T; Zerwas, D; Zhang, D; Zhang, F; Zhang, G; Zhang, H; Zhang, J; Zhang, L; Zhang, R; Zhang, X; Zhang, Z; Zhao, X; Zhao, Y; Zhao, Z; Zhemchugov, A; Zhong, J; Zhou, B; Zhou, C; Zhou, L; Zhou, L; Zhou, M; Zhou, N; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhukov, K; Zibell, A; Zieminska, D; Zimine, N I; Zimmermann, C; Zimmermann, S; Zinonos, Z; Zinser, M; Ziolkowski, M; Živković, L; Zobernig, G; Zoccoli, A; Zur Nedden, M; Zurzolo, G; Zwalinski, L

2016-04-29

ATLAS has measured two-particle correlations as a function of the relative azimuthal angle, Δϕ, and pseudorapidity, Δη, in sqrt[s]=13 and 2.76 TeV pp collisions at the LHC using charged particles measured in the pseudorapidity interval |η|<2.5. The correlation functions evaluated in different intervals of measured charged-particle multiplicity show a multiplicity-dependent enhancement at Δϕ∼0 that extends over a wide range of Δη, which has been referred to as the "ridge." Per-trigger-particle yields, Y(Δϕ), are measured over 2<|Δη|<5. For both collision energies, the Y(Δϕ) distribution in all multiplicity intervals is found to be consistent with a linear combination of the per-trigger-particle yields measured in collisions with less than 20 reconstructed tracks, and a constant combinatoric contribution modulated by cos(2Δϕ). The fitted Fourier coefficient, v_{2,2}, exhibits factorization, suggesting that the ridge results from per-event cos(2ϕ) modulation of the single-particle distribution with Fourier coefficients v_{2}. The v_{2} values are presented as a function of multiplicity and transverse momentum. They are found to be approximately constant as a function of multiplicity and to have a p_{T} dependence similar to that measured in p+Pb and Pb+Pb collisions. The v_{2} values in the 13 and 2.76 TeV data are consistent within uncertainties. These results suggest that the ridge in pp collisions arises from the same or similar underlying physics as observed in p+Pb collisions, and that the dynamics responsible for the ridge has no strong sqrt[s] dependence.

Virtual libraries of tetrapyrrole macrocycles. Combinatorics, isomers, product distributions, and data mining.

PubMed

Taniguchi, Masahiko; Du, Hai; Lindsey, Jonathan S

2011-09-26

A software program (PorphyrinViLiGe) has been developed to enumerate the type and relative amounts of substituted tetrapyrrole macrocycles in a virtual library formed by one of four different classes of reactions. The classes include (1) 4-fold reaction of n disubstituted heterocycles (e.g., pyrroles or diiminoisoindolines) to form β-substituted porphyrins, β-substituted tetraazaporphyrins, or α- or β-substituted phthalocyanines; (2) combination of m aminoketones and n diones to form m × n pyrroles, which upon 4-fold reaction give β-substituted porphyrins; (3) derivatization of an 8-point tetrapyrrole scaffold with n reagents, and (4) 4-fold reaction of n aldehydes and pyrrole to form meso-substituted porphyrins. The program accommodates variable ratios of reactants, reversible or irreversible reaction (reaction classes 1 and 2), and degenerate modes of formation. Pólya's theorem (for enumeration of cyclic entities) has also been implemented and provides validation for reaction classes 3 and 4. The output includes the number and identity of distinct reaction-accessible substituent combinations, the number and identity of isomers thereof, and the theoretical mass spectrum. Provisions for data mining enable assessment of the number of products having a chosen pattern of substituents. Examples include derivatization of an octa-substituted phthalocyanine with eight reagents to afford a library of 2,099,728 members (yet only 6435 distinct substituent combinations) and reversible reaction of six distinct disubstituted pyrroles to afford 2649 members (yet only 126 distinct substituent combinations). In general, libraries of substituted tetrapyrrole macrocycles occupy a synthetically accessible region of chemical space that is rich in isomers (>99% or 95% for the two examples, respectively).

Prolonged Grief Disorder: Psychometric Validation of Criteria Proposed for DSM-V and ICD-11

PubMed Central

Prigerson, Holly G.; Horowitz, Mardi J.; Jacobs, Selby C.; Parkes, Colin M.; Aslan, Mihaela; Goodkin, Karl; Raphael, Beverley; Marwit, Samuel J.; Wortman, Camille; Neimeyer, Robert A.; Bonanno, George; Block, Susan D.; Kissane, David; Boelen, Paul; Maercker, Andreas; Litz, Brett T.; Johnson, Jeffrey G.; First, Michael B.; Maciejewski, Paul K.

2009-01-01

Background Bereavement is a universal experience, and its association with excess morbidity and mortality is well established. Nevertheless, grief becomes a serious health concern for a relative few. For such individuals, intense grief persists, is distressing and disabling, and may meet criteria as a distinct mental disorder. At present, grief is not recognized as a mental disorder in the DSM-IV or ICD-10. The goal of this study was to determine the psychometric validity of criteria for prolonged grief disorder (PGD) to enhance the detection and potential treatment of bereaved individuals at heightened risk of persistent distress and dysfunction. Methods and Findings A total of 291 bereaved respondents were interviewed three times, grouped as 0–6, 6–12, and 12–24 mo post-loss. Item response theory (IRT) analyses derived the most informative, unbiased PGD symptoms. Combinatoric analyses identified the most sensitive and specific PGD algorithm that was then tested to evaluate its psychometric validity. Criteria require reactions to a significant loss that involve the experience of yearning (e.g., physical or emotional suffering as a result of the desired, but unfulfilled, reunion with the deceased) and at least five of the following nine symptoms experienced at least daily or to a disabling degree: feeling emotionally numb, stunned, or that life is meaningless; experiencing mistrust; bitterness over the loss; difficulty accepting the loss; identity confusion; avoidance of the reality of the loss; or difficulty moving on with life. Symptoms must be present at sufficiently high levels at least six mo from the death and be associated with functional impairment. Conclusions The criteria set for PGD appear able to identify bereaved persons at heightened risk for enduring distress and dysfunction. The results support the psychometric validity of the criteria for PGD that we propose for inclusion in DSM-V and ICD-11. Please see later in the article for Editors' Summary PMID:19652695

Nucleotide variability at its limit? Insights into the number and evolutionary dynamics of the sex-determining specificities of the honey bee Apis mellifera.

PubMed

Lechner, Sarah; Ferretti, Luca; Schöning, Caspar; Kinuthia, Wanja; Willemsen, David; Hasselmann, Martin

2014-02-01

Deciphering the evolutionary processes driving nucleotide variation in multiallelic genes is limited by the number of genetic systems in which such genes occur. The complementary sex determiner (csd) gene in the honey bee Apis mellifera is an informative example for studying allelic diversity and the underlying evolutionary forces in a well-described model of balancing selection. Acting as the primary signal of sex determination, diploid individuals heterozygous for csd develop into females, whereas csd homozygotes are diploid males that have zero fitness. Examining 77 of the functional heterozygous csd allele pairs, we established a combinatorical criteria that provide insights into the minimum number of amino acid differences among those pairs. Given a data set of 244 csd sequences, we show that the total number of csd alleles found in A. mellifera ranges from 53 (locally) to 87 (worldwide), which is much higher than was previously reported (20). Using a coupon-collector model, we extrapolate the presence of in total 116-145 csd alleles worldwide. The hypervariable region (HVR) is of particular importance in determining csd allele specificity, and we provide for this region evidence of high evolutionary rate for length differences exceeding those of microsatellites. The proportion of amino acids driven by positive selection and the rate of nonsynonymous substitutions in the HVR-flanking regions reach values close to 1 but differ with respect to the HVR length. Using a model of csd coalescence, we identified the high originating rate of csd specificities as a major evolutionary force, leading to an origin of a novel csd allele every 400,000 years. The csd polymorphism frequencies in natural populations indicate an excess of new mutations, whereas signs of ancestral transspecies polymorphism can still be detected. This study provides a comprehensive view of the enormous diversity and the evolutionary forces shaping a multiallelic gene.

Log-gamma directed polymer with fixed endpoints via the replica Bethe Ansatz

NASA Astrophysics Data System (ADS)

Thiery, Thimothée; Le Doussal, Pierre

2014-10-01

We study the model of a discrete directed polymer (DP) on a square lattice with homogeneous inverse gamma distribution of site random Boltzmann weights, introduced by Seppalainen (2012 Ann. Probab. 40 19-73). The integer moments of the partition sum, \\overline{Z^n} , are studied using a transfer matrix formulation, which appears as a generalization of the Lieb-Liniger quantum mechanics of bosons to discrete time and space. In the present case of the inverse gamma distribution the model is integrable in terms of a coordinate Bethe Ansatz, as discovered by Brunet. Using the Brunet-Bethe eigenstates we obtain an exact expression for the integer moments of \\overline{Z^n} for polymers of arbitrary lengths and fixed endpoint positions. Although these moments do not exist for all integer n, we are nevertheless able to construct a generating function which reproduces all existing integer moments and which takes the form of a Fredholm determinant (FD). This suggests an analytic continuation via a Mellin-Barnes transform and we thereby propose a FD ansatz representation for the probability distribution function (PDF) of Z and its Laplace transform. In the limit of a very long DP, this ansatz yields that the distribution of the free energy converges to the Gaussian unitary ensemble (GUE) Tracy-Widom distribution up to a non-trivial average and variance that we calculate. Our asymptotic predictions coincide with a result by Borodin et al (2013 Commun. Math. Phys. 324 215-32) based on a formula obtained by Corwin et al (2011 arXiv:1110.3489) using the geometric Robinson-Schensted-Knuth (gRSK) correspondence. In addition we obtain the dependence on the endpoint position and the exact elastic coefficient at a large time. We argue the equivalence between our formula and that of Borodin et al. As we will discuss, this provides a connection between quantum integrability and tropical combinatorics.

Faster Parameterized Algorithms for Minor Containment

NASA Astrophysics Data System (ADS)

Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.

The theory of Graph Minors by Robertson and Seymour is one of the deepest and significant theories in modern Combinatorics. This theory has also a strong impact on the recent development of Algorithms, and several areas, like Parameterized Complexity, have roots in Graph Minors. Until very recently it was a common belief that Graph Minors Theory is mainly of theoretical importance. However, it appears that many deep results from Robertson and Seymour's theory can be also used in the design of practical algorithms. Minor containment testing is one of algorithmically most important and technical parts of the theory, and minor containment in graphs of bounded branchwidth is a basic ingredient of this algorithm. In order to implement minor containment testing on graphs of bounded branchwidth, Hicks [NETWORKS 04] described an algorithm, that in time O(3^{k^2}\\cdot (h+k-1)!\\cdot m) decides if a graph G with m edges and branchwidth k, contains a fixed graph H on h vertices as a minor. That algorithm follows the ideas introduced by Robertson and Seymour in [J'CTSB 95]. In this work we improve the dependence on k of Hicks' result by showing that checking if H is a minor of G can be done in time O(2^{(2k +1 )\\cdot log k} \\cdot h^{2k} \\cdot 2^{2h^2} \\cdot m). Our approach is based on a combinatorial object called rooted packing, which captures the properties of the potential models of subgraphs of H that we seek in our dynamic programming algorithm. This formulation with rooted packings allows us to speed up the algorithm when G is embedded in a fixed surface, obtaining the first single-exponential algorithm for minor containment testing. Namely, it runs in time 2^{O(k)} \\cdot h^{2k} \\cdot 2^{O(h)} \\cdot n, with n = |V(G)|. Finally, we show that slight modifications of our algorithm permit to solve some related problems within the same time bounds, like induced minor or contraction minor containment.

Nucleotide Variability at Its Limit? Insights into the Number and Evolutionary Dynamics of the Sex-Determining Specificities of the Honey Bee Apis mellifera

PubMed Central

Lechner, Sarah; Ferretti, Luca; Schöning, Caspar; Kinuthia, Wanja; Willemsen, David; Hasselmann, Martin

2014-01-01

Deciphering the evolutionary processes driving nucleotide variation in multiallelic genes is limited by the number of genetic systems in which such genes occur. The complementary sex determiner (csd) gene in the honey bee Apis mellifera is an informative example for studying allelic diversity and the underlying evolutionary forces in a well-described model of balancing selection. Acting as the primary signal of sex determination, diploid individuals heterozygous for csd develop into females, whereas csd homozygotes are diploid males that have zero fitness. Examining 77 of the functional heterozygous csd allele pairs, we established a combinatorical criteria that provide insights into the minimum number of amino acid differences among those pairs. Given a data set of 244 csd sequences, we show that the total number of csd alleles found in A. mellifera ranges from 53 (locally) to 87 (worldwide), which is much higher than was previously reported (20). Using a coupon-collector model, we extrapolate the presence of in total 116–145 csd alleles worldwide. The hypervariable region (HVR) is of particular importance in determining csd allele specificity, and we provide for this region evidence of high evolutionary rate for length differences exceeding those of microsatellites. The proportion of amino acids driven by positive selection and the rate of nonsynonymous substitutions in the HVR-flanking regions reach values close to 1 but differ with respect to the HVR length. Using a model of csd coalescence, we identified the high originating rate of csd specificities as a major evolutionary force, leading to an origin of a novel csd allele every 400,000 years. The csd polymorphism frequencies in natural populations indicate an excess of new mutations, whereas signs of ancestral transspecies polymorphism can still be detected. This study provides a comprehensive view of the enormous diversity and the evolutionary forces shaping a multiallelic gene. PMID:24170493

Maass Forms and Quantum Modular Forms

NASA Astrophysics Data System (ADS)

Rolen, Larry

This thesis describes several new results in the theory of harmonic Maass forms and related objects. Maass forms have recently led to a flood of applications throughout number theory and combinatorics in recent years, especially following their development by the work of Bruinier and Funke the modern understanding Ramanujan's mock theta functions due to Zwegers. The first of three main theorems discussed in this thesis concerns the integrality properties of singular moduli. These are well-known to be algebraic integers, and they play a beautiful role in complex multiplication and explicit class field theory for imaginary quadratic fields. One can also study "singular moduli" for special non-holomorphic functions, which are algebraic but are not necessarily algebraic integers. Here we will explain the phenomenon of integrality properties and provide a sharp bound on denominators of symmetric functions in singular moduli. The second main theme of the thesis concerns Zagier's recent definition of a quantum modular form. Since their definition in 2010 by Zagier, quantum modular forms have been connected to numerous different topics such as strongly unimodal sequences, ranks, cranks, and asymptotics for mock theta functions. Motivated by Zagier's example of the quantum modularity of Kontsevich's "strange" function F(q), we revisit work of Andrews, Jimenez-Urroz, and Ono to construct a natural vector-valued quantum modular form whose components. The final chapter of this thesis is devoted to a study of asymptotics of mock theta functions near roots of unity. In his famous deathbed letter, Ramanujan introduced the notion of a mock theta function, and he offered some alleged examples. The theory of mock theta functions has been brought to fruition using the framework of harmonic Maass forms, thanks to Zwegers. Despite this understanding, little attention has been given to Ramanujan's original definition. Here we prove that Ramanujan's examples do indeed satisfy his original definition.

Logical definability and asymptotic growth in optimization and counting problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Compton, K.

1994-12-31

There has recently been a great deal of interest in the relationship between logical definability and NP-optimization problems. Let MS{sub n} (resp. MP{sub n}) be the class of problems to compute, for given a finite structure A, the maximum number of tuples {bar x} in A satisfying a {Sigma}{sub n} (resp. II{sub n}) formula {psi}({bar x}, {bar S}) as {bar S} ranges over predicates on A. Kolaitis and Thakur showed that the classes MS{sub n} and MP{sub n} collapse to a hierarchy of four levels. Papadimitriou and Yannakakis previously showed that problems in the two lowest levels MS{sub 0} andmore » MS{sub 1} (which they called Max Snp and Max Np) are approximable to within a contrast factor in polynomial time. Similarly, Saluja, Subrahmanyam, and Thakur defined SS{sub n} (resp. SP{sub n}) to be the class of problems to compute, for given a finite structure A, the number of tuples ({bar T}, {bar S}) satisfying a given {Sigma}{sub n} (resp. II{sub n}) formula {psi}({bar T}, {bar c}) in A. They showed that the classes SS{sub n} and SP{sub n} collapse to a hierarchy of five levels and that problems in the two lowest levels SS{sub 0} and SS{sub 1} have a fully polynomial time randomized approximation scheme. We define extended classes MSF{sub n}, MPF{sub n} SSF{sub n}, and SPF{sub n} by allowing formulae to contain predicates definable in a logic known as least fixpoint logic. The resulting hierarchies classes collapse to the same number of levels and problems in the bottom levels can be approximated as before, but now some problems descend from the highest levels in the original hierarchies to the lowest levels in the new hierarchies. We introduce a method characterizing rates of growth of average solution sizes thereby showing a number of important problems do not belong MSF{sub 1} and SSF{sub 1}. This method is related to limit laws for logics and the probabilistic method from combinatorics.« less

Breast cancer prognosis by combinatorial analysis of gene expression data.

PubMed

Alexe, Gabriela; Alexe, Sorin; Axelrod, David E; Bonates, Tibérius O; Lozina, Irina I; Reiss, Michael; Hammer, Peter L

2006-01-01

The potential of applying data analysis tools to microarray data for diagnosis and prognosis is illustrated on the recent breast cancer dataset of van 't Veer and coworkers. We re-examine that dataset using the novel technique of logical analysis of data (LAD), with the double objective of discovering patterns characteristic for cases with good or poor outcome, using them for accurate and justifiable predictions; and deriving novel information about the role of genes, the existence of special classes of cases, and other factors. Data were analyzed using the combinatorics and optimization-based method of LAD, recently shown to provide highly accurate diagnostic and prognostic systems in cardiology, cancer proteomics, hematology, pulmonology, and other disciplines. LAD identified a subset of 17 of the 25,000 genes, capable of fully distinguishing between patients with poor, respectively good prognoses. An extensive list of 'patterns' or 'combinatorial biomarkers' (that is, combinations of genes and limitations on their expression levels) was generated, and 40 patterns were used to create a prognostic system, shown to have 100% and 92.9% weighted accuracy on the training and test sets, respectively. The prognostic system uses fewer genes than other methods, and has similar or better accuracy than those reported in other studies. Out of the 17 genes identified by LAD, three (respectively, five) were shown to play a significant role in determining poor (respectively, good) prognosis. Two new classes of patients (described by similar sets of covering patterns, gene expression ranges, and clinical features) were discovered. As a by-product of the study, it is shown that the training and the test sets of van 't Veer have differing characteristics. The study shows that LAD provides an accurate and fully explanatory prognostic system for breast cancer using genomic data (that is, a system that, in addition to predicting good or poor prognosis, provides an individualized explanation of the reasons for that prognosis for each patient). Moreover, the LAD model provides valuable insights into the roles of individual and combinatorial biomarkers, allows the discovery of new classes of patients, and generates a vast library of biomedical research hypotheses.

Semiotic individuation and Ernst Cassirer's challenge.

PubMed

Hoffmeyer, Jesper

2015-12-01

The concept of individuation has suffered from its being mostly connected with Jungian psychology or nominalist philosophy. In this paper, "individuation" will be understood rather as a process; and in particular, as a series of stages (morphological and/or cognitive) that an organism passes through during its lifespan. In most species, individuation is restricted to a short period in early life, as when birds acquire their species specific songs; while in humans - and a few other species of birds or mammals (although to a much lesser degree) - individuation is a life-long, open-ended process. In this understanding, individuation becomes narrowly connected to learning. And since learning necessarily depends on what is already learned, the trajectory of learning-based individuation is necessarily indefinite and dependent on the concrete chance events and steps whereby the process has proceeded. Semiotic individuation is a historical process, and this fact explains why systems biology, as established by Ludwig van Bertalanffy, has not been capable of meeting the hope, expressed long ago by Ernst Cassirer, of bridging the mechanicist-vitalist gap in biology. Instead, a semiotic approach is called for. Human individuation, moreover, is special in a very important sense: language use implies that humans from earliest childhood inescapably become entangled in an 'as-if-world', a virtual reality, a story about who we are and how our life 'here and now' belongs within our own life-history, as well as within the greater pattern of the world around us. Human individuation is thus a double-tracked process, consisting in an incessant reconciliation or negotiation between the virtual reality that we have constructed in our minds and mind-independent reality as it impresses itself upon our lives. Human life cannot therefore be defined by its uniqueness as a particular genetic combination, but must be instead be defined by its uniqueness as a temporal outcome of semiotic individuation. Accordingly, this double-tracked character of human semiotic individuation implies that it is cast as just one particular outcome of a combinatorics with an infinite number of possible outcomes. It is suggested here that our ingrained feeling of possessing a free will is buried in this fact. Copyright © 2015. Published by Elsevier Ltd.

Software for optimization of SNP and PCR-RFLP genotyping to discriminate many genomes with the fewest assays

PubMed Central

Gardner, Shea N; Wagner, Mark C

2005-01-01

Background Microbial forensics is important in tracking the source of a pathogen, whether the disease is a naturally occurring outbreak or part of a criminal investigation. Results A method and SPR Opt (SNP and PCR-RFLP Optimization) software to perform a comprehensive, whole-genome analysis to forensically discriminate multiple sequences is presented. Tools for the optimization of forensic typing using Single Nucleotide Polymorphism (SNP) and PCR-Restriction Fragment Length Polymorphism (PCR-RFLP) analyses across multiple isolate sequences of a species are described. The PCR-RFLP analysis includes prediction and selection of optimal primers and restriction enzymes to enable maximum isolate discrimination based on sequence information. SPR Opt calculates all SNP or PCR-RFLP variations present in the sequences, groups them into haplotypes according to their co-segregation across those sequences, and performs combinatoric analyses to determine which sets of haplotypes provide maximal discrimination among all the input sequences. Those set combinations requiring that membership in the fewest haplotypes be queried (i.e. the fewest assays be performed) are found. These analyses highlight variable regions based on existing sequence data. These markers may be heterogeneous among unsequenced isolates as well, and thus may be useful for characterizing the relationships among unsequenced as well as sequenced isolates. The predictions are multi-locus. Analyses of mumps and SARS viruses are summarized. Phylogenetic trees created based on SNPs, PCR-RFLPs, and full genomes are compared for SARS virus, illustrating that purported phylogenies based only on SNP or PCR-RFLP variations do not match those based on multiple sequence alignment of the full genomes. Conclusion This is the first software to optimize the selection of forensic markers to maximize information gained from the fewest assays, accepting whole or partial genome sequence data as input. As more sequence data becomes available for multiple strains and isolates of a species, automated, computational approaches such as those described here will be essential to make sense of large amounts of information, and to guide and optimize efforts in the laboratory. The software and source code for SPR Opt is publicly available and free for non-profit use at . PMID:15904493

Positivity, Grassmannian geometry and simplex-like structures of scattering amplitudes

NASA Astrophysics Data System (ADS)

Rao, Junjie

2017-12-01

This article revisits and elaborates the significant role of positive geometry of momentum twistor Grassmannian for planar N=4 SYM scattering amplitudes. First we establish the fundamentals of positive Grassmannian geometry for tree amplitudes, including the ubiquitous Plücker coordinates and the representation of reduced Grassmannian geometry. Then we formulate this subject, without making reference to on-shell diagrams and decorated permutations, around these four major facets: 1. Deriving the tree and 1-loop BCFW recursion relations solely from positivity, after introducing the simple building blocks called positive components for a positive matrix. 2. Applying Grassmannian geometry and Plücker coordinates to determine the signs of N2MHV homological identities, which interconnect various Yangian invariants. It reveals that most of the signs are in fact the secret incarnation of the simple 6-term NMHV identity. 3. Deriving the stacking positivity relation, which is powerful for parameterizing matrix representatives in terms of positive variables in the d log form. It will be used with the reduced Grassmannian geometry representation to produce the positive matrix of a given geometric configuration, which is an independent approach besides the combinatoric way involving a sequence of BCFW bridges. 4. Introducing an elegant and highly refined formalism of BCFW recursion relation for tree amplitudes, which reveals its two-fold simplex-like structures. First, the BCFW contour in terms of (reduced) Grassmannian geometry representatives is delicately dissected into a triangle-shape sum, as only a small fraction of the sum needs to be explicitly identified. Second, this fraction can be further dissected, according to different growing modes with corresponding growing parameters. The growing modes possess the shapes of solid simplices of various dimensions, with which infinite number of BCFW cells can be entirely captured by the characteristic objects called fully-spanning cells. We find that for a given k, beyond n =4 k+1 there is no more new fully-spanning cell, which signifies the essential termination of the recursive growth of BCFW cells. As n increases beyond the termination point, the BCFW contour simply replicates itself according to the simplex-like patterns, which enables us to master all BCFW cells once for all without actually identifying most of them.

Enrichment of Circular Code Motifs in the Genes of the Yeast Saccharomyces cerevisiae.

PubMed

Michel, Christian J; Ngoune, Viviane Nguefack; Poch, Olivier; Ripp, Raymond; Thompson, Julie D

2017-12-03

A set X of 20 trinucleotides has been found to have the highest average occurrence in the reading frame, compared to the two shifted frames, of genes of bacteria, archaea, eukaryotes, plasmids and viruses. This set X has an interesting mathematical property, since X is a maximal C3 self-complementary trinucleotide circular code. Furthermore, any motif obtained from this circular code X has the capacity to retrieve, maintain and synchronize the original (reading) frame. Since 1996, the theory of circular codes in genes has mainly been developed by analysing the properties of the 20 trinucleotides of X, using combinatorics and statistical approaches. For the first time, we test this theory by analysing the X motifs, i.e., motifs from the circular code X, in the complete genome of the yeast Saccharomyces cerevisiae . Several properties of X motifs are identified by basic statistics (at the frequency level), and evaluated by comparison to R motifs, i.e., random motifs generated from 30 different random codes R. We first show that the frequency of X motifs is significantly greater than that of R motifs in the genome of S. cerevisiae . We then verify that no significant difference is observed between the frequencies of X and R motifs in the non-coding regions of S. cerevisiae , but that the occurrence number of X motifs is significantly higher than R motifs in the genes (protein-coding regions). This property is true for all cardinalities of X motifs (from 4 to 20) and for all 16 chromosomes. We further investigate the distribution of X motifs in the three frames of S. cerevisiae genes and show that they occur more frequently in the reading frame, regardless of their cardinality or their length. Finally, the ratio of X genes, i.e., genes with at least one X motif, to non-X genes, in the set of verified genes is significantly different to that observed in the set of putative or dubious genes with no experimental evidence. These results, taken together, represent the first evidence for a significant enrichment of X motifs in the genes of an extant organism. They raise two hypotheses: the X motifs may be evolutionary relics of the primitive codes used for translation, or they may continue to play a functional role in the complex processes of genome decoding and protein synthesis.

ISMB Conference Funding to Support Attendance of Early Researchers and Students

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gaasterland, Terry

ISMB Conference Funding for Students and Young Scientists Historical Description The Intelligent Systems for Molecular Biology (ISMB) conference has provided a general forum for disseminating the latest developments in bioinformatics on an annual basis for the past 22 years. ISMB is a multidisciplinary conference that brings together scientists from computer science, molecular biology, mathematics and statistics. The goal of the ISMB meeting is to bring together biologists and computational scientists in a focus on actual biological problems, i.e., not simply theoretical calculations. The combined focus on “intelligent systems” and actual biological data makes ISMB a unique and highly important meeting.more » 21 years of experience in holding the conference has resulted in a consistently well-organized, well attended, and highly respected annual conference. "Intelligent systems" include any software which goes beyond straightforward, closed-form algorithms or standard database technologies, and encompasses those that view data in a symbolic fashion, learn from examples, consolidate multiple levels of abstraction, or synthesize results to be cognitively tractable to a human, including the development and application of advanced computational methods for biological problems. Relevant computational techniques include, but are not limited to: machine learning, pattern recognition, knowledge representation, databases, combinatorics, stochastic modeling, string and graph algorithms, linguistic methods, robotics, constraint satisfaction, and parallel computation. Biological areas of interest include molecular structure, genomics, molecular sequence analysis, evolution and phylogenetics, molecular interactions, metabolic pathways, regulatory networks, developmental control, and molecular biology generally. Emphasis is placed on the validation of methods using real data sets, on practical applications in the biological sciences, and on development of novel computational techniques. The ISMB conferences are distinguished from many other conferences in computational biology or artificial intelligence by an insistence that the researchers work with real molecular biology data, not theoretical or toy examples; and from many other biological conferences by providing a forum for technical advances as they occur, which otherwise may be shunned until a firm experimental result is published. The resulting intellectual richness and cross-disciplinary diversity provides an important opportunity for both students and senior researchers. ISMB has become the premier conference series in this field with refereed, published proceedings, establishing an infrastructure to promote the growing body of research.« less

Time-reversal-based SU(2) x Sn scalar invariants as (Lie Algebraic) group measures: a structured overview of generalised democratic-recoupled, uniform non-Abelian [AX]n NMR spin systems, as abstract [Formula: see text] chain networks.

PubMed

Temme, F P

2004-03-01

The physics of dual group scalar invariants (SIs) as (Lie algebraic) group measures (L-GMs) and its significance to non-Abelian NMR spin systems motivates this overview of uniform general-2n [AX](2n) spin evolution, which represents an extensive addendum to Corio's earlier (essentially restricted) view of Abelian spin system SU(2)-based SI-cardinalities. The [Formula: see text] values in [J. Magn. Reson., 134 (1998) 131] arise from strictly linear recoupled time-reversal invariance (TRI) models. In contrast, here we discuss the physical significance of an alternative polyhedral combinatorics approach to democratic recoupling (DR), a property inherent in both the TRI and statistical sampling. Recognition of spin ensemble SIs as being L-GMs over isomorphic algebras is invaluable in many DR-based NMR problems. Various [AX]n model spin systems, including the [AX]3 bis odd-odd parity spin system, are examined as direct applications of these L-GM- and combinatorial-based SI ideas. Hence in place of /SI/=15 (implied by Corio's [Formula: see text] approach), the bis 3-fold spin system cardinality is seen now as constrained to a single invariant on an isomorphic product algebra under L-GMs, in accord with the subspectral analysis of Jones et al. [Canad. J. Chem., 43 (1965) 683]. The group projective ideas cited here for DR (as cf. to graph theoretic views) apply to highly degenerate non-Abelian problems. Over dual tensorial bases, they define models of spin dynamical evolution whose (SR) quasiparticle superboson carrier (sub)spaces are characterised by SIs acting as explicit auxiliary labels [Physica, A198 (1993) 245; J. Math. Chem., 31 (2002) 281]. A deeper [Formula: see text] network-based view of spin-alone space developed in Balasubramanian's work [J. Chem. Phys., 78 (1983) 6358] is especially important, (e.g.) in the study of spin waves [J. Math. Chem., 31 (2002) 363]. Beyond the specific NMR SIs derived here, there are DR applications where a sporadic, still higher, 2n-fold regular uniform spin ensemble exhibits a topological FG duality to some known modest /SI/(2i<2n) cardinality--in principle providing for the (sparce) existence of other /SI/(2n) DR-based values.

Comprehensive discovery of subsample gene expression components by information explanation: therapeutic implications in cancer.

PubMed

Pepke, Shirley; Ver Steeg, Greg

2017-03-15

De novo inference of clinically relevant gene function relationships from tumor RNA-seq remains a challenging task. Current methods typically either partition patient samples into a few subtypes or rely upon analysis of pairwise gene correlations that will miss some groups in noisy data. Leveraging higher dimensional information can be expected to increase the power to discern targetable pathways, but this is commonly thought to be an intractable computational problem. In this work we adapt a recently developed machine learning algorithm for sensitive detection of complex gene relationships. The algorithm, CorEx, efficiently optimizes over multivariate mutual information and can be iteratively applied to generate a hierarchy of relatively independent latent factors. The learned latent factors are used to stratify patients for survival analysis with respect to both single factors and combinations. These analyses are performed and interpreted in the context of biological function annotations and protein network interactions that might be utilized to match patients to multiple therapies. Analysis of ovarian tumor RNA-seq samples demonstrates the algorithm's power to infer well over one hundred biologically interpretable gene cohorts, several times more than standard methods such as hierarchical clustering and k-means. The CorEx factor hierarchy is also informative, with related but distinct gene clusters grouped by upper nodes. Some latent factors correlate with patient survival, including one for a pathway connected with the epithelial-mesenchymal transition in breast cancer that is regulated by a microRNA that modulates epigenetics. Further, combinations of factors lead to a synergistic survival advantage in some cases. In contrast to studies that attempt to partition patients into a small number of subtypes (typically 4 or fewer) for treatment purposes, our approach utilizes subgroup information for combinatoric transcriptional phenotyping. Considering only the 66 gene expression groups that are found to both have significant Gene Ontology enrichment and are small enough to indicate specific drug targets implies a computational phenotype for ovarian cancer that allows for 3 66 possible patient profiles, enabling truly personalized treatment. The findings here demonstrate a new technique that sheds light on the complexity of gene expression dependencies in tumors and could eventually enable the use of patient RNA-seq profiles for selection of personalized and effective cancer treatments.

n-Nucleotide circular codes in graph theory.

PubMed

Fimmel, Elena; Michel, Christian J; Strüngmann, Lutz

2016-03-13

The circular code theory proposes that genes are constituted of two trinucleotide codes: the classical genetic code with 61 trinucleotides for coding the 20 amino acids (except the three stop codons {TAA,TAG,TGA}) and a circular code based on 20 trinucleotides for retrieving, maintaining and synchronizing the reading frame. It relies on two main results: the identification of a maximal C(3) self-complementary trinucleotide circular code X in genes of bacteria, eukaryotes, plasmids and viruses (Michel 2015 J. Theor. Biol. 380, 156-177. (doi:10.1016/j.jtbi.2015.04.009); Arquès & Michel 1996 J. Theor. Biol. 182, 45-58. (doi:10.1006/jtbi.1996.0142)) and the finding of X circular code motifs in tRNAs and rRNAs, in particular in the ribosome decoding centre (Michel 2012 Comput. Biol. Chem. 37, 24-37. (doi:10.1016/j.compbiolchem.2011.10.002); El Soufi & Michel 2014 Comput. Biol. Chem. 52, 9-17. (doi:10.1016/j.compbiolchem.2014.08.001)). The univerally conserved nucleotides A1492 and A1493 and the conserved nucleotide G530 are included in X circular code motifs. Recently, dinucleotide circular codes were also investigated (Michel & Pirillo 2013 ISRN Biomath. 2013, 538631. (doi:10.1155/2013/538631); Fimmel et al. 2015 J. Theor. Biol. 386, 159-165. (doi:10.1016/j.jtbi.2015.08.034)). As the genetic motifs of different lengths are ubiquitous in genes and genomes, we introduce a new approach based on graph theory to study in full generality n-nucleotide circular codes X, i.e. of length 2 (dinucleotide), 3 (trinucleotide), 4 (tetranucleotide), etc. Indeed, we prove that an n-nucleotide code X is circular if and only if the corresponding graph [Formula: see text] is acyclic. Moreover, the maximal length of a path in [Formula: see text] corresponds to the window of nucleotides in a sequence for detecting the correct reading frame. Finally, the graph theory of tournaments is applied to the study of dinucleotide circular codes. It has full equivalence between the combinatorics theory (Michel & Pirillo 2013 ISRN Biomath. 2013, 538631. (doi:10.1155/2013/538631)) and the group theory (Fimmel et al. 2015 J. Theor. Biol. 386, 159-165. (doi:10.1016/j.jtbi.2015.08.034)) of dinucleotide circular codes while its mathematical approach is simpler. © 2016 The Author(s).

TRIBUTE: Brian G Wybourne: Innovator

NASA Astrophysics Data System (ADS)

Louck, James D.

2006-03-01

This volume encloses the Proceedings of the Eighth Summer School on Theoretical Physics under the banner title Symmetry and Structural Properties of Condensed Matter (SSPCM 2005). The School, organised by Rzeszów University of Technology, Poland, together with Laboratory of Physical Foundation of Information Processing, Poland (LFPPI), was held between 31 August and 7 September 2005 in Myczkowce. The main goal of the whole series of biannual SSPCM schools (since 1990) is promotion of advanced mathematical methods within condensed matter physics, directed towards its symmetry and structural properties. This SSPCM 05 School focused on the following three main subjects: decoherence and quantum computers; the role of combinatorics in classification of solutions for exactly solvable models; geometric aspects in nanophysics. The Proceedings are divided into three parts accordingly, but particular topics can overlap between main subjects, and be related to problems pursued in previous SSPCM schools. In this way, the present school is concentrated on various aspects of theory and technology of quantum informatics, with the inclusion of exactly solvable models of statistical physics of condensed matter in low dimensions, as some natural theoretical prototypes of a quantum computer. The last SSPCM 05 was devoted to the memory of Professor Brian G Wybourne, a great Inspirer, inestimable Patron and Lecturer of the whole series of these schools. The School gathered together more than 50 participants, both advanced researchers in physics and mathematics, as well as their young collaborators and students, representing altogether 10 countries from all over the world. The Organising Committee would like to express their gratitude to all members of the International Advisory Committee for their opinions and support and to all invited lecturers and contributors for their talks and preparation of their manuscripts. Special thanks are addressed to all participants and everyone who attended for creating such a stimulating and friendly atmosphere during our meeting, and for several valuable discussions. We thank all chairmen for their polite but efficient leading of sessions. Many thanks are due to the referees who improved significantly the quality of papers presented in this volume. The organisers address special thanks to The Nicholas C. Metropolis Mathematics Foundation (USA) for a substantial initiating support, and to the Polish State Committee for Scientific Research. The hospitality of the whole team of the hotel 'Energetyk' Myczkowce is also appreciated.

Logical analysis of diffuse large B-cell lymphomas.

PubMed

Alexe, G; Alexe, S; Axelrod, D E; Hammer, P L; Weissmann, D

2005-07-01

The goal of this study is to re-examine the oligonucleotide microarray dataset of Shipp et al., which contains the intensity levels of 6817 genes of 58 patients with diffuse large B-cell lymphoma (DLBCL) and 19 with follicular lymphoma (FL), by means of the combinatorics, optimisation, and logic-based methodology of logical analysis of data (LAD). The motivations for this new analysis included the previously demonstrated capabilities of LAD and its expected potential (1) to identify different informative genes than those discovered by conventional statistical methods, (2) to identify combinations of gene expression levels capable of characterizing different types of lymphoma, and (3) to assemble collections of such combinations that if considered jointly are capable of accurately distinguishing different types of lymphoma. The central concept of LAD is a pattern or combinatorial biomarker, a concept that resembles a rule as used in decision tree methods. LAD is able to exhaustively generate the collection of all those patterns which satisfy certain quality constraints, through a systematic combinatorial process guided by clear optimization criteria. Then, based on a set covering approach, LAD aggregates the collection of patterns into classification models. In addition, LAD is able to use the information provided by large collections of patterns in order to extract subsets of variables, which collectively are able to distinguish between different types of disease. For the differential diagnosis of DLBCL versus FL, a model based on eight significant genes is constructed and shown to have a sensitivity of 94.7% and a specificity of 100% on the test set. For the prognosis of good versus poor outcome among the DLBCL patients, a model is constructed on another set consisting also of eight significant genes, and shown to have a sensitivity of 87.5% and a specificity of 90% on the test set. The genes selected by LAD also work well as a basis for other kinds of statistical analysis, indicating their robustness. These two models exhibit accuracies that compare favorably to those in the original study. In addition, the current study also provides a ranking by importance of the genes in the selected significant subsets as well as a library of dozens of combinatorial biomarkers (i.e. pairs or triplets of genes) that can serve as a source of mathematically generated, statistically significant research hypotheses in need of biological explanation.

On the combinatorics of sparsification.

PubMed

Huang, Fenix Wd; Reidys, Christian M

2012-10-22

We study the sparsification of dynamic programming based on folding algorithms of RNA structures. Sparsification is a method that improves significantly the computation of minimum free energy (mfe) RNA structures. We provide a quantitative analysis of the sparsification of a particular decomposition rule, Λ∗. This rule splits an interval of RNA secondary and pseudoknot structures of fixed topological genus. Key for quantifying sparsifications is the size of the so called candidate sets. Here we assume mfe-structures to be specifically distributed (see Assumption 1) within arbitrary and irreducible RNA secondary and pseudoknot structures of fixed topological genus. We then present a combinatorial framework which allows by means of probabilities of irreducible sub-structures to obtain the expectation of the Λ∗-candidate set w.r.t. a uniformly random input sequence. We compute these expectations for arc-based energy models via energy-filtered generating functions (GF) in case of RNA secondary structures as well as RNA pseudoknot structures. Furthermore, for RNA secondary structures we also analyze a simplified loop-based energy model. Our combinatorial analysis is then compared to the expected number of Λ∗-candidates obtained from the folding mfe-structures. In case of the mfe-folding of RNA secondary structures with a simplified loop-based energy model our results imply that sparsification provides a significant, constant improvement of 91% (theory) to be compared to an 96% (experimental, simplified arc-based model) reduction. However, we do not observe a linear factor improvement. Finally, in case of the "full" loop-energy model we can report a reduction of 98% (experiment). Sparsification was initially attributed a linear factor improvement. This conclusion was based on the so called polymer-zeta property, which stems from interpreting polymer chains as self-avoiding walks. Subsequent findings however reveal that the O(n) improvement is not correct. The combinatorial analysis presented here shows that, assuming a specific distribution (see Assumption 1), of mfe-structures within irreducible and arbitrary structures, the expected number of Λ∗-candidates is Θ(n2). However, the constant reduction is quite significant, being in the range of 96%. We furthermore show an analogous result for the sparsification of the Λ∗-decomposition rule for RNA pseudoknotted structures of genus one. Finally we observe that the effect of sparsification is sensitive to the employed energy model.

Time-reversal-based SU(2)× Sn scalar invariants as (Lie Algebraic) group measures: a structured overview of generalised democratic-recoupled, uniform non-Abelian [ AX] n NMR spin systems, as abstract Sn⊃ Sn-1../U n⊃U n-1.. chain networks

NASA Astrophysics Data System (ADS)

Temme, F. P.

2004-03-01

The physics of dual group scalar invariants (SIs) as (Lie algebraic) group measures (L-GMs) and its significance to non-Abelian NMR spin systems motivates this overview of uniform general-2 n [ AX] 2 n spin evolution, which represents an extensive addendum to Corio's earlier (essentially restricted) view of Abelian spin system SU(2)-based SI-cardinalities. The |D 0( U)|((⊗SU(2)) (2n))|SI| values in [J. Magn. Reson., 134 (1998) 131] arise from strictly linear recoupled time-reversal invariance (TRI) models. In contrast, here we discuss the physical significance of an alternative polyhedral combinatorics approach to democratic recoupling (DR), a property inherent in both the TRI and statistical sampling. Recognition of spin ensemble SIs as being L-GMs over isomorphic algebras is invaluable in many DR-based NMR problems. Various [ AX] n model spin systems, including the [ AX] 3bis odd-odd parity spin system, are examined as direct applications of these L-GM- and combinatorial-based SI ideas. Hence in place of | SI|=15 (implied by Corio's | D0|((⊗ SU(2)) 2 n) approach), the bis 3-fold spin system cardinality is seen now as constrained to a single invariant on an isomorphic product algebra under L-GMs, in accord with the subspectral analysis of Jones et al. [Canad. J. Chem., 43 (1965) 683]. The group projective ideas cited here for DR (as cf. to graph theoretic views) apply to highly degenerate non-Abelian problems. Over dual tensorial bases, they define models of spin dynamical evolution whose (SR) quasiparticle superboson carrier (sub)spaces are characterised by SIs acting as explicit auxiliary labels [Physica, A198 (1993) 245; J. Math. Chem., 31 (2002) 281]. A deeper S2n network-based view of spin-alone space developed in Balasubramanian's work [J. Chem. Phys., 78 (1983) 6358] is especially important, (e.g.) in the study of spin waves [J. Math. Chem., 31 (2002) 363]. Beyond the specific NMR SIs derived here, there are DR applications where a sporadic, still higher, 2 n-fold regular uniform spin ensemble exhibits a topological FG duality to some known modest | SI| (2 i<2 n) cardinality—in principle providing for the (sparce) existence of other | SI| (2 n) DR-based values.

Single cell and single molecule techniques for the analysis of the epigenome

NASA Astrophysics Data System (ADS)

Wallin, Christopher Benjamin

Epigenetic regulation is a critical biological process for the health and development of a cell. Epigenetic regulation is facilitated by covalent modifications to the underlying DNA and chromatin proteins. A fundamental understanding of these epigenetic modifications and their associated interactions at the molecular scale is necessary to explain phenomena including cellular identity, stem cell plasticity, and neoplastic transformation. It is widely known that abnormal epigenetic profiles have been linked to many diseases, most notably cancer. While the field of epigenetics has progressed rapidly with conventional techniques, significant advances remain to be made with respect to combinatoric analysis of epigenetic marks and single cell epigenetics. Therefore, in this dissertation, I will discuss our development of devices and methodologies to address these pertinent issues. First, we designed a preparatory polydimethylsiloxane (PDMS) microdevice for the extraction, purification, and stretching of human chromosomal DNA and chromatin from small cell populations down to a single cell. The valveless device captures cells by size exclusion within the micropillars, entraps the DNA or chromatin in the micropillars after cell lysis, purifies away the cellular debris, and fluorescently labels the DNA and/or chromatin all within a single reaction chamber. With the device, we achieve nearly 100% extraction efficiency of the DNA. The device is also used for in-channel immunostaining of chromatin followed by downstream single molecule chromatin analysis in nanochannels (SCAN). Second, using multi-color, time-correlated single molecule measurements in nanochannels, simultaneous coincidence detection of 2 epigenetic marks is demonstrated. Coincidence detection of 3 epigenetic marks is also established using a pulsed interleaved excitation scheme. With these two promising results, genome-wide quantification of epigenetic marks was pursued. Unfortunately, quantitative SCAN never materialized. Reasons for this, including poor signal to background, are explained in detail. Third, development of mobility-SCAN, an analytical technique for measuring and analyzing single molecules based on their fluorescent signature and their electrophoretic mobility in nanochannels is described. We use the technique to differentiate biomolecules from complex mixtures and derive parameters such as diffusion coefficients and effective charges. Finally, the device is used to detect binding interactions of various complexes similar to affinity capillary electrophoresis, but on a single molecule level. Fourth, we conclude by briefly discussing SCAN-sort, a technique to sort individual chromatin molecules based on their fluorescent emissions for further downstream analysis such as DNA sequencing. We demonstrate a 2-fold enrichment of chromatin from sorting and discuss possible system modifications for better performance in the future.

Hierarchical functional organization of formal biological systems: a dynamical approach. II. The concept of non-symmetry leads to a criterion of evolution deduced from an optimum principle of the (O-FBS) sub-system.

PubMed

Chauvet, G A

1993-03-29

In paper I a theory of functional organization in terms of functional interactions was proposed for a formal biological system (FBS). A functional interaction was defined as the product emitted by a structural unit, i.e. an assembly of molecules, cells, tissues or organs, which acts on another. We have shown that a self-association hypothesis could be an explanation for the source of these functional interactions because it is consistent with increased stability of the system after association. The construction of the set of interactions provides the topology of the biological system, called (O-FBS), in contrast to the (D-FBS) which describes the dynamics of the processes associated with the functional interactions. In this paper, an optimum principle is established, due to the non-symmetry of functional interactions, which could explain the stability of an FBS, and a criterion of evolution for the hierarchical topological organization of a FBS during development is deduced from that principle. The combinatorics of the (O-FBS) leads to the topological stability of the related graph. It is shown that this problem can be expressed as the re-distribution of sources and sinks, when one of them is suppressed, given the constraint of the invariance of the physiological function. Such an optimum principle could be called a 'principle of increase in functional order by hierarchy'. The first step is the formulation of a 'potential' for the functional organization, which describes the ability of the system to combine functional interactions, such that the principle of vital coherence (paper I) is satisfied. This function measures the number of potential functional interactions. The second step is to discover the maximum of this function. Biological systems in such a state of maximum organization are shown to satisfy particular dynamics, which can be experimentally verified: either the number of sinks decreases, or this number increases, in a monotonic way. The class of systems considered here is assumed to satisfy such an extremum hypothesis. The third step is a study of the variation of the degree of organization (paper I), i.e. the number of structural units when the biological system is growing. We establish an optimum principle for a new function called 'orgatropy'. By adding a criterion of specialization to the system we show the emergence of a level of organization with a re-organization of the system.(ABSTRACT TRUNCATED AT 400 WORDS)

An explicitly spin-free compact open-shell coupled cluster theory using a multireference combinatoric exponential ansatz: formal development and pilot applications.

PubMed

Datta, Dipayan; Mukherjee, Debashis

2009-07-28

In this paper, we present a comprehensive account of an explicitly spin-free compact state-universal multireference coupled cluster (CC) formalism for computing the state energies of simple open-shell systems, e.g., doublets and biradicals, where the target open-shell states can be described by a few configuration state functions spanning a model space. The cluster operators in this formalism are defined in terms of the spin-free unitary generators with respect to the common closed-shell component of all model functions (core) as vacuum. The spin-free cluster operators are either closed-shell-like n hole-n particle excitations (denoted by T(mu)) or involve excitations from the doubly occupied (nonvalence) orbitals to the singly occupied (valence) orbitals (denoted by S(e)(mu)). In addition, there are cluster operators with exchange spectator scatterings involving the valence orbitals (denoted by S(re)(mu)). We propose a new multireference cluster expansion ansatz for the wave operator with the above generally noncommuting cluster operators which essentially has the same physical content as the Jeziorski-Monkhorst ansatz with the commuting cluster operators defined in the spin-orbital basis. The T(mu) operators in our ansatz are taken to commute with all other operators, while the S(e)(mu) and S(re)(mu) operators are allowed to contract among themselves through the spectator valence orbitals. An important innovation of this ansatz is the choice of an appropriate automorphic factor accompanying each contracted composite of cluster operators in order to ensure that each distinct excitation generated by this composite appears only once in the wave operator. The resulting CC equations consist of two types of terms: a "direct" term and a "normalization" term containing the effective Hamiltonian operator. It is emphasized that the direct term is almost quartic in the cluster amplitudes, barring only a handful of terms and termination of the normalization term depends on the valence rank of the effective Hamiltonian operator and the excitation rank of the cluster operators at which the theory is truncated. Illustrative applications are presented by computing the state energies of neutral doublet radicals and doublet molecular cations and ionization energies of neutral molecules and comparing our results with the other open-shell CC theories, benchmark full CI results (when available) in the same basis, and the experimental results. Highly encouraging results show the efficacy of the method.

Higher-order Fourier analysis over finite fields and applications

NASA Astrophysics Data System (ADS)

Hatami, Pooya

Higher-order Fourier analysis is a powerful tool in the study of problems in additive and extremal combinatorics, for instance the study of arithmetic progressions in primes, where the traditional Fourier analysis comes short. In recent years, higher-order Fourier analysis has found multiple applications in computer science in fields such as property testing and coding theory. In this thesis, we develop new tools within this theory with several new applications such as a characterization theorem in algebraic property testing. One of our main contributions is a strong near-equidistribution result for regular collections of polynomials. The densities of small linear structures in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by approximating the indicator function of a subset by a function of bounded number of polynomials. Then, to approximate the average, it suffices to know the joint distribution of the polynomials applied to the linear forms. We prove a near-equidistribution theorem that describes these distributions for the group F(n/p) when p is a fixed prime. This fundamental fact was previously known only under various extra assumptions about the linear forms or the field size. We use this near-equidistribution theorem to settle a conjecture of Gowers and Wolf on the true complexity of systems of linear forms. Our next application is towards a characterization of testable algebraic properties. We prove that every locally characterized affine-invariant property of functions f : F(n/p) → R with n∈ N, is testable. In fact, we prove that any such property P is proximity-obliviously testable. More generally, we show that any affine-invariant property that is closed under subspace restrictions and has "bounded complexity" is testable. We also prove that any property that can be described as the property of decomposing into a known structure of low-degree polynomials is locally characterized and is, hence, testable. We discuss several notions of regularity which allow us to deduce algorithmic versions of various regularity lemmas for polynomials by Green and Tao and by Kaufman and Lovett. We show that our algorithmic regularity lemmas for polynomials imply algorithmic versions of several results relying on regularity, such as decoding Reed-Muller codes beyond the list decoding radius (for certain structured errors), and prescribed polynomial decompositions. Finally, motivated by the definition of Gowers norms, we investigate norms defined by different systems of linear forms. We give necessary conditions on the structure of systems of linear forms that define norms. We prove that such norms can be one of only two types, and assuming that |F p| is sufficiently large, they essentially are equivalent to either a Gowers norm or Lp norms.

PREFACE: 10th Summer School on Theoretical Physics 'Symmetry and Structural Properties of Condensed Matter'

NASA Astrophysics Data System (ADS)

Lulek, Tadeusz; Wal, Andrzej; Lulek, Barbara

2010-03-01

This volume contains the Proceedings of the Tenth Summer School on Theoretical Physics under the banner title 'Symmetry and Structural Properties of Condensed Matter' (SSPCM 2009). The School was organized by Rzeszow University of Technology, Poland, in cooperation with AGH University of Science and Technology, Cracow, Poland, and took place on 2-9 September 2009 in Myczkowce, Poland. With this meeting we have reached the round number ten of the series of biannual SSPCM schools, which started in 1990 and were focused on some advanced mathematical methods of condensed matter physics. The first five meetings were held in Zajaczkowo near Poznan, under the auspices of The Institute of Physics of Adam Mickiewicz University, and the last five in Myczkowce near Rzeszów, in the south-eastern part of Poland. Within these two decades several young workers who started at kindergarten lectures at SSPCM, have now reached their PhD degrees, professorships and authority. Proceedings of the first seven SSPCM meetings were published as separate volumes by World Scientific, and the last two as volumes 30 and 104 of Journal of Physics: Conference Series. The present meeting is also the third of the last schools which put the emphasis on quantum informatics. The main topics of our jubilee SSPCM'09 are the following: Information processing, entanglement, and tensor calculus, Integrable models and unitary symmetry, Finite systems and nanophysics. The Proceedings are divided into three parts accordingly. The school gathered together 55 participants from seven countries and several scientific centers in Poland, accommodating again advanced research with young collaborators and students. Acknowledgements The Organizing Committee would like to express its gratitude to all participants for their many activities during the School and for creating a friendly and inspiring atmosphere within our SSPCM society. Special thanks are due to all lecturers for preparing and presenting their talks and also for several valuable discussion. We would like to express our thanks to all those who prepared manuscripts, to all referees who spent their time to significantly improve our elaborations, and thus the quality of this volume, to all members of our International Advisory Committee and to chairmen for their polite and efficient leading of sessions. It is our pleasure to express special gratitude to The Nicolas C Metropolis Mathematics Foundation (Los Alamos, USA) for substantial financial support of our three last SSPCM schools. Indeed, it provided an essential basis for performing these meetings. We direct this gratitude to Professor James D Louck, the President of this Foundation. Also, we were happy to hear from Professor Louck that this series of schools has had an important influence on his activities on application of unitary groups in physics. It has resulted in a new monograph: James D Louck, 'Unitary Symmetry and Combinatorics', World Scientific, New Jersey 2008, which was presented at our jubilee meeting. Tadeusz Lulek, Andrzej Wal and Barbara Lulek

PREFACE: Symmetries and Integrability of Difference Equations

NASA Astrophysics Data System (ADS)

Doliwa, Adam; Korhonen, Risto; Lafortune, Stéphane

2007-10-01

The notion of integrability was first introduced in the 19th century in the context of classical mechanics with the definition of Liouville integrability for Hamiltonian flows. Since then, several notions of integrability have been introduced for partial and ordinary differential equations. Closely related to integrability theory is the symmetry analysis of nonlinear evolution equations. Symmetry analysis takes advantage of the Lie group structure of a given equation to study its properties. Together, integrability theory and symmetry analysis provide the main method by which nonlinear evolution equations can be solved explicitly. Difference equations (DE), like differential equations, are important in numerous fields of science and have a wide variety of applications in such areas as mathematical physics, computer visualization, numerical analysis, mathematical biology, economics, combinatorics, and quantum field theory. It is thus crucial to develop tools to study and solve DEs. While the theory of symmetry and integrability for differential equations is now largely well-established, this is not yet the case for discrete equations. Although over recent years there has been significant progress in the development of a complete analytic theory of difference equations, further tools are still needed to fully understand, for instance, the symmetries, asymptotics and the singularity structure of difference equations. The series of SIDE meetings on Symmetries and Integrability of Difference Equations started in 1994. Its goal is to provide a platform for an international and interdisciplinary communication for researchers working in areas associated with integrable discrete systems, such as classical and quantum physics, computer science and numerical analysis, mathematical biology and economics, discrete geometry and combinatorics, theory of special functions, etc. The previous SIDE meetings took place in Estérel near Montréal, Canada (1994), at the University of Kent in Canterbury, UK (1996), in Sabaudia near Rome, Italy (1998), at the University of Tokyo, Japan (2000), in Giens, France (2002), and in Helsinki, Finland (2004). The SIDE VII meeting was held at the University of Melbourne from 10-14 July 2006. The scientific committee consisted of Nalini Joshi (The University of Sydney), Frank W Nijhoff (University of Leeds), Reinout Quispel (La Trobe University) and Colin Rogers (University of New South Wales). The local organization was in the hands of John A G Roberts and Wolfgang K Schief. Proceedings of all the previous SIDE meetings have been published; the 1994 and 1988 meetings (edited respectively by D Levi, L Vinet and P Winternitz, and by D Levi and O Ragnisco) as volumes of the CRM Proceedings and Lecture Notes (AMS Publications), the 1996 meeting (edited by P Clarkson and F W Nijhoff) as Volume 255 in the LMS Lecture Note Series. Starting from the 1996 meeting the formula of publication has been changed to include rather selected refereed contributions submitted in response to a call for papers issued after the meetings and not restricted to their participants. Thus publications reflecting the scope of the 1996 meeting (edited by J Hietarinta, F W Nijhoff and J Satsuma) appeared in Journal of Physics A: Mathematical and General 34 48 (special issue), and of the 1998 and 2000 meetings (edited respectively by F W Nijhoff, Yu B Suris and C-M Viallet, and by J F van Diejen and R Halburd) in Journal of Nonlinear Mathematical Physics 10 (Suppl. 2) and 12 (Suppl. 2). The aim of this special issue is to benefit from the occasion offered by the SIDE VII meeting, producing an issue containing papers which represent the state-of-the-art knowledge for studying integrability and symmetry properties of difference equations. This special issue features high quality research papers and invited reviews which deal with themes that were covered by the SIDE VII conference. These are in alphabetical order: Algebraic-geometric approaches to integrability. The first section contains a paper by T Hamamoto and K Kajiwara on hypergeometric solutions to the q-Painlevé equation of type A4(1). Discrete geometry. In this category there are three papers. J Cielinski offers a geometric definition and a spectral approach on pseudospherical surfaces on time scales, while A Doliwa considers generalized isothermic lattices. The paper by U Pinkall, B Springborn and S Weiss mann is concerned with a new doubly discrete analogue of smoke ring flow and the real time simulation of fluid flow. Integrable systems in statistical physics. Under this heading there is a paper by R J Baxter on corner transfer matrices in statistical mechanics, and a paper by S Boukraa, S Hassani, J-M Maillard, B M McCoy, J-A Weil and N Zenine where the authors consider Fuchs-Painlevé elliptic representation of the Painlevé VI equation. KP lattices and differential-difference hierarchies. In this section we have seven articles. C R Gilson, J J C Nimmo and Y Ohta consider quasideterminant solutions of a non-Abelian Hirota-Miwa equation, while B Grammaticos, A Ramani, V Papageorgiou, J Satsuma and R Willox discuss the construction of lump-like solutions of the Hirota-Miwa equation. J Hietarinta and C Viallet analyze the factorization process for lattice maps searching for integrable cases, the paper by X-B Hu and G-F Yu is concerned with integrable discretizations of the (2+1)-dimensional sinh-Gordon equation, and K Kajiwara, M Mazzocco and Y Ohta consider the Hankel determinant formula of the tau-functions of the Toda equation. Finally, V G Papageorgiou and A G Tongas study Yang-Baxter maps and multi-field integrable lattice equations, and H-Y Wang, X-B Hu and H-W Tam consider the two-dimensional Leznov lattice equation with self-consistent sources. Quantum integrable systems. This category contains a paper on q-extended eigenvectors of the integral and finite Fourier transforms by N M Atakishiyev, J P Rueda and K B Wolf, and an article by S M Sergeev on quantization of three-wave equations. Random matrix theory. This section contains a paper by A V Kitaev on the boundary conditions for scaled random matrix ensembles in the bulk of the spectrum. Symmetries and conservation laws. In this section we have five articles. H Gegen, X-B Hu, D Levi and S Tsujimoto consider a difference-analogue of Davey-Stewartson system giving its discrete Gram-type determinant solution and Lax pair. The paper by D Levi, M Petrera, and C Scimiterna is about the lattice Schwarzian KDV equation and its symmetries, while O G Rasin and P E Hydon study the conservation laws for integrable difference equations. S Saito and N Saitoh discuss recurrence equations associated with invariant varieties of periodic points, and P H van der Kamp presents closed-form expressions for integrals of MKDV and sine-Gordon maps. Ultra-discrete systems. This final category contains an article by C Ormerod on connection matrices for ultradiscrete linear problems. We would like to express our sincerest thanks to all contributors, and to everyone involved in compiling this special issue.

Nuclear Modification of Neutral Pion Production at Low x in √s=200 GeV d+Au and p+p Collisions

NASA Astrophysics Data System (ADS)

Sedgwick, Kenneth Blair

Nuclear modification factors quantify suppression in particle production due to nuclear effects. They are defined as a ratio of invariant yields, with a numerator derived from a given species of nuclear collision and a denominator derived from a hypothetically equivalent ensemble of independent proton-proton collisions. At large momentum transfer Q 2 and low momentum fraction x, the neutral pion nuclear modification factor Rd+Au for d+Au collisions is useful for investigating initial state gluon saturation. The large initial state gluon multiplicity of the Au nucleus causes saturation effects to occur at lower energies in d+Au collisions, as compared to p+p collisions, resulting in a relative suppression. Measuring the relative suppression R d+Au can therefore test the validity of competing models describing saturation, including the framework of a color glass condensate (CGC). Measurements at low x are of particular interest because in this region linear pQCD evolution equations begin to break down. The Froissart theorem places a robust theoretical upper limit on the behavior of hadronic cross sections: a cross section can increase at most like ln2 E. Equivalently, an hadronic structure function can increase at most like ln2(1/x). Adherence to this theorem is necessary to preserve S-matrix unitarity; no physical system should exhibit behavior to the contrary. However linear evolution equations, which dictate structure function behavior, predict an unchecked growth of low-x gluons, in violation of the theorem. For this reason, it is expected that gluon saturation, via non-linear evolution, will take place at low x to steer the gluon distribution function back within the limitations of the Froissart bound. Greater suppression is expected at lower Q2; however, at low x, regions of high Q 2 are more difficult to access experimentally. Pushing out to higher Q2 is important for discriminating between competing theoretical models. In practice, regions of low x and high Q 2 translate to measurements at, respectively, high rapidity eta and high transverse momentum p⊥. The high rapidity 3.1 < eta < 3.9 Muon Piston Calorimeter (MPC) detector at PHENIX is ideally suited for measurements of neutral pion R d+Au probing regions of low x. At √s = 200 GeV, a combinatoric analysis of neutral pion decay products in the MPC can obtain measurements of Rd+Au up to a transverse momentum of p⊥ = 2 GeV/c. However, at p ⊥ greater than 2 GeV/c, photons from neutral pion decay have insufficient spatial separation to be independently resolved in the detector. In this analysis the transverse momentum range of the detector, measuring R d+Au at √s = 200 GeV, is extended to p⊥ = 3.5 GeV/c by studying photon pairs from neutral pions that resolve in the MPC as a single cluster. Increased suppression is reproduced at low p⊥, in agreement with previous data. For p⊥ > 2 GeV/c Cronin enhancement is not observed, as anticipated by the CGC framework. However, the data can not rule out the possibility that the observed suppression is the result of extreme nuclear shadowing. Also presented are invariant neutral pion yields for p+p and d+Au collisions and the invariant neutral pion cross section for p+p collisions at √s = 200 GeV.

Angular Distributions of High-Mass Dilepton Production in Hadron Collisions

DOE Office of Scientific and Technical Information (OSTI.GOV)

McClellan, Randall Evan

The SeaQuest experiment is a fixed-target dimuon experiment currently running at the Fermi National Accelerator Laboratory (FNAL). By utilizing the high-intensity, 120 GeV proton beam delivered by the FNAL Main Injector (MI), SeaQuest is able to measure proton-induced Drell-Yan dimuon production off of various nuclear targets in kinematic regions inaccessible to previous similar experiments. A suitably large fraction of the final dataset has been recorded, reconstructed, and analyzed. Very preliminary results from light-sea flavor asymmetry, nuclear dependence, and partonic energy loss analyses have been presented at numerous international conferences. A novel, FPGA-based trigger system has been designed, implemented, and optimizedmore » for the SeaQuest experiment. By implementing the trigger decision logic in FPGA firmware, it is more adaptable to changing experimental conditions. Additionally, the peripheral tasks of timing alignment, “trigger matrix” generation, and firmware uploading have been mostly automated, reducing the likelihood of user error in the maintenance and operation of the trigger system. Significant upgrades to hardware and firmware have greatly improved the performance of the trigger system since the 2012 commissioning run of SeaQuest. Four additional v1495 modules were added to facilitate thorough pulser testing of the firmware designs and in-situ pulser tests of all compiled firmware. These pulser tests proved crucial for diagnosing many errors that may have otherwise gone unnoticed. A significant change to the internal clocking of the trigger system eliminated a subtle source of rate-dependent trigger efficiency. With this upgrade, the trigger finally meets the “dead-time free” design specification. Drell-Yan dimuon data have been collected and analyzed for central θCS , with nearly flat acceptance in φCS , in the mass range 5.0 GeV < Mγ* < 10.0 GeV at forward xF with the SeaQuest spectrometer at FNAL. A very preliminary extraction of λ has been performed, and the remaining difficulties in extracting ν have been evaluated. Although the results are not yet publishable, significant progress has been made in developing this very challenging angular distributions analysis. A simple scheme for correcting for the angular acceptances of the spectrometer, trigger, and reconstruction has been developed and demonstrated. A generally applicable correction for the kinematically-dependent, rate-dependent reconstruction efficiency has been developed and applied to all current analyses on SeaQuest data. This rate-dependence correction was the first major hurdle in the path to publication of many preliminary SeaQuest results. The last remaining major correction for all analyses, but especially important for the angular parameter extraction, is the full characterization, rate-dependence correction, and subtraction of the combinatoric background contribution to the reconstructed dimuon sample. Independently, an intuitive, kinematic derivation of the single-event definitions of the Drell-Yan angular parameters has been developed under the assumption of unpolarized annihilating quarks within unpolarized nuclei. At O(αs), where the quarks remain co-planar with the hadrons in the photon rest frame, this kinematic method reproduces the Lam-Tung relation and derives an additional equality for µ2, which is only interpretable for single-event parameters. This method has been extended to the case of quark non- coplanarity, and the coplanar equalities become inequalities. A new equality was discovered, which should be obeyed by single-event parameters even in the case of a non-coplanar quark axis. The non-coplanar parameter relations have been used to derive constraints on the experimentally accessible values of λ and ν. These constraints are compared with existing data and have been found consistent, except in the cases where significant contributions from non-zero Boer-Mulders functions are expected. Finally, the kinematically- derived parameter definitions have been applied to high-precision CMS data. The relative contributions of the qq¯ and qg processes to the Z-boson “Drell-Yan” cross-section have been extracted. Further, an average measure of non-coplanarity, likely caused by O(α2) and higher processes, has been extracted.« less

Expert and novice categorization of introductory physics problems

NASA Astrophysics Data System (ADS)

Wolf, Steven Frederick

Since it was first published 30 years ago, Chi et al.'s seminal paper on expert and novice categorization of introductory problems led to a plethora of follow-up studies within and outside of the area of physics [Chi et al. Cognitive Science 5, 121 -- 152 (1981)]. These studies frequently encompass "card-sorting" exercises whereby the participants group problems. The study firmly established the paradigm that novices categorize physics problems by "surface features" (e.g. "incline," "pendulum," "projectile motion,"... ), while experts use "deep structure" (e.g. "energy conservation," "Newton 2,"... ). While this technique certainly allows insights into problem solving approaches, simple descriptive statistics more often than not fail to find significant differences between experts and novices. In most experiments, the clean-cut outcome of the original study cannot be reproduced. Given the widespread implications of the original study, the frequent failure to reproduce its findings warrants a closer look. We developed a less subjective statistical analysis method for the card sorting outcome and studied how the "successful" outcome of the experiment depends on the choice of the original card set. Thus, in a first step, we are moving beyond descriptive statistics, and develop a novel microscopic approach that takes into account the individual identity of the cards and uses graph theory and models to visualize, analyze, and interpret problem categorization experiments. These graphs are compared macroscopically, using standard graph theoretic statistics, and microscopically, using a distance metric that we have developed. This macroscopic sorting behavior is described using our Cognitive Categorization Model. The microscopic comparison allows us to visualize our sorters using Principal Components Analysis and compare the expert sorters to the novice sorters as a group. In the second step, we ask the question: Which properties of problems are most important in problem sets that discriminate experts from novices in a measurable way? We are describing a method to characterize problems along several dimensions, and then study the effectiveness of differently composed problem sets in differentiating experts from novices, using our analysis method. Both components of our study are based on an extensive experiment using a large problem set, which known physics experts and novices categorized according to the original experimental protocol. Both the size of the card set and the size of the sorter pool were larger than in comparable experiments. Based on our analysis method, we find that most of the variation in sorting outcome is not due to the sorter being an expert versus a novice, but rather due to an independent characteristic that we named "stacker" versus "spreader." The fact that the expert-novice distinction only accounts for a smaller amount of the variation may partly explain the frequent null-results when conducting these experiments. In order to study how the outcome depends on the original problem set, our problem set needed to be large so that we could determine how well experts and novices could be discriminated by considering both small subsets using a Monte Carlo approach and larger subsets using Simulated Annealing. This computationally intense study relied on our objective analysis method, as the large combinatorics did not allow for manual analysis of the outcomes from the subsets. We found that the number of questions required to accurately classify experts and novices could be surprisingly small so long as the problem set was carefully crafted to be composed of problems with particular pedagogical and contextual features. In order to discriminate experts from novices in a categorization task, it is important that the problem sets carefully consider three problem properties: The chapters that problems are in (the problems need to be from a wide spectrum of chapters to allow for the original "deep structure" categorization), the processes required to solve the problems (the problems must required different solving strategies), and the difficulty of the problems (the problems must be "easy"). In other words, for the experiment to be "successful," the card set needs to be carefully "rigged" across three property dimensions.

CALL FOR PAPERS: Special issue on Symmetries and Integrability of Difference Equations

NASA Astrophysics Data System (ADS)

Doliwa, Adam; Korhonen, Risto; Lafortune, Stephane

2006-10-01

This is a call for contributions to a special issue of Journal of Physics A: Mathematical and General entitled `Special issue on Symmetries and Integrability of Difference Equations' as featured at the SIDE VII meeting held during July 2006 in Melbourne (http://web.maths.unsw.edu.au/%7Eschief/side/side.html). Participants at that meeting, as well as other researchers working in the field of difference equations and discrete systems, are invited to submit a research paper to this issue. This meeting was the seventh of a series of biennial meetings devoted to the study of integrable difference equations and related topics. The notion of integrability was first introduced in the 19th century in the context of classical mechanics with the definition of Liouville integrability for Hamiltonian flows. Since then, several notions of integrability have been introduced for partial and ordinary differential equations. Closely related to integrability theory is the symmetry analysis of nonlinear evolution equations. Symmetry analysis takes advantage of the Lie group structure of a given equation to study its properties. Together, integrability theory and symmetry analysis provide the main method by which nonlinear evolution equations can be solved explicitly. Difference equations, just as differential equations, are important in numerous fields of science and have a wide variety of applications in such areas as: mathematical physics, computer visualization, numerical analysis, mathematical biology, economics, combinatorics, quantum field theory, etc. It is thus crucial to develop tools to study and solve difference equations. While the theory of symmetry and integrability for differential equations is now well-established, this is not yet the case for discrete equations. The situation has undergone impressive development in recent years and has affected a broad range of fields, including the theory of special functions, quantum integrable systems, numerical analysis, cellular automata, representations of quantum groups, symmetries of difference equations, discrete (difference) geometry, etc. Consequently, the aim of the special issue is to benefit from the occasion offered by the SIDE VII meeting to provide a collection of papers which represent the state-of-the-art knowledge for studying integrability and symmetry properties of difference equations. Scope of the special issue The special issue will feature papers which deal with themes that were covered by the SIDE VII Conference. These are •Integrability testing •Discrete geometry and visualization •Laurent phenomena and cluster algebras •Ultra-discrete systems •Random matrix theory •Algebraic-geometric approaches to integrability •Yang-Baxter equations •Quantum and classical integrable systems •Difference Galois theory Editorial policy •The subject of the paper should relate to the subject of the meeting. The Guest Editors will reserve the right to judge whether a contribution fits the scope of the topic of the special issue. •Contributions will be refereed and processed according to the usual procedure of the journal. •Conference papers may be based on already published work but should either •contain significant additional new results and/or insights or •give a survey of the present state of the art, a critical assessment of the present understanding of a topic, and a discussion of open problems. •Papers submitted by non-participants should be original and contain substantial new results. Guidelines for preparation of contributions • The deadline for contributed papers will be 15 January 2007. •There is a page limit of 16 printed pages (approximately 9600 words) per contribution. For submitted papers exceeding this length the Guest Editors reserve the right to request a reduction in length. Further advice on document preparation can be found at www.iop.org/Journals/jphysa •Contributions to the special issue should if possible be submitted electronically by web upload at www.iop.org/Journals/jphysa, or by email to jphysa@iop.org, quoting 'J. Phys. A Special Issue: SIDE VII'. Submissions should ideally be in standard LaTeX form; we are, however, able to accept most formats including Microsoft Word. Please see the website for further information on electronic submissions. •Authors unable to submit electronically may send hard-copy contributions to: Publishing Administrators, Journal of Physics A, Institute of Physics Publishing, Dirac House, Temple Back, Bristol BS1 6BE, UK, enclosing electronic code on floppy disk if available and quoting 'J. Phys. A Special Issue: SIDE VII'. • All contributions should be accompanied by a read-me file or covering letter giving the postal and email address for correspondence. The Publishing Office should be notified of any subsequent change of address. •The special issue will be published in the paper and online version of the journal. The corresponding author of each contribution will receive a complimentary copy of the issue.

Hierarchical Motion Planning for Autonomous Aerial and Terrestrial Vehicles

NASA Astrophysics Data System (ADS)

Cowlagi, Raghvendra V.

Autonomous mobile robots---both aerial and terrestrial vehicles---have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of the vehicular task requirements, which requires tools from combinatorics and/or formal methods, and (2) design of the vehicle control laws, which requires tools from dynamical systems and control theory. Accordingly, this problem is usually decomposed and solved over two levels of hierarchy. The higher level, called the geometric path planning level, finds a geometric path that satisfies the vehicular task requirements, e.g., obstacle avoidance. The lower level, called the trajectory planning level, involves sufficient smoothening of this geometric path followed by a suitable time parametrization to obtain a reference trajectory for the vehicle. Although simple and efficient, such hierarchical decomposition suffers a serious drawback: the geometric path planner has no information of the kinematical and dynamical constraints of the vehicle. Consequently, the geometric planner may produce paths that the trajectory planner cannot transform into a feasible reference trajectory. Two main ideas appear in the literature to remedy this problem: (a) randomized sampling-based planning, which eliminates the geometric planner altogether by planning in the vehicle state space, and (b) geometric planning supported by feedback control laws. The former class of methods suffer from a lack of optimality of the resultant trajectory, while the latter class of methods makes a restrictive assumption concerning the vehicle kinematical model. We propose a hierarchical motion planning framework based on a novel mode of interaction between these two levels of planning. This interaction rests on the solution of a special shortest-path problem on graphs, namely, one using costs defined on multiple edge transitions in the path instead of the usual single edge transition costs. These costs are provided by a local trajectory generation algorithm, which we implement using model predictive control and the concept of effective target sets for simplifying the non-convex constraints involved in the problem. The proposed motion planner ensures "consistency" between the two levels of planning, i.e., a guarantee that the higher level geometric path is always associated with a kinematically and dynamically feasible trajectory. The main contributions of this thesis are: 1. A motion planning framework based on history-dependent costs (H-costs) in cell decomposition graphs for incorporating vehicle dynamical constraints: this framework offers distinct advantages in comparison with the competing approaches of discretization of the state space, of randomized sampling-based motion planning, and of local feedback-based, decoupled hierarchical motion planning, 2. An efficient and flexible algorithm for finding optimal H-cost paths, 3. A precise and general formulation of a local trajectory problem (the tile motion planning problem) that allows independent development of the discrete planner and the trajectory planner, while maintaining "compatibility" between the two planners, 4. A local trajectory generation algorithm using mpc, and the application of the concept of effective target sets for a significant simplification of the local trajectory generation problem, 5. The geometric analysis of curvature-bounded traversal of rectangular channels, leading to less conservative results in comparison with a result reported in the literature, and also to the efficient construction of effective target sets for the solution of the tile motion planning problem, 6. A wavelet-based multi-resolution path planning scheme, and a proof of completeness of the proposed scheme: such proofs are altogether absent from other works on multi-resolution path planning, 7. A technique for extracting all information about cells---namely, the locations, the sizes, and the associated image intensities---directly from the set of significant detail coefficients considered for path planning at a given iteration, and 8. The extension of the multi-resolution path planning scheme to include vehicle dynamical constraints using the aforementioned history-dependent costs approach. The future work includes an implementation of the proposed framework involving a discrete planner that solves classical planning problems more general than the single-query path planning problem considered thus far, and involving trajectory generation schemes for realistic vehicle dynamical models such as the bicycle model.

PREFACE Quantum Groups, Quantum Foundations and Quantum Information: a Festschrift for Tony Sudbery

NASA Astrophysics Data System (ADS)

Weigert, Stefan

2010-11-01

On 29 July 2008, Professor Anthony Thomas Sudbery - known as Tony to his friends and colleagues - celebrated his 65th birthday. To mark this occasion and to honour Tony's scientific achievements, a 2-day Symposion was held at the University of York on 29-30 September 2008 under the sponsorship of the Institute of Physics and the London Mathematical Society. The breadth of Tony's research interests was reflected in the twelve invited lectures by A Beige, I Bengtsson, K Brown, N Cerf, E Corrigan, J Ladyman, A J Macfarlane, S Majid, C Manogue, S Popescu, J Ryan and R W Tucker. This Festschrift, also made possible by the generosity of the IOP and the LMS, reproduces the majority of these contributions together with other invited papers. Tony obtained his PhD from the University of Cambridge in 1970. His thesis, written under the guidance of Alan Macfarlane, is entitled Some aspects of chiral su(3) × su(3) symmetry in hadron dynamics. He arrived in York in 1971 with his wife Rodie, two young daughters, a lively mind and a very contemporary shock of hair. He was at that stage interested in mathematical physics and so was classed as an applied mathematician in the departmental division in place at that time. But luckily Tony did not fit into this category. His curiosity is combined with a good nose for problems and his capacity for knocking off conjectures impressed us all. Within a short time of his arrival he was writing papers on group theory, complex analysis and combinatorics, while continuing to work on quantum mechanics. His important paper on quaternionic analysis is an example of the imagination and elegance of his ideas. By developing a derivative, he replaced the relatively obscure analytical theory of quaternions by one informed by modern complex analysis. Other interests emerged, centred round the quantum: quantum mechanics and its foundations, quantum groups and quantum information. He didn't just dabble in these areas but mastered them, gaining a national and international reputation; for instance he joined Roger Penrose in a discussion on 'The Physics of Reality' in Melvyn Bragg's radio series 'In our time'. He was much in demand for contributions to the 'News and Views' section in Nature and has written numerous book reviews in scientific and semi-popular journals as well as newspaper commentaries on important scientific developments. Quantum foundations and quantum information have remained Tony's main professional preoccupations. As a contribution to the conceptual problems surrounding quantum measurement, he undertook a detailed analysis of the observation of decay, introducing the crucial distinction between continuous measurement and continual observation. A red thread through his work in quantum mechanics has been the critical scrutiny of different interpretations of quantum mechanics and the question of their experimental testability. As a result he has become an eloquent proponent of a version of what is commonly known as the 'many-worlds' interpretation in his most recent paper (arXiv:1009.3914), Tony explains why he considers the name 'Everett-Wheeler interpretation' as most appropriate and 'many worlds' unnecessary. Tony started directing his research effort to quantum information theory in the late 1990s. He quickly established himself in the quantum information community, putting York on the map in this field. He was among the first people to investigate entanglement properties of multipartite states, particularly the 3-qubit states. While studying the pure 4-qubit states he mysteriously came up with what could rightly be called the 'Sudbery state': equation (where ω is a primitive root of 1), which is the most entangled 4-qubit state in natural measures of entanglement. He continues to work in quantum information theory, particularly on quantum entanglement. Not least there is also Tony the philosopher who wrote articles with such intriguing titles as 'The necessity of not doing otherwise' or 'Why am I me? and why is my world so classical?'. Tony was a teacher of the old school. His lectures were inspiring and fun. He believed that the personal element is central to understanding and inspiration, shown by his whole-hearted commitment to small group teaching. Tony's experience of teaching quantum physics to mathematicians is reflected in his widely known text on quantum mechanics for mathematicians entitled Quantum Mechanics and the Particles of Nature (Cambridge 1986). In 1994, Tony succeeded John Fountain as Head of Department. The 1990s had been a difficult decade for universities in Britain but John had managed to keep the Department on a sound footing, providing foundations which enabled Tony to develop a growth strategy and realise new opportunities when they arose. Despite these challenges Tony was not to be distracted from his scientific work but started to make his significant contributions to quantum information science. Tony's interests extend beyond mathematics, physics and philosophy: to science fiction, music (both classical and jazz) and theatre - he exercised his thespian talents in his lectures and as a member of the York Shakespeare Project. And his lively mind is matched by a lively body: Tony still plays a mean game of squash and of tennis, and his enthusiastic and acrobatic dancing is most remarkable - it would be no surprise if he were to appear on the popular British TV show 'Strictly Come Dancing'. A man of many parts... On behalf of all contributors to the Festschrift it remains for us to wish Tony many productive and happy years to come in this new phase of his life that he himself characterises with the word 'freedom' (and that surely doesn't match the definition of 'retirement'). There is no doubt that he will utilise this newly-gained freedom to continue to inspire and challenge his fellow scientists with his inquisitive mind and cheerful spirit. York, October 2010 Paul Busch, Maurice Dodson and Atsushi Higuchi Stefan Weigert (editor)

CALL FOR PAPERS: Special issue: One hundred years of PVI, the Fuchs Painlevé equation

NASA Astrophysics Data System (ADS)

Clarkson, P. A.; Joshi, N.; Mazzocco, M.; Nijhoff, F. W.; Noumi, M.

2005-10-01

This is a call for contributions to a special issue of Journal of Physics A: Mathematical and General entitled `One hundred years of Painlevé VI, the Fuchs Painlevé equation'. The motivation behind this special issue is to celebrate the centenary of the discovery of this famous differential equation. The Editorial Board has invited P A Clarkson, N Joshi, M Mazzocco, F W Nijhoff and M Noumi to serve as Guest Editors for the issue. The nonlinear ordinary differential equation, which is nowadays known as the Painlevé VI (PVI) equation, is one of the most important differential equations in mathematical physics. It was discovered 100 years ago by Richard Fuchs (son of the famous mathematician Lazarus Fuchs) and reported for the first time in Comptes Rendus de l'Academie des Sciences Paris 141 555 8 (1905). Gambier, in his seminal paper of 1906, included this equation as the top equation in the list of what are now known as the six Painlevé transcendental equations. The Painlevé list emerged from the work on the classification of all ordinary second-order differential equations whose general solution are `uniform', in the sense that there are no movable (i.e. as a function of the initial data) singularities (meaning branch points) worse than poles. The latter is known as the Painlevé property. As the top equation in the Painlevé list of transcendental equations, the importance of PVI can be appreciated by recognizing that this is a universal differential equation, which is the most general (in terms of number of free parameters) of the known second order ODEs defining nonlinear special functions. As such, parallels can be drawn between the role played by PVI transcendents in the nonlinear case and the hypergeometric functions at the linear level. In fact, the monograph From Gauss to Painlevé by K Iwasaki, H Kimura, S Shimomura and M Yoshida (Vieweg, 1991), draws very clearly the line stretching over more than 150 years of special function theory in which PVI is placed as the key equation. In recent years these lines have been extended into the discrete domain, i.e. the field of nonlinear ordinary difference equations, and discrete analogues of PVI have opened entirely new fields of investigation. The aim of the special issue, dedicated specifically to the PVI equations and its avatars rather than to general Painlevé theory, is to consolidate the state-of-the-art knowledge of the properties of this equation and to highlight modern developments (including generalizations of PVI, such as the Garnier system, as well as discrete versions of the equation). The issue should be a repository of high-quality original research papers as well as some invited topical reviews. Scope of the special issue The special issue is dedicated to the study of the Painlevé VI equation, its solutions and properties, and to its generalizations—either in the direction of higher-order differential equations associated with PVI (and related Garnier and Schlesinger systems), or in the direction of difference analogues of the equation. The special issue will welcome contributions that go into the analysis (including asymptotic theory) of Painlevé VI transcendents, the corresponding monodromy theory, the representation theory aspects, the underlying algebraic geometry of the solution manifolds, associated combinatorics and random matrix theory, as well as q-difference and discrete versions of the equation, and last but not least applications in physics. Papers dealing primarily with Painlevé equations other than PVI, or with general Painlevé theory, are not encouraged as these would deflect the contents of the special issue from its specific celebrational motivation. Editorial policy All contributions to the special issue will be refereed in accordance with the refereeing policy of the journal. The Guest Editors will reserve the right to judge whether a contribution fits the scope of the topic of the special issue. Guidelines for preparation of contributions • We aim to publish the special issue in the first half of 2006, in order not to lose the connection with the celebrational year 2005, marking the 100-year anniversary of the discovery of PVI. To realize this, the deadline for contributed papers will be 31 January 2006. • There is a page limit of 16 printed pages (approximately 9600 words) per contribution. For submitted papers exceeding this length the Guest Editors reserve the right to request a reduction in length. Further advice on document preparation can be found at www.iop.org/Journals/jphysa • Contributions to the special issue should if possible be submitted electronically by web upload at www.iop.org/Journals/jphysa, or by email to jphysa@iop.org, quoting `J. Phys. A Special Issue: Painlevé VI'. Submissions should ideally be in standard LaTeX form; we are, however, able to accept most formats including Microsoft Word. Please see the website for further information on electronic submissions. • Authors unable to submit electronically may send hard-copy contributions to: Publishing Administrators, Journal of Physics A, Institute of Physics Publishing, Dirac House, Temple Back, Bristol BS1 6BE, UK, enclosing electronic code on floppy disk if available and quoting `J. Phys. A Special Issue: Painlevé VI'. • All contributions should be accompanied by a read-me file or covering letter giving the postal and email address for correspondence. The Publishing Office should be notified of any subsequent change of address. The special issue will be published in the paper and online version of the journal. The corresponding author of each contribution will receive a complimentary copy of the issue.

Lattice models and integrability: a special issue in honour of F Y Wu

NASA Astrophysics Data System (ADS)

Guttmann, A. J.; Jacobsen, J. L.

2012-12-01

Fa Yueh (Fred) Wu was born on 5 January 1932 in Nanking (now known as Nanjing), China, the capital of the Nationalist government. Wu began kindergarten in 1937 in a comfortable setting, as his father held a relatively high government position. But the Sino-Japanese war broke out in July 1937, and Nanking fell to Japanese hands in November. Fleeing the Japanese, his parents brought Wu to their hometown in Hunan, and then to the war capital Chungking (now Chongqing) in 1938, where they lived for eight years until the end of the war. Around that time the Japanese began bombing Chungking, and Wu's childhood memories were dominated by air raids, bombings and burning not dissimilar to those experienced by Londoners during the war. At times the air raids lasted for days disrupting everyday lives in Chungking, including Wu's schooling. One day during a fierce bombing raid, a bomb fell in their garden reducing a pavilion and the surrounding pond to a huge crater; another bomb fell just a few metres from the tunnel where his family took shelter, almost sealing the only entrance. The family moved the very next day to the countryside. As a result of the war, Wu attended seven schools before finishing his primary education. Fortunately, by the time he entered junior high school in 1943, the Japanese forces were on the wane and Wu entered the elite middle school, Nankai. His early academic performance in Nankai seemed to him mediocre, but he nevertheless impressed his geometry teacher by showing bursts of talent. With hindsight, this early interest in geometry may have led to his later insights in graphical analyses of statistical systems. The family returned to Nanking in 1946 after the Victory over Japan Day. By this time his father had become elected to the Legislative Yuan, the equivalent of the US Senate. Wu entered high school in Nanking in 1946. Since he came from an elite school in Chungking, he excelled in most of his classes, especially mathematics. Notwithstanding his academic success, Wu probably spent more time playing Chinese chess, a board game similar to international chess. He ranked high in a city-wide tournament and often played blind-folded games. He also spent time playing bridge, a game he learned in Nankai and kept up throughout his years in the US. He also loved puzzles and riddles. But the good days did not last long, as the civil war drew closer to Nanking with the Communists winning. The family fled Nanking once again, following a zigzag path and traveling by boat, train, car and then by boat again, eventually reaching Taiwan in June 1949. By this time, the Nationalists had lost most of China, and there was no hope of returning to the mainland. Wu entered the Naval College of Technology to study electrical engineering, giving up an opportunity to study mathematics in the National Taiwan University, although his real interest was in mathematics. In 1954, Wu graduated from the Naval College with a BS degree and the commission of Ensign. Recognizing his outstanding academic record in the College, the Chinese Navy sent him to the US in 1955 to study radar and sonar and to receive training as an instructor. He stayed at the Naval School of Electronics in San Francisco and at the Instructor's School in San Diego. Wu felt that he benefited from the instructor's training much more than from the electronics school, as the training helped him to develop teaching and presentation skills that served him well throughout his career. The Navy assigned him to teach electronics in the Naval Academy when he returned to Taiwan in 1956. Wu was interested in attending a graduate school. The only institution that offered a graduate degree in Taiwan at the time was Taiwan's newly re-established Tsing Hua University. In its hurried retreat to Taiwan, the Nationalist government left the original Tsing Hua University, one of China's best-known institutions of higher learning with a history dating back to the 19th century, behind in Beijing. In 1956, after gaining footing in Taiwan, the Nationalist government revived Tsing Hua, and began offering a two-year Master's degree in nuclear science. Wu decided to apply for admission but faced considerable obstacles since he was in the Navy. After one year's effort, mostly on his father's part, Wu finally entered Tsing Hua in 1957. He completed the two-year program with an experimental thesis in 1959. By this time, the US was pushing for a scientific renaissance after the launch of the Soviet satellite Sputnik. Wu received offers of teaching assistantships from several physics departments in the US, and chose to continue his graduate education at Washington University in St. Louis in 1959. At Washington University he studied many-body theory under the late Eugene Feenberg and produced several influential papers [1, 2] on ground state properties of liquid helium-3 and liquid helium-4. In 1963, he published a paper on formulating cluster expansions in an N-body problem [3], extending the Mayer expansion to systems with indexed many-body interactions, which appeared to have escaped the attention of the community of statistical physics that it deserved. The expansion made extensive use of graphical terms, demonstrating his prowess in graphical analysis at an early stage of his career. Wu's interest in many-body theory continued over the years, with subsequent works on the electron gas, adsorbed systems, and the long-perplexing problem of density correlations in Fermi and Bose systems. After obtaining his PhD from Washington University in 1963, Wu went on to teach at Virginia Polytechnic Institute (VPI) as an assistant professor. In February 1967, Wu met Elliott Lieb who was visiting VPI to give a talk on the Bethe ansatz evaluation of the entropy of two-dimensional ice, a 6-vertex model. Wu soon realized the underlying graphical aspects of two-dimensional vertex models and solved the thermodynamics of a related 5-vertex model using the Pfaffian approach. The result was published in the April issue of Physical Review Letters (PRL) of the same year [4], and in September 1967, Wu moved to Northeastern University to join Lieb's group. Wu taught at Northeastern for 39 years until his retirement in 2006 as the Matthews Distinguished University Professor of Physics. Over the years, Wu has published more than 230 papers and monographs, and he continues to publish after retirement. Most of his research since 1967 is in exact and rigorous analyses of lattice models and integrable systems, which is the theme of this special issue. In 1968, after Wu's arrival at Northeastern, Lieb and Wu obtained the exact solution of the ground state of the one-dimensional Hubbard model and published the result in PRL [5], a work which has since become highly important after the advent of high-temperature superconductivity. This Lieb-Wu paper and Wu's 1982 review of the Potts model in Reviews of Modern Physics [37] are among the most cited papers in condensed matter physics. Later in 1968 Lieb departed Northeastern for MIT. As a result, the full version of the solution was not published until 34 years later [38] when Lieb and Wu collaborated to work on the manuscript on the occasion of Wu's 70th birthday. Wu spent the summer of 1968 at Stony Brook as the guest of C N Yang. Working with Yang's student, C Fan, he extended the Pfaffian solution of the Ising model to general lattices and termed such models 'free-fermion', a term now in common use [6]. In 1972, Wu visited R J Baxter, whom he had met earlier in 1968 at MIT, in Canberra, Australia, with the support of a Fulbright grant. They solved the triangular-lattice Ising model with 3-spin interactions [7], a model now known as the Baxter-Wu model. It was an ideal collaboration. While Baxter derived the solution algebraically, Wu used graphical methods to reduce the problem to an Ashkin-Teller model, which greatly simplifies the presentation. While in Canberra, Wu also studied the 8-vertex model on the honeycomb lattice [8], a model which proved to be useful in his later research. In 1973, Wu returned to Tsing Hua as a visiting professor and worked with colleague K Y Lin. They published two important papers introducing staggered vertex models for the first time [10, 11]. In other important work they clarified the nature of the phase diagram of the Ashkin-Teller model, and found it to have two phase transitions [9]. In the 1970s Wu traveled to Taiwan, Australia, Europe and to China when it re-opened. He met H N V Temperley in Aberdeen, Scotland in 1976, and collaborated with H J Brascamp and H Kunz in Lausanne to establish a number of rigorous results on vertex models, including a proof of the equivalence of boundary conditions for the 6-vertex model [13, 14]. From 1979 to 1980, Wu resided in the Netherlands and Germany, where he was the guest of Piet Kasteleyn at Leiden, Hans van Leeuwen at Delft and Kurt Binder in Juelich. It was in Juelich that Wu completed the 1982 review paper on the Potts model [37], a paper that has been cited 70 or more times every year since its publication. Another important work in that period is a 1976 graphical analysis of the Potts model on the triangular lattice in collaboration with Baxter and Kelland [15]. This paper provided an elegant and conceptually easy description of the duality relation of the model, complementary to the algebraic analysis of Temperley and Lieb [16]. Four years later, Wu and Lin further refined the graphical aspects to reduce the model to a 5-vertex model, under which the duality relation appears as a simple spatial symmetry [18]. The Wu-Lin formulation of the Potts model is used by Jacobsen and Sculland in an analysis of the kagome-lattice Potts model in their first paper in this issue [39]. In other pioneering work in 1976, Wu and Y K Wang introduced a spin model with chiral interactions and its duality relation in Fourier space [19]. Prior to that time, studies of spin models had invariably been confined to models with symmetric interactions. In 1977 Wu published an influential paper on spanning trees [20]. In it, he derived the spanning tree constants of the regular two-dimensional lattices. Since then, he has been the co-author of several papers extending this work to a variety of other two-dimensional Archimedean lattices [21-23]. In this issue Guttmann1 and Rogers solve the three-dimensional version of this problem, which has resisted attack for more than 30 years [40]. The connection between spanning trees and dimers was previously highlighted by Neville Temperley in 1974 [17]. The ideas from number theory needed to obtain the spanning tree constant of three-dimensional lattices, notably logarithmic Mahler measures, are further discussed in the article by Glasser2 in this issue [41]. Wu has had a long and productive collaboration with Maillard, particularly on aspects of the Ising model. Maillard also wrote the definitive description of Wu's many scientific contributions at the time of Wu's 70th birthday [24]. The paper was later included among the biographies of great names such as Newton and Feynman in the History of Physics: Individual Biographies section in the MIT Net Advance of Physics website [59]. Further developments in the Ising model are highlighted in the article by Boukraa, Hassani and Maillard3 in this issue [42]. Maillard's article also appears as the introduction to a wonderful collection of Wu's works that appeared in 2009 [25], entitled Exactly Solved Models: A Journey in Statistical Mechanics. The relation between bond percolation and the random-cluster formulation of the Potts model was pioneered by Kasteleyn and Fortuin in 1969 [26]. Later, in a 1977 paper, Wu showed how to rederive this relation in a different setting and used it to obtain various quantities of interest in the bond percolation problem, including critical exponents, from the exact solution of the Potts model [27]. A few months later, in collaboration with Kunz, he showed that site percolation can also be related to the Potts model [28]. Problems in bond percolation are treated in this issue by several works. The paper by Hu, Blöte4 and Deng5 investigates how the imposition of a 'canonical' constraint, that there be an equal number of open and closed edges, affects the universal properties [43]. The paper by Ziff6, Scullard, Wierman and Sedlock exactly solves inhomogeneous percolation on lattices of the bow-tie and checkerboard types [44]. In a 1979 paper on Potts model critical points, Wu proposed a conjecture, now known as the homogeneity hypothesis, on the location of the critical point of the kagome lattice [29]. Since then, numerous studies have been carried out to test the validity of that conjecture [12]. However, many of these tests proved to be inconclusive since they produced results extremely close to the conjectured value. The puzzle is finally solved by Jacobsen and Scullard in their two papers in this issue [39, 45]. Using a graphical analysis based on the Wu-Lin 5-vertex formulation, they recover the Wu conjecture of the kagome-lattice critical point as the first-order approximation in a well-defined graphical analysis. This establishes once and for all the approximate nature of the Wu conjecture. These investigations, and the exact solutions found by Wu, raised the question as to the conditions under which a lattice model is exactly solvable. Quite recently, such questions have been addressed through the technique of discrete holomorphicity (DH). This direction is represented in this issue by the contributions of Alam and Batchelor7, where the connection between DH and Yang-Baxter integrability is investigated [46]. DH is also a key ingredient in recent rigorous proofs that certain lattice models converge, in the continuum limit, to conformally invariant probabilistic processes known as Schramm-Loewner evolution (SLE). The theme of SLE appears within this issue in the article by Alberts, Kozdron and Lawler [47]. Finally, DH observables are used in this issue by Duminil-Copin to prove the divergence of the correlation length for the Potts model (in its formulation in terms of Fortuin-Kasteleyn clusters) when 1 <= q <= 4 [48]. Establishing the phase diagrams of lattice models is a recurrent theme in Wu's works. In an interesting but little-known work from 2000 with Guo and Blöte [30], he has shown that, contrary to common belief, the O(n) model on the honeycomb lattice has a second-order phase transition for n > 2. The question of phase diagrams for O(n)-type models is taken up in this issue by Blöte, Wang and Guo8 [49]. In 1983-84, Wu joined the National Science Foundation as the Director of the Condensed Matter Theory Program for 18 months. His duty was managing funding to individual researchers in condensed matter theory in the US. The 18-month tour in Washington offered Wu a bird's-eye view of condensed matter physics research in US universities, an understanding that proved useful to his later researches. Throughout his career, Wu has insisted on the general applicability of graphical analysis to a variety of lattices. This aspect was highlighted in his 1988 paper on the Potts model and graph theory [31], in which he derived a number of equivalences with (di)chromatic and flow polynomials on arbitrary planar graphs, both for the partition function and correlation functions. An earlier result in the same vein is the equivalence of the Potts model on a planar graph with a loop model on the corresponding medial graph, found in 1976 in collaboration with Baxter and Kelland [15]. Building on these results, and on recent progress in the combinatorial approach to planar maps, Borot, Bouttier and Guitter systematically investigate properties of percolation and Potts models on random planar maps in their contribution to this issue [50]. Wu has published extensively on dimer enumerations. His work includes exact enumerations on non-orientable surfaces and surfaces with a single boundary defect. In this issue, Lu and Zhang consider dimer enumerations on the Klein bottle, which is an example of a non-orientable surface [51]. Another contribution is the paper by Ciucu and Fischer, considering dimer coverings of a domain with a defect (hole) in the interior [52]. Wu has also worked extensively in knot theory. He has constructed new knot invariants based on statistical mechanical models [61, 62], and published a well-received review of knot invariants for physicists [32], which elucidates the connection of knot invariants with statistical mechanics. In 2004, Wu presented a new formulation of resistance networks [33], which permits the derivation of the exact expression of the resistance between two arbitrary nodes in any network. He later extended the formulation to impedance networks [34], a work which has since attracted interest in applications in petroleum research. These works can perhaps be seen as a distant echo of Wu's Navy training in electronics, more than 50 years earlier. In recent years Wu has developed this topic in joint work with Essam9, who together with Brak has related work on lattice paths in this issue [53]. A cognate paper by Arrowsmith, Bhatti and Essam also appears [54]. Wu has made other contributions to asymptotic analysis, for example in relation to dimers in his recent papers, where he also uses results from conformal invariance [60]. This thread is taken up by the article of Izmailian10 in this issue [55]. In 1997, Wu reported, in a short paper, a new formulation of duality relations of Potts correlation functions for n spins residing on the boundary of a lattice [35]. He gave the examples of n = 2 and 3, and remarked that the formulation can be extended to higher values of n 'in a straightforward fashion'. But the extension is by no means straightforward11 and its solution was eventually found by Wu and his student H Y Huang [36]. They found that the correlation functions are not all independent when n = 4 and higher. They also deduced the connecting relations expressing crossing correlations in terms of non-crossing correlations, thus resolving the discrepancy. Nowadays the interest in integrable systems largely transcends the realm of equilibrium statistical physics. Important and fundamental applications have appeared in out-of-equilibrium physics, in combinatorics, and in the study of certain dualities between string theories and gauge theories known under the common epithet of AdS/CFT duality. This last trend is represented in this issue by the contribution of Kostov [56]. Other interests of Wu in both quantum and classical systems are reflected in the article by Barry12, Muttalib and Tanaka [57], and in the paper by Bauer, Bernard and Benoist on iterated stochastic measurements [58]. This latter paper appears very timely, since it is inspired by the experiments carried out in the group of Serge Haroche who earned the 2012 Nobel Prize in Physics. Wu met his wife Ching Tse (Jane) in Taipei. They married in 1963 in St. Louis, Missouri. They have three daughters; Yvonne, a Professor of Child Neurology at the University of California San Francisco, Yolanda, a women's rights lawyer and a teacher of Suzuki violin, and Yelena, a postdoc in Child Clinical Psychology at Cincinnati Children's Hospital. Fred and Jane have five grandchildren. Wu left four siblings behind when he left China in 1949, and reunited with them after a 30-year separation for the first time in 1979. Two sisters and one brother are now deceased, and his younger brother, who also has three daughters, lives a comfortable life in retirement in Kunming, China. It has been a pleasure to assemble this collection of papers on the occasion of Fred's 80th birthday, and we wish to thank him for providing much of the biographical information on which this introduction is based. We are also grateful to all the contributors for providing such a diverse and decidedly very modern panorama of the topic of lattice models and integrability, and for meeting the strict deadlines necessary to ensure the completion of this issue before the year 2012 draws to an end. Fred Wu continues to be a highly productive, imaginative scientist, and we look forward to a continuing body of excellent work. Meanwhile, we wish him many more years of a happy and healthy life. 1Wu met Tony Guttmann at the University of Newcastle, Australia, back in 1973 when Guttmann invited him to visit. Over the years their paths have crossed countless times at conferences and workshops, and during Wu's visits to Australia and Guttmann's to America; their families became close friends in the process, with Wu's wife Jane assisting Guttmann's wife Susette in her professional duties when they both visited Taiwan. 2Wu met Larry Glasser in 1968 at MIT and also visited him later at Clarkson. They collaborated in 2003 on a paper later published in the Ramanujan Journal in 2005, in which they evaluated an integral for the entropy of spanning trees on the triangular lattice. 3Wu and Jean-Marie Maillard enjoyed joint research grants, organised between the NSF and the CNRS. They also got together frequently in Taiwan and at conferences including one in Paris on the Yang-Baxter equation in 1992. They have many joint papers, including one of Wu's favorites, a 1992 J. Phys. A: Math. Gen. paper on thermal transmissivity. In that paper they put the loosely defined term transmissivity onto a rigorous footing. 4Henk Blöte and Wu first met in 1973 in Delft. Since then they have visited each other frequently, as Blöte made regular visits to the University of Rhode Island (near Boston) and Beijing Normal University, intersecting those of Wu. They first collaborated in a 1989 paper in which they obtained a closed-form expression for the critical curve of the honeycomb antiferromagnetic Ising model and checked the formula against finite-size analysis. This combination of checking an a priori derivation against high-precision numerical analysis set the tone of Wu's later collaborations with Blöte and his students. 5Youjin Deng obtained his PhD in 2004 under the direction of Blöte at Delft. Wu served on Deng's Dissertation Committee and participated in his graduation ceremony. 6Through Wu's recent works on the Potts model he got to know Bob Ziff well. They exchanged preprints and e-mails, and often had lengthy discussions on minute points, including the use and origin of the term 'hemp-leaf lattice'. 7Wu and Murray Batchelor met at the Australia National University in 1990 and again in 1995, and their paths have crossed at many conferences and workshops. 8Wenan Guo likewise obtained his PhD under the supervision of Blöte in Delft. Wu and Guo know each other well from Wu's visits to the Beijing Normal University where he is an honorary professor. He has collaborated with Guo, on the subject of finite-size analysis using the transfer matrix approach, in several of his recent papers. 9Wu first met John Essam at King's College, London in 1978. Followoing Wu's 2006 closed-form expression of the corner-to-corner resistance of an M × N resistor network in the form of a double summation, they combined forces in 2008 at a workshop in Cambridge, and derived the asymptotic expansion of that expression. 10Nickolay Izmailian holds positions in Armenia and Taiwan. Wu and Izmailian collaborated in a paper in 2000 on the exact solution of a 6-vertex model with bond defects. Most recently they collaborated on the exact enumeration of dimers on a cylinder with a single boundary defect. 11Wu's acquaintance with Jesper Jacobsen goes back to this period, when the latter pointed out this fact in a comment to Wu's first paper on this subject. They have since crossed paths on various occasions, most recently at a 2008 workshop at the Isaac Newton Institute in Cambridge. 12Jerry Barry is another long-term collaborator of Wu's. They have met at numerous conferences and workshops. In one meeting in 1989, Barry called Wu's attention to a three-dimensional spin model on the pyrochlore lattice that appeared to be soluble. They soon solved the Ising model on that lattice. In 1997 they collaborated on a paper obtaining the phase diagram of a ternary polymer model.