English
Related papers

Related papers: Families of m-convex polygons: m = 2

200 papers

Let F be a finite set of circles in the plane. We point out that the usual convex closure restricted to F yields a convex geometry, that is, a combinatorial structure introduced by P. H Edelman in 1980 under the name "anti-exchange closure…

Rings and Algebras · Mathematics 2013-05-22 Gábor Czédli

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

Optimization and Control · Mathematics 2022-12-27 Christian Bingane

In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…

Optimization and Control · Mathematics 2023-02-20 Nguyen Mau Nam , Nguyen Nang Thieu , Nguyen Dong Yen

A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…

Optimization and Control · Mathematics 2025-01-23 Bruno F. Lourenço , Vera Roshchina , James Saunderson

There is an important difference between Hamiltonian-like vector fields in an almost-symplectic manifold $(M,\sigma)$, compared to the standard case of a symplectic manifold: in the almost-symplectic case, a vector field such that the…

Symplectic Geometry · Mathematics 2024-12-17 Francesco Fassò , Nicola Sansonetto

In this paper, we propose a topology optimization (TO) framework where the design is parameterized by a set of convex polygons. Extending feature mapping methods in TO, the representation allows for direct extraction of the geometry. In…

Optimization and Control · Mathematics 2023-05-09 Aaditya Chandrasekhar

This paper gives a complete classification of conics in $PE_2(\mathbb{R})$. The classification has been made earlier (Reveruk [5]), but it showed to be incomplete and not possible to cite and use in further studies of properties of conics,…

Metric Geometry · Mathematics 2013-06-18 Jelena Beban-Brkić , Marija Šimić Horvath

We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…

Combinatorics · Mathematics 2022-12-21 Michael A. Allen , Kenneth Edwards

In this paper, approximate convexity and approximate midconvexity properties, called $\varphi$-convexity and $\varphi$-midconvexity, of real valued function are investigated. Various characterizations of $\varphi$-convex and…

Classical Analysis and ODEs · Mathematics 2012-11-21 Judit Makó , Zsolt Páles

We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…

Complex Variables · Mathematics 2023-06-21 Giovanni Domenico Di Salvo

In this paper we consider a restricted class of convex polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like…

Combinatorics · Mathematics 2007-05-23 Enrica Duchi , Simone Rinaldi , Gilles Schaeffer

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

Combinatorics · Mathematics 2016-09-02 Kira Adaricheva , Madina Bolat

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

Metric Geometry · Mathematics 2016-02-09 Júlia Frittmann , Zsolt Lángi

Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the…

Combinatorics · Mathematics 2007-05-23 Dominique Gouyou-Beauchamps , Pierre Leroux

In this paper, we extend some estimates of the right hand side of a Hermite- Hadamard type inequality for nonconvex functions whose second derivatives absolute values are \phi-convex, log-\phi-convex, and quasi-\phi-convex.

Functional Analysis · Mathematics 2013-12-04 Mehmet Zeki Sarikaya , Hakan Bozkurt , Mehmet Eyüp Kiris

Several important families of orthogonal polynomials on the real line are called ``hypergeometric'' since they can be explicitly described in terms of some hypergeometric series $_pF_q$ that uses the degree $n$ of the polynomial as a…

Classical Analysis and ODEs · Mathematics 2026-01-29 Joseph Bernstein , Dmitry Gourevitch , Siddhartha Sahi

Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…

Discrete Mathematics · Computer Science 2024-09-05 Mitre C. Dourado , Marisa Gutierrez , Fábio Protti , Rudini Sampaio , Silvia Tondato

In this article, we determine two point distortion theorem and sharp coefficient estimates for the families of close-to-convex harmonic mappings whose analytic part is a convex function of order $\alpha$. By making use of these results, we…

Complex Variables · Mathematics 2018-02-28 Anbareeswaran Sairam Kaliraj

We study some basic properties of the function $f_0:M\rightarrow\IR$ on Hadamard manifolds defined by $$ f_0(x):=\langle u_0,\exp_{x_0}^{-1}x\rangle\quad\mbox{for any $x\in M$}. $$ A characterization for the function to be linear affine is…

Optimization and Control · Mathematics 2015-10-06 Xiangmei Wang , Chong Li , Jen-Chih Yao

The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…

Metric Geometry · Mathematics 2021-08-31 Fei Xue , Yanlu Lian , Jun Wang , Yuqin Zhang