NSTL国家科技图书文献中心

1. Every Generating Polytope is Strongly Monotypic NSTL国家科技图书文献中心

Bui, Vuong - 《Discrete & computational geometry》 - 2025,73(1) - 49～61 - 共13页

摘要：, Schneider, and Shephard that every polytope* with the* | monotypy and the generating property for polytopes* are* | strongly monotypic polytopes* is also given.* | We prove an old conjecture of McMullen | generating property is strongly monotypic. The other

关键词： Polytope | Monotypic | Minkowski summand | Strongly monotypic | Generating property

2. Integer points in the degree-sequence polytope NSTL国家科技图书文献中心

Bach, Eleonore | Eisenbrand, Friedric...... - 《Discrete optimization》 - 2025,55 - 共10页

摘要： hyperedges containing . The degree-sequence polytope* od is* | the degree sequence polytope* are degree sequences* | An integer vector is an element of Z is a | degree sequence if there exists a hypergraph with | vertices {1, ... , } such that each is the number of

关键词： Integer programming | Hypergraphic degree sequences | Degree-sequence polytope

3. Ex ante and ex post envy-freeness on polytope resources NSTL国家科技图书文献中心

Sano, Yoshio | Zhan, Ping - 《Japan journal of industrial and applied mathematics》 - 2025,42(1) - 177～196 - 共20页

摘要： varying in a polytope. When goods are indivisible, it is | when the resource polytope* is a polymatroid through* | Allocating goods among agents under ordinal | preferences is a well-studied problem. In this study, each | type of good may have multi-copies with quotas

关键词： Ordinal preferences | Stochastic dominance | Approximate envy-freeness | Best of both worlds | Independent flows

4. Deterministic Approximation for the Volume of the Truncated Fractional Matching Polytope NSTL国家科技图书文献中心

Heng Guo | Vishvajeet N - 《16th Innovations in Theoretical Computer Science Conference,Part 2 of 3》 - Innovations in Theoretical Computer Science Conference - 2025, - 共14页

摘要： fractional matching polytope* for graphs of maximum degree Δ* | fractional matching polytope* for hypergraphs of maximum* | truncated independence polytope* (when Δ = 2). Our approach* | We give a deterministic polynomial-time | approximation scheme (FPTAS) for the volume of the truncated

关键词： Deterministic volume computation | Cluster expansion | Explicit polytopes

5. Restricted Birkhoff Polytopes and Ehrhart Period Collapse NSTL国家科技图书文献中心

Alexandersson, Per | Hopkins, Sam ... - 《Discrete & computational geometry》 - 2025,73(1) - 62～78 - 共17页

摘要： Birkhoff polytope* by imposing additional inequalities* | -linear bijection to a certain Gelfand-Tsetlin polytope | We show that the polytopes* obtained from the* | , even though they are just rational polytopes* in* | that the two polytopes* have the same Ehrhart (quasi*

关键词： Ehrhart polynomial | Period collapse | Birkhoff polytope | Gelfand-Tsetlin polytope | Order and chain polytopes | RSK correspondence

6. Integration over facet-simple polytopes NSTL国家科技图书文献中心

Engel, Konrad - 《Beitrage zur Algebra und Geometrie》 - 2025,66(2) - 391～403 - 共13页

摘要： facet-simple polytopes. Here a convex polytope* is* | -simple polytope* if it is a finite union of n* | textbf{x}),textbf{dx}$$end{document} over polytopes* P* | -dimensional facet-simple convex polytopes* such that any two* | We present an elementary approach for the

关键词： Integration | Polytope | Facet-simple polytope | Rational function

7. Ehrhart Quasi-Polynomials of Almost Integral Polytopes NSTL国家科技图书文献中心

de Vries, Christophe... | Yoshinaga, Masahiko - 《Discrete & computational geometry》 - 2025,73(1) - 177～196 - 共20页

摘要：A lattice polytope* translated by a rational* | vector is called an almost integral polytope. In this | integral polytopes. We study the connection between the | shape of polytopes* and the algebraic properties of the* | polytopes are characterized by Ehrhart quasi-polynomials

关键词： Ehrhart quasi-polynomial | Rational polytope | Zonotope | GCD-property

8. Matching Polytopes, Gorensteinness, and the Integer Decomposition Property NSTL国家科技图书文献中心

Eisley, Benjamin | Matsushita, Koji ... - 《Graphs and combinatorics》 - 2025,41(3) - 共14页

摘要：The matching polytope* of a graph G is the* | matching polytopes* are Gorenstein, and then prove that* | all Gorenstein matching polytopes* possess the* | , we examine the matching polytopes* of wheel graphs* | convex hull of the indicator vectors of the matchings

关键词： Matching polytope | Gorenstein | Integer decomposition property

9. On the geometry of the Birkhoff polytope I: the operator ℓnpdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$ell ^p_n$$end{document}-norms NSTL国家科技图书文献中心

Ludovick,Bouthat | Javad,Mashreghi ... - 《Acta scientiarum mathematicarum》 - 2025,91(1/2) - 227～245 - 共19页

摘要：Abstract The geometry of the Birkhoff polytope | the Birkhoff polytope* associated with the metrics* | , i.e., the compact convex set of all n×ndocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym | } usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy

关键词： Doubly stochastic matrices | Birkhoff polytope | Chebyshev center | Chebyshev radius | 15B51 | 46B20 | 52B12

10. Light 3-faces in 3-polytopes without adjacent triangles NSTL国家科技图书文献中心

Borodin, O. V. | Ivanova, A. O. - 《Discrete mathematics》 - 2025,348(1) - 共4页

摘要： vertex v . An edge e = xy in a 3-polytope* is an ( i , j* | -vertex. We prove that every 3-polytope* with neither* | -polytopes, namely those having no adjacent 3-cycles | . Borodin (1996) proved that such 3-polytopes* have a* | Over the last decades, a lot of research has

摘要：, Schneider, and Shephard that every polytope* with the* | monotypy and the generating property for polytopes* are* | strongly monotypic polytopes* is also given.* | We prove an old conjecture of McMullen | generating property is strongly monotypic. The other

关键词： Polytope | Monotypic | Minkowski summand | Strongly monotypic | Generating property

摘要： hyperedges containing . The degree-sequence polytope* od is* | the degree sequence polytope* are degree sequences* | An integer vector is an element of Z is a | degree sequence if there exists a hypergraph with | vertices {1, ... , } such that each is the number of

关键词： Integer programming | Hypergraphic degree sequences | Degree-sequence polytope

摘要： varying in a polytope. When goods are indivisible, it is | when the resource polytope* is a polymatroid through* | Allocating goods among agents under ordinal | preferences is a well-studied problem. In this study, each | type of good may have multi-copies with quotas

关键词： Ordinal preferences | Stochastic dominance | Approximate envy-freeness | Best of both worlds | Independent flows

关键词： Deterministic volume computation | Cluster expansion | Explicit polytopes

摘要： Birkhoff polytope* by imposing additional inequalities* | -linear bijection to a certain Gelfand-Tsetlin polytope | We show that the polytopes* obtained from the* | , even though they are just rational polytopes* in* | that the two polytopes* have the same Ehrhart (quasi*

关键词： Ehrhart polynomial | Period collapse | Birkhoff polytope | Gelfand-Tsetlin polytope | Order and chain polytopes | RSK correspondence

摘要： facet-simple polytopes. Here a convex polytope* is* | -simple polytope* if it is a finite union of n* | textbf{x}),textbf{dx}$$end{document} over polytopes* P* | -dimensional facet-simple convex polytopes* such that any two* | We present an elementary approach for the

关键词： Integration | Polytope | Facet-simple polytope | Rational function

摘要：A lattice polytope* translated by a rational* | vector is called an almost integral polytope. In this | integral polytopes. We study the connection between the | shape of polytopes* and the algebraic properties of the* | polytopes are characterized by Ehrhart quasi-polynomials

关键词： Ehrhart quasi-polynomial | Rational polytope | Zonotope | GCD-property

摘要：The matching polytope* of a graph G is the* | matching polytopes* are Gorenstein, and then prove that* | all Gorenstein matching polytopes* possess the* | , we examine the matching polytopes* of wheel graphs* | convex hull of the indicator vectors of the matchings

关键词： Matching polytope | Gorenstein | Integer decomposition property

摘要：Abstract The geometry of the Birkhoff polytope | the Birkhoff polytope* associated with the metrics* | , i.e., the compact convex set of all n×ndocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym | } usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy

关键词： Doubly stochastic matrices | Birkhoff polytope | Chebyshev center | Chebyshev radius | 15B51 | 46B20 | 52B12

摘要： vertex v . An edge e = xy in a 3-polytope* is an ( i , j* | -vertex. We prove that every 3-polytope* with neither* | -polytopes, namely those having no adjacent 3-cycles | . Borodin (1996) proved that such 3-polytopes* have a* | Over the last decades, a lot of research has

关键词： Plane graph | 3-polytope | Sparse polytope | Structural property | 3-face | Weight

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：, Schneider, and Shephard that every polytope with the | monotypy and the generating property for polytopes are | strongly monotypic polytopes is also given. | We prove an old conjecture of McMullen | generating property is strongly monotypic. The other

关键词： Polytope | Monotypic | Minkowski summand | Strongly monotypic | Generating property

摘要： hyperedges containing . The degree-sequence polytope od is | the degree sequence polytope are degree sequences | An integer vector is an element of Z is a | degree sequence if there exists a hypergraph with | vertices {1, ... , } such that each is the number of

关键词： Integer programming | Hypergraphic degree sequences | Degree-sequence polytope

摘要： varying in a polytope. When goods are indivisible, it is | when the resource polytope is a polymatroid through | Allocating goods among agents under ordinal | preferences is a well-studied problem. In this study, each | type of good may have multi-copies with quotas

关键词： Ordinal preferences | Stochastic dominance | Approximate envy-freeness | Best of both worlds | Independent flows

摘要： fractional matching polytope for graphs of maximum degree Δ | fractional matching polytope for hypergraphs of maximum | truncated independence polytope (when Δ = 2). Our approach | We give a deterministic polynomial-time | approximation scheme (FPTAS) for the volume of the truncated

关键词： Deterministic volume computation | Cluster expansion | Explicit polytopes

摘要： Birkhoff polytope by imposing additional inequalities | -linear bijection to a certain Gelfand-Tsetlin polytope | We show that the polytopes obtained from the | , even though they are just rational polytopes in | that the two polytopes have the same Ehrhart (quasi

关键词： Ehrhart polynomial | Period collapse | Birkhoff polytope | Gelfand-Tsetlin polytope | Order and chain polytopes | RSK correspondence

摘要： facet-simple polytopes. Here a convex polytope is | -simple polytope if it is a finite union of n | textbf{x}),textbf{dx}$$end{document} over polytopes P | -dimensional facet-simple convex polytopes such that any two | We present an elementary approach for the

关键词： Integration | Polytope | Facet-simple polytope | Rational function

摘要：A lattice polytope translated by a rational | vector is called an almost integral polytope. In this | integral polytopes. We study the connection between the | shape of polytopes and the algebraic properties of the | polytopes are characterized by Ehrhart quasi-polynomials

关键词： Ehrhart quasi-polynomial | Rational polytope | Zonotope | GCD-property

摘要：The matching polytope of a graph G is the | matching polytopes are Gorenstein, and then prove that | all Gorenstein matching polytopes possess the | , we examine the matching polytopes of wheel graphs | convex hull of the indicator vectors of the matchings

关键词： Matching polytope | Gorenstein | Integer decomposition property

摘要：Abstract The geometry of the Birkhoff polytope | the Birkhoff polytope associated with the metrics | , i.e., the compact convex set of all n×ndocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym | } usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy

关键词： Doubly stochastic matrices | Birkhoff polytope | Chebyshev center | Chebyshev radius | 15B51 | 46B20 | 52B12

摘要： vertex v . An edge e = xy in a 3-polytope is an ( i , j | -vertex. We prove that every 3-polytope with neither | -polytopes, namely those having no adjacent 3-cycles | . Borodin (1996) proved that such 3-polytopes have a | Over the last decades, a lot of research has

关键词： Plane graph | 3-polytope | Sparse polytope | Structural property | 3-face | Weight

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：, Schneider, and Shephard that every polytope* with the* | monotypy and the generating property for polytopes* are* | strongly monotypic polytopes* is also given.* | We prove an old conjecture of McMullen | generating property is strongly monotypic. The other

摘要： hyperedges containing . The degree-sequence polytope* od is* | the degree sequence polytope* are degree sequences* | An integer vector is an element of Z is a | degree sequence if there exists a hypergraph with | vertices {1, ... , } such that each is the number of

摘要： varying in a polytope. When goods are indivisible, it is | when the resource polytope* is a polymatroid through* | Allocating goods among agents under ordinal | preferences is a well-studied problem. In this study, each | type of good may have multi-copies with quotas

摘要： Birkhoff polytope* by imposing additional inequalities* | -linear bijection to a certain Gelfand-Tsetlin polytope | We show that the polytopes* obtained from the* | , even though they are just rational polytopes* in* | that the two polytopes* have the same Ehrhart (quasi*

摘要： facet-simple polytopes. Here a convex polytope* is* | -simple polytope* if it is a finite union of n* | textbf{x}),textbf{dx}$$end{document} over polytopes* P* | -dimensional facet-simple convex polytopes* such that any two* | We present an elementary approach for the

摘要：A lattice polytope* translated by a rational* | vector is called an almost integral polytope. In this | integral polytopes. We study the connection between the | shape of polytopes* and the algebraic properties of the* | polytopes are characterized by Ehrhart quasi-polynomials

摘要：The matching polytope* of a graph G is the* | matching polytopes* are Gorenstein, and then prove that* | all Gorenstein matching polytopes* possess the* | , we examine the matching polytopes* of wheel graphs* | convex hull of the indicator vectors of the matchings

摘要：Abstract The geometry of the Birkhoff polytope | the Birkhoff polytope* associated with the metrics* | , i.e., the compact convex set of all n×ndocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym | } usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy

摘要： vertex v . An edge e = xy in a 3-polytope* is an ( i , j* | -vertex. We prove that every 3-polytope* with neither* | -polytopes, namely those having no adjacent 3-cycles | . Borodin (1996) proved that such 3-polytopes* have a* | Over the last decades, a lot of research has