4,854 research outputs found
Plethysm and lattice point counting
We apply lattice point counting methods to compute the multiplicities in the
plethysm of . 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
of 3,4, or 5 we obtain an explicit formula in and for the
multiplicity of in .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
Discrete piecewise linear functions
The concept of permutograph is introduced and properties of integral
functions on permutographs are established. The central result characterizes
the class of integral functions that are representable as lattice polynomials.
This result is used to establish lattice polynomial representations of
piecewise linear functions on convex domains and continuous selectors on linear
orders.Comment: 17 pages, 4 figures, Fig.2.1 label correcte
Transitive factorizations of permutations and geometry
We give an account of our work on transitive factorizations of permutations.
The work has had impact upon other areas of mathematics such as the enumeration
of graph embeddings, random matrices, branched covers, and the moduli spaces of
curves. Aspects of these seemingly unrelated areas are seen to be related in a
unifying view from the perspective of algebraic combinatorics. At several
points this work has intertwined with Richard Stanley's in significant ways.Comment: 12 pages, dedicated to Richard Stanley on the occasion of his 70th
birthda
- …