Reconstructing sparticle mass spectra using hadronic decays

Most sparticle decay cascades envisaged at the Large Hadron Collider (LHC) involve hadronic decays of intermediate particles. We use state-of-the art techniques based on the K⊥ jet algorithm to reconstruct the resulting hadronic final states for simulated LHC events in a number of benchmark supersymmetric scenarios. In particular, we show that a general method of selecting preferentially boosted massive particles such as W±, Z0 or Higgs bosons decaying to jets, using sub-jets found by the K⊥ algorithm, suppresses QCD backgrounds and thereby enhances the observability of signals that would otherwise be indistinct. Consequently, measurements of the supersymmetric mass spectrum at the per-cent level can be obtained from cascades including the hadronic decays of such massive intermediate bosons

Topological complexity of the relative closure of a semi-Pfaffian couple

Gabrielov introduced the notion of relative closure of a Pfaffian couple as an alternative construction of the o-minimal structure generated by Khovanskii's Pfaffian functions. In this paper, use the notion of format (or complexity) of a Pfaffian couple to derive explicit upper-bounds for the homology of its relative closure. Keywords: Pfaffian functions, fewnomials, o-minimal structures, Betti numbers.Comment: 12 pages, 1 figure. v3: Proofs and bounds have been slightly improve

Euler configurations and quasi-polynomial systems

In the Newtonian 3-body problem, for any choice of the three masses, there are exactly three Euler configurations (also known as the three Euler points). In Helmholtz' problem of 3 point vortices in the plane, there are at most three collinear relative equilibria. The "at most three" part is common to both statements, but the respective arguments for it are usually so different that one could think of a casual coincidence. By proving a statement on a quasi-polynomial system, we show that the "at most three" holds in a general context which includes both cases. We indicate some hard conjectures about the configurations of relative equilibrium and suggest they could be attacked within the quasi-polynomial framework.Comment: 21 pages, 6 figure

Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving

We derive efficient algorithms for coarse approximation of algebraic hypersurfaces, useful for estimating the distance between an input polynomial zero set and a given query point. Our methods work best on sparse polynomials of high degree (in any number of variables) but are nevertheless completely general. The underlying ideas, which we take the time to describe in an elementary way, come from tropical geometry. We thus reduce a hard algebraic problem to high-precision linear optimization, proving new upper and lower complexity estimates along the way.Comment: 15 pages, 9 figures. Submitted to a conference proceeding

Parametric Polyhedra with at least kk Lattice Points: Their Semigroup Structure and the k-Frobenius Problem

Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup \mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\} can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x: Ax=b, x\geq0\}$. Such families of parametric polyhedra appear in many areas of combinatorics, convex geometry, algebra and number theory. The key themes of this paper are: (1) A structure theory that characterizes precisely the subset \mbox{ Sg}_{\geq k}(A) of all vectors b \in \mbox{ Sg}(A) such that $P_A(b) \cap {\mathbb Z}^n$ has at least $k$ solutions. We demonstrate that this set is finitely generated, it is a union of translated copies of a semigroup which can be computed explicitly via Hilbert bases computations. Related results can be derived for those right-hand-side vectors $b$ for which $P_A(b) \cap {\mathbb Z}^n$ has exactly $k$ solutions or fewer than $k$ solutions. (2) A computational complexity theory. We show that, when $n$, $k$ are fixed natural numbers, one can compute in polynomial time an encoding of \mbox{ Sg}_{\geq k}(A) as a multivariate generating function, using a short sum of rational functions. As a consequence, one can identify all right-hand-side vectors of bounded norm that have at least $k$ solutions. (3) Applications and computation for the $k$-Frobenius numbers. Using Generating functions we prove that for fixed $n,k$ the $k$-Frobenius number can be computed in polynomial time. This generalizes a well-known result for $k=1$ by R. Kannan. Using some adaptation of dynamic programming we show some practical computations of $k$-Frobenius numbers and their relatives