2,749 research outputs found

    Intersecting Families of Permutations

    Full text link
    A set of permutations I⊂SnI \subset S_n is said to be {\em k-intersecting} if any two permutations in II agree on at least kk points. We show that for any k∈Nk \in \mathbb{N}, if nn is sufficiently large depending on kk, then the largest kk-intersecting subsets of SnS_n are cosets of stabilizers of kk points, proving a conjecture of Deza and Frankl. We also prove a similar result concerning kk-cross-intersecting subsets. Our proofs are based on eigenvalue techniques and the representation theory of the symmetric group.Comment: 'Erratum' section added. Yuval Filmus has recently pointed out that the 'Generalised Birkhoff theorem', Theorem 29, is false for k > 1, and so is Theorem 27 for k > 1. An alternative proof of the equality part of the Deza-Frankl conjecture is referenced, bypassing the need for Theorems 27 and 2

    Five-brane Calibrations and Fuzzy Funnels

    Full text link
    We present a generalisation of the Basu-Harvey equation that describes membranes ending on intersecting five-brane configurations corresponding to various calibrated geometries.Comment: 20 pages, latex, v2: typos fixed and refs adde

    Set Systems Containing Many Maximal Chains

    Full text link
    The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of (n+1)(n+1)-element chains in the power set P({1,2,…,n})\mathcal{P}(\{1,2,\dots,n\})? We will show that for each fixed α>0\alpha>0 there is a family of α2n\alpha 2^n sets containing (α+o(1))n!(\alpha+o(1))n! such chains, and that this is asymptotically best possible. For smaller set systems we are unable to answer the question. We conjecture that a `tower of cubes' construction is extremal. We finish by mentioning briefly a connection to an extremal problem on posets and a variant of our question for the grid graph.Comment: 5 page

    Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph

    Full text link
    The Bubble-sort graph BSn, n⩾2BS_n,\,n\geqslant 2, is a Cayley graph over the symmetric group SymnSym_n generated by transpositions from the set {(12),(23),…,(n−1n)}\{(1 2), (2 3),\ldots, (n-1 n)\}. It is a bipartite graph containing all even cycles of length ℓ\ell, where 4⩽ℓ⩽n!4\leqslant \ell\leqslant n!. We give an explicit combinatorial characterization of all its 44- and 66-cycles. Based on this characterization, we define generalized prisms in BSn, n⩾5BS_n,\,n\geqslant 5, and present a new approach to construct a Hamiltonian cycle based on these generalized prisms.Comment: 13 pages, 7 figure

    A Combinatorial Interpretation of the Free Fermion Condition of the Six-Vertex Model

    Full text link
    The free fermion condition of the six-vertex model provides a 5 parameter sub-manifold on which the Bethe Ansatz equations for the wavenumbers that enter into the eigenfunctions of the transfer matrices of the model decouple, hence allowing explicit solutions. Such conditions arose originally in early field-theoretic S-matrix approaches. Here we provide a combinatorial explanation for the condition in terms of a generalised Gessel-Viennot involution. By doing so we extend the use of the Gessel-Viennot theorem, originally devised for non-intersecting walks only, to a special weighted type of \emph{intersecting} walk, and hence express the partition function of NN such walks starting and finishing at fixed endpoints in terms of the single walk partition functions

    Cluster Adjacency for m=2 Yangian Invariants

    Get PDF
    11 pages, 3 figuresWe classify the rational Yangian invariants of the m=2m=2 toy model of N=4\mathcal{N}=4 Yang-Mills theory in terms of generalised triangles inside the amplituhedron An,k(2)\mathcal{A}_{n,k}^{(2)}. We enumerate and provide an explicit formula for all invariants for any number of particles nn and any helicity degree kk. Each invariant manifestly satisfies cluster adjacency with respect to the Gr(2,n)Gr(2,n) cluster algebra.Peer reviewe

    Inherited Twistor-Space Structure of Gravity Loop Amplitudes

    Full text link
    At tree-level, gravity amplitudes are obtainable directly from gauge theory amplitudes via the Kawai, Lewellen and Tye closed-open string relations. We explain how the unitarity method allows us to use these relations to obtain coefficients of box integrals appearing in one-loop N=8 supergravity amplitudes from the recent computation of the coefficients for N=4 super-Yang-Mills non-maximally-helicity-violating amplitudes. We argue from factorisation that these box coefficients determine the one-loop N=8 supergravity amplitudes, although this remains to be proven. We also show that twistor-space properties of the N=8 supergravity amplitudes are inherited from the corresponding properties of N=4 super-Yang-Mills theory. We give a number of examples illustrating these ideas.Comment: 32 pages, minor typos correcte
    • …
    corecore