Barvinok

Results: 35



#Item
21COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015

COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015

Add to Reading List

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

Language: English - Date: 2015-08-02 17:12:20
22NEIGHBORLINESS OF THE SYMMETRIC MOMENT CURVE Alexander Barvinok, Seung Jin Lee, and Isabella Novik November 2011 Abstract. We consider the convex hull Bk of the symmetric moment curve Uk (t) =

NEIGHBORLINESS OF THE SYMMETRIC MOMENT CURVE Alexander Barvinok, Seung Jin Lee, and Isabella Novik November 2011 Abstract. We consider the convex hull Bk of the symmetric moment curve Uk (t) =

Add to Reading List

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

Language: English - Date: 2011-11-16 09:09:52
23COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

Add to Reading List

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

Language: English - Date: 2011-09-04 21:59:49
24AN APPROXIMATION ALGORITHM FOR COUNTING CONTINGENCY TABLES Alexander Barvinok, Zur Luria, Alex Samorodnitsky, and Alexander Yong March 2008

AN APPROXIMATION ALGORITHM FOR COUNTING CONTINGENCY TABLES Alexander Barvinok, Zur Luria, Alex Samorodnitsky, and Alexander Yong March 2008

Add to Reading List

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

Language: English - Date: 2008-03-27 10:39:59
25CENTRALLY 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

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

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2011-11-18 00:01:02
    26COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highest

    COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highest

    Add to Reading List

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

    Language: English - Date: 2005-04-28 13:33:02
    27CONCENTRATION OF THE MIXED DISCRIMINANT OF WELL-CONDITIONED MATRICES Alexander Barvinok Abstract. We call an n-tuple Q1 , . . . , Qn of positive definite n × n real matrices α-conditioned for some α ≥ 1 if for the c

    CONCENTRATION OF THE MIXED DISCRIMINANT OF WELL-CONDITIONED MATRICES Alexander Barvinok Abstract. We call an n-tuple Q1 , . . . , Qn of positive definite n × n real matrices α-conditioned for some α ≥ 1 if for the c

    Add to Reading List

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

    Language: English - Date: 2015-11-17 15:29:13
    28INTEGRATION AND OPTIMIZATION OF MULTIVARIATE POLYNOMIALS BY RESTRICTION ONTO A RANDOM SUBSPACE Alexander Barvinok February 2005

    INTEGRATION AND OPTIMIZATION OF MULTIVARIATE POLYNOMIALS BY RESTRICTION ONTO A RANDOM SUBSPACE Alexander Barvinok February 2005

    Add to Reading List

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

    Language: English - Date: 2005-02-14 17:39:57
    29THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES Alexander Barvinok and Ellen Veomett October 2006 Abstract. We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X f

    THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES Alexander Barvinok and Ellen Veomett October 2006 Abstract. We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X f

    Add to Reading List

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

    Language: English - Date: 2006-10-10 09:53:29
    30MAXIMUM ENTROPY GAUSSIAN APPROXIMATIONS FOR THE NUMBER OF INTEGER POINTS AND VOLUMES OF POLYTOPES Alexander Barvinok and J.A. Hartigan January 2010

    MAXIMUM ENTROPY GAUSSIAN APPROXIMATIONS FOR THE NUMBER OF INTEGER POINTS AND VOLUMES OF POLYTOPES Alexander Barvinok and J.A. Hartigan January 2010

    Add to Reading List

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

    Language: English - Date: 2010-01-19 13:40:01