2 citations · 3 across the 7 of their papers we have counts for
10 papers
Restriction coefficients for partitions with at most three columns
Mitchell Lee
Let , and let and be partitions such that . We present a combinatorial interpretation of the plethysm coefficient .…
Central limits from generating functions
Mitchell Lee
Let be a sequence of -valued random variables. Suppose that the generating function \[f(x, z) = \sum_{n = 0}^\infty φ_{Y_n}(x) z^n,\] where is the…
Hermite--Hadamard inequalities for nearly-spherical domains
Noah Kravitz, Mitchell Lee
A conjecture of Pasteczka, generalizing the classical Hermite--Hadamard Inequality, states that if is a compact convex domain such that and $\partial…
The Frobenius transform of a symmetric function
Mitchell Lee
We define an abelian group homomorphism , which we call the Frobenius transform, from the ring of symmetric functions to the ring of the symmetric power series. The ma…
Equivariant Degenerations of Plane Curve Orbits
Mitchell Lee, Anand Patel, Dennis Tseng
In a series of papers, Aluffi and Faber computed the degree of the orbit closure of an arbitrary plane curve. We attempt to generalize this to the equivariant setting by stu…
Constraining Strong c-Wilf Equivalence Using Cluster Poset Asymptotics
Mitchell Lee, Ashwin Sah
Let and be permutations. An occurrence of in as a consecutive pattern is a subsequence of wit…
Orbits in and equivariant quantum cohomology
Mitchell Lee, Anand Patel, Hunter Spink +1
We compute the -equivariant Chow class of the -orbit closure of any point in terms of the rank polytope of the matroid…
Sets with few differences in abelian groups
Mitchell Lee
Let be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset , where has fixed…
The space "just above" BQP
Scott Aaronson, Adam Bouland, Joseph Fitzsimons +1
We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to a…
Graham's Number is Less Than 2^^^6
Mikhail Lavrov, Mitchell Lee, John Mackey
In [5] Graham and Rothschild consider a geometric Ramsey problem: finding the least n such that if all edges of the complete graph on the points {+1,-1}^n are 2-colored, there exis…