Discrete Geometry and Algebraic Combinatorics: Ams Special Session Discrete Geometry and Algebraic Combinatorics January 11, 2013 San Diego, Ca

The 10 papers cover distance geometry with applications in combinatorial optimization, and algebraic combinatorics including applications in coding theory. The topics are plank theorems via successive inradii, the state of the art in minimal fillings of finite metric spaces, the combinatorics and geometry of transporter polytopes, a tree sperner lemma, cliques and cycles in distance graphs and graphs of diameters, new bounds for equi-angular lines, formal duality and generalizations of the Poisson summation formula, constructions of semi-bent functions from bent functions, multiplicity codes, and multivariate positive definite functions on spheres. Annotation ©2014 Ringgold, Inc., Portland, OR (protoview.com)