English
Related papers

Related papers: Fine Polyhedral Adjunction Theory

200 papers

Polycons, initially introduced by Wachspress in 1975 as a tool in finite element methods, are generalizations of polygons in that they allow conic boundary components. We are interested in the adjoint curve of a given polycon, i.e. the…

Algebraic Geometry · Mathematics 2026-03-20 Clemens Brüser

Let f: P-->W be an embedding of a compact polyhedron in a closed oriented manifold W, let T be a regular neighborhood of P in W and let C:=closure(W-T) be its complement. Then W is the homotopy push-out of a diagram C<--dT-->P. This…

Algebraic Topology · Mathematics 2014-10-01 Pascal Lambrechts , Don Stanley

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Algebraic Geometry · Mathematics 2025-10-20 J. Maurice Rojas

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

Number Theory · Mathematics 2018-06-05 Bence Borda

Convex integration and the holonomic approximation theorem are two well-known pillars of flexibility in differential topology and geometry. They may each seem to have their own flavor and scope. The goal of this paper is to bring some new…

Geometric Topology · Mathematics 2021-07-12 Patrick Massot , Mélanie Theillière

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…

Information Theory · Computer Science 2015-06-26 Ivan Soprunov

The purpose of this note is to revisit the results of arXiv:1407.4324 from a slightly different perspective, outlining how, if the integral closures of a finite set of prime ideals abide the expected convexity patterns, then the existence…

Commutative Algebra · Mathematics 2016-07-06 Matteo Varbaro

In this article we introduce a new family of lattice polytopes with rational linear precision. For this purpose, we define a new class of discrete statistical models that we call multinomial staged tree models. We prove that these models…

Combinatorics · Mathematics 2022-08-10 Isobel Davies , Eliana Duarte , Irem Portakal , Miruna-Stefana Sorea

We show that any finite affinely independent set can be isometrically embedded into a regular polygonal torus, that is, a finite product of regular polygons. As a consequence, with a straightforward application of K\v{r}\'{i}\v{z}'s…

Combinatorics · Mathematics 2023-05-30 Miltiadis Karamanlis

This paper presents a brand new methodology to deal with isotopic fine structure calculations. By using the Poisson approximation in an entirely novel way, we introduce mathematical elegance into the discussion on the trade-off between…

Chemical Physics · Physics 2014-10-28 Mateusz Krzysztof Łącki , Anna Gambin

Consider an n-dimensional projective toric variety X defined by a convex lattice polytope P. David Cox introduced the toric residue map given by a collection of n+1 divisors Z_0,...,Z_n on X. In the case when the Z_i are T-invariant…

Algebraic Geometry · Mathematics 2007-05-23 Ivan Soprounov

We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…

Optimization and Control · Mathematics 2021-08-20 Mengmeng Song , Yong Xia

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…

Logic in Computer Science · Computer Science 2023-06-22 Xavier Allamigeon , Ricardo D. Katz , Pierre-Yves Strub

We prove that the intersection homology Poincare' polynomial P(X) of an affine toric variety X is bounded below by the product P(Y)P(X/Y), where Y is the closure of any orbit in X and X/Y is a slice transverse to the orbit. This proves a…

alg-geom · Mathematics 2008-02-03 Tom C. Braden , Robert D. MacPherson

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…

Algebraic Geometry · Mathematics 2007-05-23 Vladlen Timorin

For each poset $P$, we construct a polytope $A(P)$ called the $P$-associahedron. Similarly to the case of graph associahedra, the faces of $A(P)$ correspond to certain nested collections of subsets of $P$. The Stasheff associahedron is a…

Combinatorics · Mathematics 2023-11-09 Pavel Galashin

Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…

Category Theory · Mathematics 2007-05-23 David Ellerman

We consider the moduli space of bordered Riemann surfaces with boundary and marked points. Such spaces appear in open-closed string theory, particularly with respect to holomorphic curves with Lagrangian submanifolds. We consider a…

Algebraic Geometry · Mathematics 2011-09-14 Satyan L. Devadoss , Timothy Heath , Cid Vipismakul

The present paper can be thought of as a continuation of the paper "Introduction to sh Lie algebras for physicists" by T. Lada and J. Stasheff (International Journal of Theoretical Physics Vol. 32, No. 7 (1993), 1087--1103, appeared also as…

High Energy Physics - Theory · Physics 2008-02-03 Tom Lada , Martin Markl

Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points…

Optimization and Control · Mathematics 2012-08-21 Gennadiy Averkov