SearcharxivSearch

arXiv subjects

Christopher Woodward

Publications and source records attributed to Christopher Woodward.

3 recordsLinked to original sources

Characterization of Frequent Online Shoppers using Statistical Learning with Sparsity

Developing shopping experiences that delight the customer requires businesses to understand customer taste. This work reports a method to learn the shopping preferences of frequent shoppers to an online gift store by combining ideas from retail analytics and statistical learning with sparsity. Shopping activity is represented as a bipartite graph. This graph is refined by applying sparsity-based statistical learning methods. These methods are interpretable and reveal insights about customers' preferences as well as products driving revenue to the store.

cs.LG

Floer homology on the extended moduli space

Starting from a Heegaard splitting of a three-manifold, we use Lagrangian Floer homology to construct a three-manifold invariant, in the form of a relatively Z/8-graded abelian group. Our motivation is to have a well-defined symplectic side of the Atiyah-Floer Conjecture, for arbitrary three-manifolds. The symplectic manifold used in the construction is the extended moduli space of flat SU(2)-connections on the Heegaard surface. An open subset of this moduli space carries a symplectic form, and each of the two handlebodies in the decomposition gives rise to a Lagrangian inside the open set. In order to define their Floer homology, we compactify the open subset by symplectic cutting; the resulting manifold is only semipositive, but we show that one can still develop a version of Floer homology in this setting.

math.SG

The honeycomb model of GL(n) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone

The set of possible spectra (λ,μ,ν) of zero-sum triples of Hermitian matrices forms a polyhedral cone. We give a complete determination of its facets, finishing a long story with recent highlights by [Helmke-Rosenthal, Klyachko, Belkale]. We introduce_puzzles_, which are new combinatorial gadgets to compute Grassmannian Schubert calculus, and will probably be the main point of interest for many readers. As the proofs indicate, the Hermitian sum problem is very naturally studied using puzzles directly, and their connection to Schubert calculus is quite incidental to our approach. In particular, we get new, puzzle-theoretic, proofs of the results in [H,Kly,HR,Be]. Along the way we give a characterization of ``rigid'' puzzles, which we use to prove a conjecture of W. Fulton: ``if for a triple of dominant weights λ,μ,νof GL(n,C) the irreducible representation V_νappears exactly once in V_λtensor V_μ, then for all N\in \naturals, V_{Nλ} appears exactly once in V_{Nλ} tensor V_{Nμ}.''

math.CO