相关论文: Projective geometry of Wachspress coordinates
Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In…
A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number…
Let $C$ be a complex irreducible plane curve that is not the vanishing locus of a modular polynomial. We show that $C$ contains finitely many real algebraic curves whose projection on each coordinate axis is a union of special geodesics.
We introduce a class of combinatorial hypersurfaces in the complex projective space. They are submanifolds of codimension~2 in $\C P^n$ and are topologically "glued" out of algebraic hypersurfaces in $(\C^*)^n$. Our construction can be…
We study the computation of our recently introduced Whitney polynomial and the enumeration of the spanning hypertrees for hypermaps whose hyperedges have length at most $3$. This is a class of hypermaps where the computation of the above…
We develop a theory of Hilbert geometry over general ordered valued fields, associating with an open convex subset of the projective space a quotient Hilbert metric space. Under natural non-degeneracy assumptions, we prove that the…
A polyellipse is a curve in the Euclidean plane all of whose points have the same sum of distances from finitely many given points (focuses). The classical version of Erd\H{o}s-Vincze's theorem states that regular triangles can not be…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…
Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I investigate the poset of noncrossing hypertrees…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
In 1933, van Kampen described the fundamental groups of the complements of plane complex projective algebraic curves. Recently, Ch\'eniot-Libgober proved an analogue of this result for higher homotopy groups of the complements of complex…
A method to visualize polytopes in a four dimensional euclidian space $(x,y,z,w)$ is proposed. A polytope is sliced by multiple hyperplanes that are parallel each other and separated by uniform intervals. Since the hyperplanes are…
Weighted projective space arises when we consider the usual geometric definition for projective space and allow for non-trivial weights. On its own, this extra freedom gives rise to more than enough interesting phenomena, but it is the fact…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…
In a seminal paper, Epstein introduced the theory of what are now called Epstein surfaces, which construct surfaces in $\mathbb{H}^3$ associated to a conformal metric on a domain in $\hat{\mathbb{C}}$. More recently, these surfaces have…
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…
The Euler characteristic of a very affine variety encodes the number of critical points of the likelihood equation on this variety. In this paper, we study the Euler characteristic of the complement of a hypersurface arrangement with…