Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"University of Michigan" +contributor:("Barvinok, Alexandre I.")`

.
Showing records 1 – 10 of
10 total matches.

▼ Search Limiters

University of Michigan

1. Shapiro, Austin Warren. Independence Models for Integer Points of Polytopes.

Degree: PhD, Mathematics, 2011, University of Michigan

URL: http://hdl.handle.net/2027.42/86295

► The integer points of a high-dimensional polytope P are generally difficult to count or sample uniformly. We consider a class of low-complexity random models for…
(more)

Subjects/Keywords: Polytope; Integer Point; Lattice Point; Littlewood-Offord; Maximum Entropy; Contingency Table; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Shapiro, A. W. (2011). Independence Models for Integer Points of Polytopes. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/86295

Chicago Manual of Style (16^{th} Edition):

Shapiro, Austin Warren. “Independence Models for Integer Points of Polytopes.” 2011. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/86295.

MLA Handbook (7^{th} Edition):

Shapiro, Austin Warren. “Independence Models for Integer Points of Polytopes.” 2011. Web. 04 Dec 2020.

Vancouver:

Shapiro AW. Independence Models for Integer Points of Polytopes. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/86295.

Council of Science Editors:

Shapiro AW. Independence Models for Integer Points of Polytopes. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/86295

University of Michigan

2. Mallik, Atul. Topics on Threshold Estimation, Multistage Methods and Random Fields.

Degree: PhD, Statistics, 2013, University of Michigan

URL: http://hdl.handle.net/2027.42/102290

► We consider the problem of identifying the threshold at which a one-dimensional regression function leaves its baseline value. This is motivated by applications from dose-response…
(more)

Subjects/Keywords: Threshold Estimation; Multistage Procedures; Limit Theorems for Random Fields; Empirical Processes; Baseline Set Estimation; M-estimation; Statistics and Numeric Data; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Mallik, A. (2013). Topics on Threshold Estimation, Multistage Methods and Random Fields. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/102290

Chicago Manual of Style (16^{th} Edition):

Mallik, Atul. “Topics on Threshold Estimation, Multistage Methods and Random Fields.” 2013. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/102290.

MLA Handbook (7^{th} Edition):

Mallik, Atul. “Topics on Threshold Estimation, Multistage Methods and Random Fields.” 2013. Web. 04 Dec 2020.

Vancouver:

Mallik A. Topics on Threshold Estimation, Multistage Methods and Random Fields. [Internet] [Doctoral dissertation]. University of Michigan; 2013. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/102290.

Council of Science Editors:

Mallik A. Topics on Threshold Estimation, Multistage Methods and Random Fields. [Doctoral Dissertation]. University of Michigan; 2013. Available from: http://hdl.handle.net/2027.42/102290

University of Michigan

3. Stephen, Tamon Muri. The distribution of values in combinatorial optimization problems.

Degree: PhD, Pure Sciences, 2002, University of Michigan

URL: http://hdl.handle.net/2027.42/132935

► We study the distribution of objective function values of a combinatorial optimization problem defined on a group, focusing on the Quadratic Assignment Problem (QAP), and…
(more)

Subjects/Keywords: Combinatorial Optimization; Distribution; Problems; Quadratic Assignment Problem; Randomized Algorithms; Representation Theory; Traveling Salesman Problem; Values

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Stephen, T. M. (2002). The distribution of values in combinatorial optimization problems. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/132935

Chicago Manual of Style (16^{th} Edition):

Stephen, Tamon Muri. “The distribution of values in combinatorial optimization problems.” 2002. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/132935.

MLA Handbook (7^{th} Edition):

Stephen, Tamon Muri. “The distribution of values in combinatorial optimization problems.” 2002. Web. 04 Dec 2020.

Vancouver:

Stephen TM. The distribution of values in combinatorial optimization problems. [Internet] [Doctoral dissertation]. University of Michigan; 2002. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/132935.

Council of Science Editors:

Stephen TM. The distribution of values in combinatorial optimization problems. [Doctoral Dissertation]. University of Michigan; 2002. Available from: http://hdl.handle.net/2027.42/132935

4. Snipes, Marie Ann. Flat Forms in Banach Spaces.

Degree: PhD, Mathematics, 2009, University of Michigan

URL: http://hdl.handle.net/2027.42/63769

► We define a flat partial differential form in a Banach space and show that the space of these forms is isometrically the dual space of…
(more)

Subjects/Keywords: Flat Differential Form; Analysis in Banach Spaces; Geometric Measure Theory; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Snipes, M. A. (2009). Flat Forms in Banach Spaces. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/63769

Chicago Manual of Style (16^{th} Edition):

Snipes, Marie Ann. “Flat Forms in Banach Spaces.” 2009. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/63769.

MLA Handbook (7^{th} Edition):

Snipes, Marie Ann. “Flat Forms in Banach Spaces.” 2009. Web. 04 Dec 2020.

Vancouver:

Snipes MA. Flat Forms in Banach Spaces. [Internet] [Doctoral dissertation]. University of Michigan; 2009. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/63769.

Council of Science Editors:

Snipes MA. Flat Forms in Banach Spaces. [Doctoral Dissertation]. University of Michigan; 2009. Available from: http://hdl.handle.net/2027.42/63769

5. Chen, Elizabeth R. A Picturebook of Tetrahedral Packings.

Degree: PhD, Mathematics, 2010, University of Michigan

URL: http://hdl.handle.net/2027.42/75860

► We explore many different packings of regular tetrahedra, with various clusters & lattices & symmetry groups. We construct a dense packing of regular tetrahedra, with…
(more)

Subjects/Keywords: Crystallography; Lattice; Packing; Tetrahedra; Regular Solid; Hilbert Problem; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chen, E. R. (2010). A Picturebook of Tetrahedral Packings. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/75860

Chicago Manual of Style (16^{th} Edition):

Chen, Elizabeth R. “A Picturebook of Tetrahedral Packings.” 2010. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/75860.

MLA Handbook (7^{th} Edition):

Chen, Elizabeth R. “A Picturebook of Tetrahedral Packings.” 2010. Web. 04 Dec 2020.

Vancouver:

Chen ER. A Picturebook of Tetrahedral Packings. [Internet] [Doctoral dissertation]. University of Michigan; 2010. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/75860.

Council of Science Editors:

Chen ER. A Picturebook of Tetrahedral Packings. [Doctoral Dissertation]. University of Michigan; 2010. Available from: http://hdl.handle.net/2027.42/75860

6. Lee, Seung Jin. Centrally Symmetric Polytopes with Many Faces.

Degree: PhD, Mathematics, 2013, University of Michigan

URL: http://hdl.handle.net/2027.42/99877

► We study the convex hull of the symmetric moment curve U_{k}(t)=(cos t, sin t, cos 3t, sin 3t, ldots, cos (2k-1)t, sin (2k-1)t) in {ℝ}^{2k}…
(more)

Subjects/Keywords: Polytopes; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lee, S. J. (2013). Centrally Symmetric Polytopes with Many Faces. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/99877

Chicago Manual of Style (16^{th} Edition):

Lee, Seung Jin. “Centrally Symmetric Polytopes with Many Faces.” 2013. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/99877.

MLA Handbook (7^{th} Edition):

Lee, Seung Jin. “Centrally Symmetric Polytopes with Many Faces.” 2013. Web. 04 Dec 2020.

Vancouver:

Lee SJ. Centrally Symmetric Polytopes with Many Faces. [Internet] [Doctoral dissertation]. University of Michigan; 2013. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/99877.

Council of Science Editors:

Lee SJ. Centrally Symmetric Polytopes with Many Faces. [Doctoral Dissertation]. University of Michigan; 2013. Available from: http://hdl.handle.net/2027.42/99877

7. Altman, Harry J. Integer Complexity, Addition Chains, and Well-Ordering.

Degree: PhD, Mathematics, 2014, University of Michigan

URL: http://hdl.handle.net/2027.42/108986

► In this dissertation we consider two notions of the "complexity" of a natural number, one being addition chain length, the other known as "integer complexity".…
(more)

Subjects/Keywords: Integer Complexity; Addition Chains; Well-ordering; Number Theory; Computational Complexity; Algorithms; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Altman, H. J. (2014). Integer Complexity, Addition Chains, and Well-Ordering. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/108986

Chicago Manual of Style (16^{th} Edition):

Altman, Harry J. “Integer Complexity, Addition Chains, and Well-Ordering.” 2014. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/108986.

MLA Handbook (7^{th} Edition):

Altman, Harry J. “Integer Complexity, Addition Chains, and Well-Ordering.” 2014. Web. 04 Dec 2020.

Vancouver:

Altman HJ. Integer Complexity, Addition Chains, and Well-Ordering. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/108986.

Council of Science Editors:

Altman HJ. Integer Complexity, Addition Chains, and Well-Ordering. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/108986

8. Benson-Putnins, David T. Volumes and Integer Points of Multi-Index Transportation Polytopes.

Degree: PhD, Mathematics, 2015, University of Michigan

URL: http://hdl.handle.net/2027.42/111456

► Counting the integer points of transportation polytopes has important applications in statistics for tests of statistical significance, as well as in several applications in combinatorics.…
(more)

Subjects/Keywords: combinatorics; integer points; transportation polytope; Fourier analysis; Asymptotic counting; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Benson-Putnins, D. T. (2015). Volumes and Integer Points of Multi-Index Transportation Polytopes. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/111456

Chicago Manual of Style (16^{th} Edition):

Benson-Putnins, David T. “Volumes and Integer Points of Multi-Index Transportation Polytopes.” 2015. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/111456.

MLA Handbook (7^{th} Edition):

Benson-Putnins, David T. “Volumes and Integer Points of Multi-Index Transportation Polytopes.” 2015. Web. 04 Dec 2020.

Vancouver:

Benson-Putnins DT. Volumes and Integer Points of Multi-Index Transportation Polytopes. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/111456.

Council of Science Editors:

Benson-Putnins DT. Volumes and Integer Points of Multi-Index Transportation Polytopes. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/111456

University of Michigan

9. Voemett, Ellen R. The computational complexity of convex bodies.

Degree: PhD, Pure Sciences, 2007, University of Michigan

URL: http://hdl.handle.net/2027.42/126843

► For a convex body B, the membership question is the following: given a point x, is x in B? In this dissertation, we study the…
(more)

Subjects/Keywords: Computational Complexity; Convex Bodies; Membership

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Voemett, E. R. (2007). The computational complexity of convex bodies. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/126843

Chicago Manual of Style (16^{th} Edition):

Voemett, Ellen R. “The computational complexity of convex bodies.” 2007. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/126843.

MLA Handbook (7^{th} Edition):

Voemett, Ellen R. “The computational complexity of convex bodies.” 2007. Web. 04 Dec 2020.

Vancouver:

Voemett ER. The computational complexity of convex bodies. [Internet] [Doctoral dissertation]. University of Michigan; 2007. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/126843.

Council of Science Editors:

Voemett ER. The computational complexity of convex bodies. [Doctoral Dissertation]. University of Michigan; 2007. Available from: http://hdl.handle.net/2027.42/126843

University of Michigan

10. Gong, Jasun. Derivations on Metric Measure Spaces.

Degree: PhD, Mathematics, 2008, University of Michigan

URL: http://hdl.handle.net/2027.42/60807

► In this thesis we study derivations on metric spaces with a prescribed measure. Such objects share similar properties as vector fields on smooth manifolds, such…
(more)

Subjects/Keywords: Derivation; Metric; Measure; Lipschitz; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gong, J. (2008). Derivations on Metric Measure Spaces. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/60807

Chicago Manual of Style (16^{th} Edition):

Gong, Jasun. “Derivations on Metric Measure Spaces.” 2008. Doctoral Dissertation, University of Michigan. Accessed December 04, 2020. http://hdl.handle.net/2027.42/60807.

MLA Handbook (7^{th} Edition):

Gong, Jasun. “Derivations on Metric Measure Spaces.” 2008. Web. 04 Dec 2020.

Vancouver:

Gong J. Derivations on Metric Measure Spaces. [Internet] [Doctoral dissertation]. University of Michigan; 2008. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2027.42/60807.

Council of Science Editors:

Gong J. Derivations on Metric Measure Spaces. [Doctoral Dissertation]. University of Michigan; 2008. Available from: http://hdl.handle.net/2027.42/60807