全部 |
  • 全部
  • 题名
  • 作者
  • 机构
  • 关键词
  • NSTL主题词
  • 摘要
检索 二次检索 AI检索
外文文献 中文文献
筛选条件:

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. 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
关键词: Plane graph |  3-polytope |  Sparse polytope |  Structural property |  3-face |  Weight

9. When Web 3.0 Meets Reality: A Hyperdimensional Fractal Polytope P2P Ecosystem NSTL国家科技图书文献中心

Hao Xu |  Yunqing Sun... -  《IEEE Network》 - 2025,39(1) - 157~164 - 共8页

摘要: system that is based on fractal polytopes in any | Web 3.0 introduces the concept of crypto | -network entities, which are independently defined by |  public key pairs and connected to Web 3.0 cyberspace | . In this paper, we present a spacetime coordinate
关键词: Semantic Web |  Blockchains |  Fractals |  IP networks |  Peer-to-peer computing |  Routing |  Shape

10. Generalized min-up/min-down polytopes NSTL国家科技图书文献中心

Rottner, Cecile -  《Discrete optimization》 - 2025,55 - 共17页

摘要: steps. The minimum-time polytope is defined as the |  time. The no-spike polytope is defined as the convex |  constraints. For both the minimum-time polytope and the no | -spike polytope, we introduce families of valid |  size for each polytope.
关键词: Min-up/min-down |  Minimum dwell time |  Unit commitment |  Polytope |  Linear description
检索条件POLYTOPE

NSTL主题词

  • NSTL学科导航