The Algebraic Intersection Type Unification Problem

The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type unification problem is decidable. We give the first nontrivial lower bound for the problem by showing (our main result) that it is exponential time hard. Furthermore, we show that this holds even under rank 1 solutions (substitutions whose codomains are restricted to contain rank 1 types). In addition, we provide a fixed-parameter intractability result for intersection type matching (one-sided unification), which is known to be NP-complete. We place the algebraic intersection type unification problem in the context of unification theory. The equational theory of intersection types can be presented as an algebraic theory with an ACI (associative, commutative, and idempotent) operator (intersection type) combined with distributivity properties with respect to a second operator (function type). Although the problem is algebraically natural and interesting, it appears to occupy a hitherto unstudied place in the theory of unification, and our investigation of the problem suggests that new methods are required to understand the problem. Thus, for the lower bound proof, we were not able to reduce from known results in ACI-unification theory and use game-theoretic methods for two-player tiling games

The Intersection Type Unification Problem

The intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the unification problem is decidable. We give the first nontrivial lower bound for the problem by showing (our main result) that it is exponential time hard. Furthermore, we show that this holds even under rank 1 solutions (substitutions whose codomains are restricted to contain rank 1 types). In addition, we provide a fixed-parameter intractability result for intersection type matching (one-sided unification), which is known to be NP-complete. We place the intersection type unification problem in the context of unification theory. The equational theory of intersection types can be presented as an algebraic theory with an ACI (associative, commutative, and idempotent) operator (intersection type) combined with distributivity properties with respect to a second operator (function type). Although the problem is algebraically natural and interesting, it appears to occupy a hitherto unstudied place in the theory of unification, and our investigation of the problem suggests that new methods are required to understand the problem. Thus, for the lower bound proof, we were not able to reduce from known results in ACI-unification theory and use game-theoretic methods for two-player tiling games

Statistics of Flux Vacua for Particle Physics

Supersymmetric flux compactification of F-theory in the geometric phase yields numerous vacua, and provides an ensemble of low-energy effective theories with different symmetry, matter multiplicity and Lagrangian parameters. Theoretical tools have already been developed so that we can study how the statistics of flux vacua depend on the choice of symmetry and some of Lagrangian parameters. In this article, we estimate the fraction of i) vacua that have a U(1) symmetry for spontaneous R-parity violation, and ii) those that realise ideas which achieve hierarchical eigenvalues of the Yukawa matrices. We also learn a lesson that the number of flux vacua is reduced very much when the unbroken $U(1)_Y$ symmetry is obtained from a non-trivial Mordell--Weil group, while it is not when $U(1)_Y$ is in SU(5) unification. It also turns out that vacua with an approximate U(1) symmetry forms a locus of accumulation points of the flux vacua distribution.Comment: 51 page

On the reduction of the degree of linear differential operators

Let L be a linear differential operator with coefficients in some differential field k of characteristic zero with algebraically closed field of constants. Let k^a be the algebraic closure of k. For a solution y, Ly=0, we determine the linear differential operator of minimal degree M and coefficients in k^a, such that My=0. This result is then applied to some Picard-Fuchs equations which appear in the study of perturbations of plane polynomial vector fields of Lotka-Volterra type

Logic Programming and Logarithmic Space

We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic) computation is given via a synctactic restriction, using an encoding of words that derives from proof theory. We show that the acceptance of a word by an observation (the counterpart of a program in the encoding) can be decided within logarithmic space, by reducing this problem to the acyclicity of a graph. We show moreover that observations are as expressive as two-ways multi-heads finite automata, a kind of pointer machines that is a standard model of logarithmic space computation