Georgia Institute of Technology College of Sciences

We will introduce, through examples, the philosophy of Delignethat "in characteristic zero, a deformation problem is controlled by adifferential graded (or "dg-") Lie algebra." Focusing on the deformationtheory of representations of a group, we will give an extension of thisphilosophy to positive characteristic. This will be justified by thepresence of a dg-algebra controlling the deformations, and the fact thatthe cohomology of the dg-algebra has an A-infinity algebra structureexplicitly presenting the deformation problem. This structure can bethought of as "higher cup products" on group cohomology, extending theusual cup product and often computable as Massey products. We will writedown concrete, representation-theoretic questions that are answered bythese higher cup products. To conclude, we will show that the cup productstructure on Galois cohomology, which is the subject of e.g. the motivicBloch-Kato conjecture and its proofs, is enriched by these higher cupproducts, and that this enrichment reflects properties of the Galois group.Familiarity with dg-algebras and infinity-algebras will not be presumed.

In this talk, we discuss a very efficient algorithm for projecting a point onto a polyhedron. This algorithm solves the projeciton problem through its dual and fully exploits the sparsity. The SpaRSA (Sparse Reconstruction by Separable Approximation) is used to approximately identify active constraints in the polyhedron, and the Dual Active Set Algorithm (DASA) is used to compute a high precision solution. Some interesting convergence properties and very promising numerical results compared with the state-of-the-art software IPOPT and CPLEX will be discussed in this talk.

I will find upper and lower bounds for the mixing time as well as the likelihood order after sufficient time of the following involution walk on the symmetric group. Consider 2n cards on a table. Pair up all the cards. Ignore each pairing with probability $p \geq 1/2$. For any pair not being ignored, pick up the two cards and switch their spots. This walk is generated by involutions with binomially distributed two cycles. The upper bound of $\log_{2/(1+p)}(n)$ will result from spectral analysis using a combination of a series of monotonicity relations on the eigenvalues of the walk and the character polynomial for the representations of the symmetric group. A lower bound of $\log_{1/p}$ differs by a constant factor from the upper bound. This walk was introduced to study a conjecture about a random walk on the unitary group from the information theory of black holes.