CENTRALLY SYMMETRIC POLYTOPES WITH MANY FACES Alexander Barvinok, Seung Jin Lee, and Isabella Novik November 2011 Abstract. We present explicit constructions of centrally symmetric polytopes with many faces: (1) we cons

Source URL: www.math.lsa.umich.edu

• Geometry
• Mathematics
• Space
• Polytopes
• Polyhedral combinatorics
• Elementary geometry
• Neighborly polytope
• Cyclic polytope
• Face
• Cross-polytope
• Edge
• Ehrhart polynomial

POLYNOMIAL FUNCTIONS ON UPPER TRIANGULAR MATRIX ALGEBRAS SOPHIE FRISCH Abstract. There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in th

Source URL: blah.math.tu-graz.ac.at

Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor Thomas Dueholm Hansen1,2 Peter Bro Miltersen1 Uri Zwick2 1

Source URL: cs.au.dk

An explicit formula for the A-polynomial of twist knots Daniel V. Mathews March 9, 2014 Abstract We extend Hoste–Shanahan’s calculations for the A-polynomial of twist knots, to give an explicit formula.

Source URL: www.danielmathews.info

• Mathematical analysis
• Mathematics
• Orthogonal polynomials
• Polynomials
• Binomial coefficient
• Combinatorics
• Knot theory
• Special functions
• Chebyshev polynomials
• Partial fractions in complex analysis

The Jones Knot Polynomial Theorem

Source URL: www.theoremoftheday.org

Machine Learning, 49, 209–232, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands.  Near-Optimal Reinforcement Learning in Polynomial Time

Source URL: www.cis.upenn.edu

Definability of Combinatorial Functions and Their Linear Recurrence Relations Extended Abstract T. Kotek ⋆

Source URL: www.cs.technion.ac.il

• Mathematics
• Algebra
• Abstract algebra
• Recurrence relation
• Theory of computation
• Rational function
• Generating function
• Factorial
• Exponentiation
• Polynomial
• KochenSpecker theorem

Integer Optimization Toolbox Pooya Ronagh∗ August 13, 2013 In what follows, we explain how the Integer Optimization Toolbox approaches the problem of minimization of a (low degree) polynomial over an integer lattice. I

Source URL: www.1qbit.com

THEOREM OF THE DAY Sendov’s Conjecture (a Theorem Under Construction!) Let f (z) be a polynomial of degree n ≥ 2, all of whose zeros lie in the closed unit disk. Then for any zero z0 of f (z), the closed unit disk wi

Source URL: theoremoftheday.org

FLINT: Fast Library for Number Theory William B. Hart and David Harvey December 25, 2008 Contents 1 Introduction

Source URL: www.flintlib.org

• Polynomials
• Algebra
• Computer algebra
• Determinants
• Resultant
• Variable
• Homogeneous polynomial
• Binomial coefficient
• Factorization