64,464 research outputs found

    Plethysm and lattice point counting

    Full text link
    We apply lattice point counting methods to compute the multiplicities in the plethysm of GL(n)GL(n). Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old conjecture of Howe on the leading term of plethysm. For any partition μ\mu of 3,4, or 5 we obtain an explicit formula in λ\lambda and kk for the multiplicity of SλS^\lambda in Sμ(Sk)S^\mu(S^k).Comment: 25 pages including appendix, 1 figure, computational results and code available at http://thomas-kahle.de/plethysm.html, v2: various improvements, v3: final version appeared in JFoC

    Plethysm and fast matrix multiplication

    Get PDF
    Motivated by the symmetric version of matrix multiplication we study the plethysm Sk(sln)S^k(\mathfrak{sl}_n) of the adjoint representation sln\mathfrak{sl}_n of the Lie group SLnSL_n. In particular, we describe the decomposition of this representation into irreducible components for k=3k=3, and find highest weight vectors for all irreducible components. Relations to fast matrix multiplication, in particular the Coppersmith-Winograd tensor are presented.Comment: 5 page

    Local description of phylogenetic group-based models

    Get PDF
    Motivated by phylogenetics, our aim is to obtain a system of equations that define a phylogenetic variety on an open set containing the biologically meaningful points. In this paper we consider phylogenetic varieties defined via group-based models. For any finite abelian group GG, we provide an explicit construction of codimXcodim X phylogenetic invariants (polynomial equations) of degree at most G|G| that define the variety XX on a Zariski open set UU. The set UU contains all biologically meaningful points when GG is the group of the Kimura 3-parameter model. In particular, our main result confirms a conjecture by the third author and, on the set UU, a couple of conjectures by Bernd Sturmfels and Seth Sullivant.Comment: 22 pages, 7 figure

    Scalar and Vectorial mu-calculus with Atoms

    Get PDF
    We study an extension of modal μ\mu-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable. We also show expressive limitations of atom-enriched μ\mu-calculi, and explain how their expressive power depends on the structure of atoms used, and on the choice between basic or vectorial syntax

    Boundary Harnack inequality for Markov processes with jumps

    Full text link
    We prove a boundary Harnack inequality for jump-type Markov processes on metric measure state spaces, under comparability estimates of the jump kernel and Urysohn-type property of the domain of the generator of the process. The result holds for positive harmonic functions in arbitrary open sets. It applies, e.g., to many subordinate Brownian motions, L\'evy processes with and without continuous part, stable-like and censored stable processes, jump processes on fractals, and rather general Schr\"odinger, drift and jump perturbations of such processes.Comment: 37 pages, 1 figure, minor editorial changes, paper accepted in Transactions of AM

    Large-N reduction with adjoint Wilson fermions

    Full text link
    We analyze the large-N behavior of SU(N) lattice gauge theories with adjoint fermions by studying volume-reduced models, as pioneered by Eguchi and Kawai. We perform simulations on a single-site lattice for Nf = 1 and Nf = 2 Wilson Dirac fermions with values of N up to 53. We show for both values of Nf that in the large-N limit there is a finite region, containing both light and heavy fermions, of unbroken center symmetry where the theory exhibits volume independence. Using large-N reduction we attempt to calculate physical quantities such as the string tension and meson masses.Comment: 7 pages, 4 figures, proceedings of the XXX International Symposium on Lattice Field Theory, Cairns, Australi

    Obstructions to combinatorial formulas for plethysm

    Full text link
    Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of S3(Sk)S^3(S^k) and Sk(S3)S^k(S^3), that these need not be counting functions of inhomogeneous polytopes of dimension equal to the degree of the quasi-polynomial. It follows that these functions are not, in general, counting functions of lattice points in any scaled convex bodies, even when restricted to single rays. Our results also apply to special rectangular Kronecker coefficients.Comment: 7 pages; v2: Improved version with further reaching counterexamples; v3: final version as in Electronic Journal of Combinatoric
    corecore