中文
相关论文

相关论文: Polynomial Hulls of Arcs and Curves II

200 篇论文

We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…

组合数学 · 数学 2023-08-30 Alberto Del Pia , Aida Khajavirad

We confirm a conjecture of Friedland and Milnor: if two polynomial automorphisms f and g in Aut(C^2) with dynamical degree >1 are conjugate by some holomorphic diffeomorphism \phi of C^2, then \phi is a polynomial automorphism; thus, f and…

动力系统 · 数学 2024-03-29 Serge Cantat , Romain Dujardin

We prove that every locally pluripolar set on a compact complex manifold is pluripolar. This extends similar results in K\"ahler case.

复变函数 · 数学 2018-12-04 Duc-Viet Vu

Let $G$ be a cubic graph and $\Pi$ be a polyhedral embedding of this graph. The extended graph, $G^{e},$ of $\Pi$ is the graph whose set of vertices is $V(G^{e})=V(G)$ and whose set of edges $E(G^{e})$ is equal to $E(G) \cup \mathcal{S}$,…

组合数学 · 数学 2019-11-28 Flor Aguilar , Gabriela Araujo-Pardo , Natalia García-Colín

In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…

计算几何 · 计算机科学 2025-06-23 Guilherme D. da Fonseca

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…

组合数学 · 数学 2015-10-09 Marie Albenque , Kolja Knauer

Suppose that the set ${\mathcal{T}}= \{T_1, T_2,...,T_q \} $ of real $n\times n$ matrices has joint spectral radius less than $1$. Then for any digit set $ D= \{d_1, \cdots, d_q\} \subset {\Bbb R}^n$, there exists a unique nonempty compact…

动力系统 · 数学 2019-02-12 Ibrahim Kirat , Ilker Kocyigit

We embed compact $C^\infty$ manifolds into $\mathbb C^n$ as totally real manifolds with prescribed polynomial hulls. As a consequence we show that any compact $C^\infty$ manifold of dimension $d$ admits a totally real embedding into…

复变函数 · 数学 2017-11-20 Leandro Arosio , Erlend Fornaess Wold

We prove that for a polynomial diffeomorphism of C^2 , the support of any invariant measure, apart from a few obvious cases, is contained in the closure of the set of saddle periodic points.

动力系统 · 数学 2017-09-06 Romain Dujardin

We present a short proof of S. Parsa's theorem that there exists a compact $n$-polyhedron $P$, $n\ge 2$, non-embeddable in $\mathbb R^{2n}$, such that $P*P$ embeds in $\mathbb R^{4n+2}$. This proof can serve as a showcase for the use of…

几何拓扑 · 数学 2022-10-11 Sergey A. Melikhov

We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon $\mathcal{P}$ if at least one of its two endpoints is contained in $\mathcal{P}$. A segment set $S$ is…

We describe a canonical compactification of a polyhedral complex in Euclidean space. When the recession cones of the polyhedral complex form a fan, the compactified polyhedral complex is a subspace of a tropical toric variety. In this case,…

代数几何 · 数学 2020-12-23 Lars Kastner , Kristin Shaw , Anna-Lena Winz

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

计算几何 · 计算机科学 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…

几何拓扑 · 数学 2020-08-04 Yanwen Luo

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

概率论 · 数学 2022-01-11 M. Reitzner , C. Schuett , E. M. Werner

In this paper, we first present combinatorial proofs of a kind of expansions of the Eulerian polynomials of types A and B, and then we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the…

组合数学 · 数学 2016-07-07 Shi-Mei Ma , Yeong-Nan Yeh

We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time…

组合数学 · 数学 2018-05-01 Kolja Knauer , Nicolas Nisse

The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we…

组合数学 · 数学 2013-07-17 Danny Calegari , Alden Walker

We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…

代数几何 · 数学 2018-05-04 E. Artal , J. Carmona , J. I. Cogolludo , M. Marco

We prove that the vertex set of any twin-free multigraph G has an embedding into some point set P of some Euclidean space Rk, such that the automorphism group of G is isomorphic to the isometry group of Rk globally preserving P.

组合数学 · 数学 2007-05-23 Hubert De Fraysseix , Patrice Ossona De Mendez
‹ 上一页 1 8 9 10 下一页 ›