Related papers: Vertex Classification of Planar C-polygons
We give an analytic approach to the translating soliton equation with a special emphasis in the study of the Dirichlet problem in convex domains of the plane.
A point $p$ is said to be an area center of a polygon if all of the triangles composed of $p$ and its edges have one and the same area. We construct a moduli space $AC_n$ of such $n$-gons and study its geometry and arithmetic. For every…
Poncelet's theorem states that if there exists an n-sided polygon which is inscribed in a given conic C and circumscribed about another conic D, then there are infinitely many such n-gons. Proofs of this theorem that we are aware of,…
We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two cases, in which, for the first case the polygon contain a…
A plus-contact representation of a planar graph $G$ is called $c$-balanced if for every plus shape $+_v$, the number of other plus shapes incident to each arm of $+_v$ is at most $ c \Delta +O(1)$, where $\Delta$ is the maximum degree of…
In the paper the complex geodesics of a convex domain in $\mathbb C^n$ are studied. One of the main results of the paper provides certain necessary condition for a holomorphic map to be a complex geodesic for a convex domain in $\mathbb…
Let $C$ be an algebraic curve defined by a sufficiently generic bivariate Laurent polynomial with given Newton polygon $\Delta$. It is classical that the geometric genus of $C$ equals the number of lattice points in the interior of…
For some full measure subset B of the set of iet's (i.e. interval exchange transformations) the following is satisfied: Let X be a $C^r$, $1\le r\le \infty$, vector field, with finitely many singularities, on a compact orientable surface M.…
It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…
We prove that a general complete intersection of dimension $n$, codimension $c$ and type $d_1, \dots, d_c$ in $\mathbb{P}^N$ has ample cotangent bundle if $c \geq 2n-2$ and the $d_i$'s are all greater than a bound that is $O(1)$ in $N$ and…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
It is shown that any non-degenerate $\mathbb C$-convex domain in $\mathbb C^n$ is uniformly squeezing. It is also found the precise behavior of the squeezing function near a Dini-smooth boundary point of a plane domain.
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
A polyhedron in a Banach space is a family of points $\mathcal{X}$ such that for every $x\in \mathcal{X}$, there is a closed convex set $C$ such that $a\notin C$ and $\mathcal{X}\setminus\{x\}\subset C$. In this article, we consider the…
Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…
A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
We consider plane curves isomorphic to C*. We prove that with one exception the branches at infinity can be separated by an automorphism of C^2. We also give a bound for selfintersection number of the resolution curve.