Generalized Connectives for Multiplicative Linear Logic

In this paper we investigate the notion of generalized connective for multiplicative linear logic. We introduce a notion of orthogonality for partitions of a finite set and we study the family of connectives which can be described by two orthogonal sets of partitions. We prove that there is a special class of connectives that can never be decomposed by means of the multiplicative conjunction ? and disjunction ?, providing an infinite family of non-decomposable connectives, called Girard connectives. We show that each Girard connective can be naturally described by a type (a set of partitions equal to its double-orthogonal) and its orthogonal type. In addition, one of these two types is the union of the types associated to a family of MLL-formulas in disjunctive normal form, and these formulas only differ for the cyclic permutations of their atoms

Optimal predictive model selection

Often the goal of model selection is to choose a model for future prediction, and it is natural to measure the accuracy of a future prediction by squared error loss. Under the Bayesian approach, it is commonly perceived that the optimal predictive model is the model with highest posterior probability, but this is not necessarily the case. In this paper we show that, for selection among normal linear models, the optimal predictive model is often the median probability model, which is defined as the model consisting of those variables which have overall posterior probability greater than or equal to 1/2 of being in a model. The median probability model often differs from the highest probability model

Visualising interactions in bi- and triadditive models for three-way tables

This paper concerns the visualisation of interaction in three-way arrays. It extends some standard ways of visualising biadditive modelling for two-way data to the case of three-way data. Three-way interaction is modelled by the Parafac method as applied to interaction arrays that have main effects and biadditive terms removed. These interactions are visualised in three and two dimensions. We introduce some ideas to reduce visual overload that can occur when the data array has many entries. Details are given on the interpretation of a novel way of representing rank-three interactions accurately in two dimensions. The discussion has implications regarding interpreting the concept of interaction in three-way arrays

On the Use of Group Theoretical and Graphical Techniques toward the Solution of the General N-body Problem

Group theoretic and graphical techniques are used to derive the N-body wave function for a system of identical bosons with general interactions through first-order in a perturbation approach. This method is based on the maximal symmetry present at lowest order in a perturbation series in inverse spatial dimensions. The symmetric structure at lowest order has a point group isomorphic with the S_N group, the symmetric group of N particles, and the resulting perturbation expansion of the Hamiltonian is order-by-order invariant under the permutations of the S_N group. This invariance under S_N imposes severe symmetry requirements on the tensor blocks needed at each order in the perturbation series. We show here that these blocks can be decomposed into a basis of binary tensors invariant under S_N. This basis is small (25 terms at first order in the wave function), independent of N, and is derived using graphical techniques. This checks the N^6 scaling of these terms at first order by effectively separating the N scaling problem away from the rest of the physics. The transformation of each binary tensor to the final normal coordinate basis requires the derivation of Clebsch-Gordon coefficients of S_N for arbitrary N. This has been accomplished using the group theory of the symmetric group. This achievement results in an analytic solution for the wave function, exact through first order, that scales as N^0, effectively circumventing intensive numerical work. This solution can be systematically improved with further analytic work by going to yet higher orders in the perturbation series.Comment: This paper was submitted to the Journal of Mathematical physics, and is under revie

Time Evolution within a Comoving Window: Scaling of signal fronts and magnetization plateaus after a local quench in quantum spin chains

We present a modification of Matrix Product State time evolution to simulate the propagation of signal fronts on infinite one-dimensional systems. We restrict the calculation to a window moving along with a signal, which by the Lieb-Robinson bound is contained within a light cone. Signal fronts can be studied unperturbed and with high precision for much longer times than on finite systems. Entanglement inside the window is naturally small, greatly lowering computational effort. We investigate the time evolution of the transverse field Ising (TFI) model and of the S=1/2 XXZ antiferromagnet in their symmetry broken phases after several different local quantum quenches. In both models, we observe distinct magnetization plateaus at the signal front for very large times, resembling those previously observed for the particle density of tight binding (TB) fermions. We show that the normalized difference to the magnetization of the ground state exhibits similar scaling behaviour as the density of TB fermions. In the XXZ model there is an additional internal structure of the signal front due to pairing, and wider plateaus with tight binding scaling exponents for the normalized excess magnetization. We also observe parameter dependent interaction effects between individual plateaus, resulting in a slight spatial compression of the plateau widths. In the TFI model, we additionally find that for an initial Jordan-Wigner domain wall state, the complete time evolution of the normalized excess longitudinal magnetization agrees exactly with the particle density of TB fermions.Comment: 10 pages with 5 figures. Appendix with 23 pages, 13 figures and 4 tables. Largely extended and improved versio

Large NN limit of irreducible tensor models: O(N)O(N) rank-33 tensors with mixed permutation symmetry

It has recently been proven that in rank three tensor models, the anti-symmetric and symmetric traceless sectors both support a large $N$ expansion dominated by melon diagrams [arXiv:1712.00249 [hep-th]]. We show how to extend these results to the last irreducible $O(N)$ tensor representation available in this context, which carries a two-dimensional representation of the symmetric group $S_3$. Along the way, we emphasize the role of the irreducibility condition: it prevents the generation of vector modes which are not compatible with the large $N$ scaling of the tensor interaction. This example supports the conjecture that a melonic large $N$ limit should exist more generally for higher rank tensor models, provided that they are appropriately restricted to an irreducible subspace.Comment: 17 pages, 7 figure