English
Related papers

Related papers: Convexity deficit of benzenoids

200 papers

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

Combinatorics · Mathematics 2007-10-26 W. R. G. James , I. Jensen , A. J. Guttmann

The Wiener polarity index of a graph is defined as the number of unordered pairs of vertices at distance three. In recent years, this topological index was extensively studied since it has many known applications in chemistry and also in…

Combinatorics · Mathematics 2019-04-09 Niko Tratnik

Let $X$ be a finite set. A family $P$ of subsets of $X$ is called a convex geometry with ground set $X$ if (1) $\emptyset, X\in P$; (2) $A\cap B\in P$ whenever $A,B\in P$; and (3) if $A\in P$ and $A\neq X$, there is an element $\alpha\in…

Combinatorics · Mathematics 2024-01-10 Kolja Knauer , William T. Trotter

Besides the well known Wiener index, which sums up the distances between all the pairs of vertices, and the hyper-Wiener index, which includes also the squares of distances, the edge versions of both indices attracted a lot of attention in…

Combinatorics · Mathematics 2017-12-20 Petra Žigert Pleteršek

Covering a convex body by its homothets is a classical notion in discrete geometry that has resulted in a number of interesting and long-standing problems. Swanepoel introduced the covering parameter of a convex body as a means of…

Metric Geometry · Mathematics 2017-04-25 Karoly Bezdek , Muhammad A. Khan

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…

Complex Variables · Mathematics 2017-06-23 Andrew Zimmer

A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the combinatorics of maximal unbalanced…

Combinatorics · Mathematics 2012-09-12 L. J. Billera , J. Tatch Moore , C. Dufort Moraites , Y. Wang , K. Williams

In most of today's exactly solved classes of polyominoes, either all members are convex (in some way), or all members are directed, or both. If the class is neither convex nor directed, the exact solution uses to be elusive. This paper is…

Combinatorics · Mathematics 2011-04-28 Svjetlan Feretic

Topological indices are graph invariants numeric quantities, which are utilized by researchers to analyze a variety of physiochemical aspects of molecules. The goal of developing topological indices is to give each chemical structure a…

Combinatorics · Mathematics 2022-12-09 Sohan Lal , Karnika Sharma , Vijay Kumar Bhat

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

We develop the fundamentals of a new theory of convex geometry -- which we call "broken line convex geometry". This is a theory of convexity where the ambient space is the rational tropicalization of a cluster variety, as opposed to an…

Algebraic Geometry · Mathematics 2026-01-19 Juan Bosco Frías-Medina , Timothy Magee

In this paper, we investigate several subsets of $n$-copulas and $n$-quasi-copulas from the perspective of convex-lineability and the recently introduced concept of convex-spaceability. Our purpose is to determine when such families contain…

Statistics Theory · Mathematics 2026-02-09 Enrique de Amo , Juan Fernández-Sánchez , David García-Fernández , Manuel Úbeda-Flores

We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…

Group Theory · Mathematics 2026-04-16 Pallavi Dani , Yusra Naqvi , Ignat Soroko , Anne Thomas

The variation distance closure of an exponential family with a convex set of canonical parameters is described, assuming no regularity conditions. The tools are the concepts of convex core of a measure and extension of an exponential…

Probability · Mathematics 2007-05-23 Imre Csiszar , Frantisek Matus

In this article we construct many examples of properly convex irreducible domains divided by Zariski dense relatively hyperbolic groups in every dimension at least 3. This answers a question of Benoist. Relative hyperbolicity and non-strict…

Geometric Topology · Mathematics 2025-07-16 Pierre-Louis Blayac , Gabriele Viaggi

If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…

Metric Geometry · Mathematics 2013-12-04 Askold Khovanskii , Vladlen Timorin

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

Optimization and Control · Mathematics 2024-01-25 Daniel Dörfler , Andreas Löhne

We study the boundary structure of closed convex cones, with a focus on facially dual complete (nice) cones. These cones form a proper subset of facially exposed convex cones, and they behave well in the context of duality theory for convex…

Optimization and Control · Mathematics 2019-03-01 Vera Roshchina , Levent Tunçel

In 2001, K\'arolyi, Pach and T\'oth introduced a family of point sets to solve an Erd\H{o}s-Szekeres type problem; which have been used to solve several other Ed\H{o}s-Szekeres type problems. In this paper we refer to these sets as nested…

Computational Geometry · Computer Science 2016-06-09 Frank Duque , Ruy Fabila-Monroy , Carlos Hidalgo-Toscano , Pablo Pérez-Lantero

The edge-Szeged index of a graph $G$ is defined as $Sz_e(G) = \sum_{e=uv \in E(G)}m_u(e)m_v(e)$, where $m_u(e)$ denotes the number of edges of $G$ whose distance to $u$ is smaller than the distance to $v$ and $m_v(e)$ denotes the number of…

Combinatorics · Mathematics 2018-08-28 Niko Tratnik
‹ Prev 1 2 3 10 Next ›