惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Google DeepMind News
Google DeepMind News
aimingoo的专栏
aimingoo的专栏
爱范儿
爱范儿
D
Docker
I
InfoQ
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Vercel News
Vercel News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
T
Tailwind CSS Blog
D
DataBreaches.Net
月光博客
月光博客
N
Netflix TechBlog - Medium
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
V
Visual Studio Blog
MyScale Blog
MyScale Blog
B
Blog
阮一峰的网络日志
阮一峰的网络日志
L
LangChain Blog
Recent Announcements
Recent Announcements
Microsoft Azure Blog
Microsoft Azure Blog
WordPress大学
WordPress大学

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Inscribable fans I: Inscribed cones and virtual polytopes
Sebastian Manecke, Raman Sanyal · 2020-12-15 · via math.CO updates on arXiv.org

We investigate polytopes inscribed into a sphere that are normally equivalent (or strongly isomorphic) to a given polytope $P$. We show that the associated space of polytopes, called the inscribed cone of $P$, is closed under Minkowski addition. Inscribed cones are interpreted as type cones of ideal hyperbolic polytopes and as deformation spaces of Delaunay subdivisions. In particular, testing if there is an inscribed polytope normally equivalent to $P$ is polynomial time solvable. Normal equivalence is decided on the level of normal fans and we study the structure of inscribed cones for various classes of polytopes and fans, including simple, simplicial, and even. We classify (virtually) inscribable fans in dimension $2$ as well as inscribable permutahedra and nestohedra. A second goal of the paper is to introduce inscribed virtual polytopes. Polytopes with a fixed normal fan $\mathcal{N}$ form a monoid with respect to Minkowski addition and the associated Grothendieck group is called the type space of $\mathcal{N}$. Elements of the type space correspond to formal Minkowski differences and are naturally equipped with vertices and hence with a notion of inscribability. We show that inscribed virtual polytopes form a subgroup, which can be non-trivial even if $\mathcal{N}$ does not have actual inscribed polytopes. We relate inscribed virtual polytopes to routed particle trajectories, that is, piecewise-linear trajectories of particles in a ball with restricted directions. The state spaces gives rise to connected groupoids generated by reflections, called reflection groupoids. The endomorphism groups of reflection groupoids can be thought of as discrete holonomy groups of the trajectories and we determine when they are reflection groups.