Abstract Canonical Inference

An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and rewrite-system reduction are connected to proof orderings. Fairness of deductive mechanisms is defined in terms of proof orderings, distinguishing between (ordinary) "fairness," which yields completeness, and "uniform fairness," which yields saturation.Comment: 28 pages, no figures, to appear in ACM Trans. on Computational Logi

Singularity analysis, Hadamard products, and tree recurrences

We present a toolbox for extracting asymptotic information on the coefficients of combinatorial generating functions. This toolbox notably includes a treatment of the effect of Hadamard products on singularities in the context of the complex Tauberian technique known as singularity analysis. As a consequence, it becomes possible to unify the analysis of a number of divide-and-conquer algorithms, or equivalently random tree models, including several classical methods for sorting, searching, and dynamically managing equivalence relationsComment: 47 pages. Submitted for publicatio

Quantum Effective Action in Spacetimes with Branes and Boundaries

We construct quantum effective action in spacetime with branes/boundaries. This construction is based on the reduction of the underlying Neumann type boundary value problem for the propagator of the theory to that of the much more manageable Dirichlet problem. In its turn, this reduction follows from the recently suggested Neumann-Dirichlet duality which we extend beyond the tree level approximation. In the one-loop approximation this duality suggests that the functional determinant of the differential operator subject to Neumann boundary conditions in the bulk factorizes into the product of its Dirichlet counterpart and the functional determinant of a special operator on the brane -- the inverse of the brane-to-brane propagator. As a byproduct of this relation we suggest a new method for surface terms of the heat kernel expansion. This method allows one to circumvent well-known difficulties in heat kernel theory on manifolds with boundaries for a wide class of generalized Neumann boundary conditions. In particular, we easily recover several lowest order surface terms in the case of Robin and oblique boundary conditions. We briefly discuss multi-loop applications of the suggested Dirichlet reduction and the prospects of constructing the universal background field method for systems with branes/boundaries, analogous to the Schwinger-DeWitt technique.Comment: LaTeX, 25 pages, final version, to appear in Phys. Rev.

BOOL-AN: A method for comparative sequence analysis and phylogenetic reconstruction

A novel discrete mathematical approach is proposed as an additional tool for molecular systematics which does not require prior statistical assumptions concerning the evolutionary process. The method is based on algorithms generating mathematical representations directly from DNA/RNA or protein sequences, followed by the output of numerical (scalar or vector) and visual characteristics (graphs). The binary encoded sequence information is transformed into a compact analytical form, called the Iterative Canonical Form (or ICF) of Boolean functions, which can then be used as a generalized molecular descriptor. The method provides raw vector data for calculating different distance matrices, which in turn can be analyzed by neighbor-joining or UPGMA to derive a phylogenetic tree, or by principal coordinates analysis to get an ordination scattergram. The new method and the associated software for inferring phylogenetic trees are called the Boolean analysis or BOOL-AN

Low energy behaviour of standard model extensions

The integration of heavy scalar fields is discussed in a class of BSM models, containing more that one representation for scalars and with mixing. The interplay between integrating out heavy scalars and the Standard Model decoupling limit is examined. In general, the latter cannot be obtained in terms of only one large scale and can only be achieved by imposing further assumptions on the couplings. Systematic low-energy expansions are derived in the more general, non-decoupling scenario, including mixed tree-loop and mixed heavy-light generated operators. The number of local operators is larger than the one usually reported in the literature.Comment: 32 pages, 8 figure

Simulation of anyons with tensor network algorithms

Interacting systems of anyons pose a unique challenge to condensed matter simulations due to their non-trivial exchange statistics. These systems are of great interest as they have the potential for robust universal quantum computation, but numerical tools for studying them are as yet limited. We show how existing tensor network algorithms may be adapted for use with systems of anyons, and demonstrate this process for the 1-D Multi-scale Entanglement Renormalisation Ansatz (MERA). We apply the MERA to infinite chains of interacting Fibonacci anyons, computing their scaling dimensions and local scaling operators. The scaling dimensions obtained are seen to be in agreement with conformal field theory. The techniques developed are applicable to any tensor network algorithm, and the ability to adapt these ansaetze for use on anyonic systems opens the door for numerical simulation of large systems of free and interacting anyons in one and two dimensions.Comment: Fixed typos, matches published version. 16 pages, 21 figures, 4 tables, RevTeX 4-1. For a related work, see arXiv:1006.247