English
Related papers

Related papers: Convexity deficit of benzenoids

200 papers

The inability of standard models to explain the flux ratios in many 4-image gravitational lenses has been cited as evidence for significant small-scale structure in lens galaxies. That claim has generally relied on detailed lens modeling,…

Astrophysics · Physics 2009-11-07 Charles R. Keeton , B. Scott Gaudi , A. O. Petters

The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…

Combinatorics · Mathematics 2025-03-25 Ivan Chajda , Helmut Länger

The edge-hyper-Wiener index of a connected graph $G$ is defined as $WW_e(G) = \frac{1}{2}\sum_{\lbrace e,f\rbrace \subseteq E(G)}d(e,f) + \frac{1}{2}\sum_{\lbrace e,f\rbrace \subseteq E(G)}d(e,f)^2$. We develop a method for computing the…

Combinatorics · Mathematics 2018-08-28 Niko Tratnik

Convexity and quasiconvexity are two properties that capture the concept of diversification for risk measures. Between the two, there is natural quasiconvexity, an old but not so well-known property weaker than convexity but stronger than…

Mathematical Finance · Quantitative Finance 2022-01-19 Çağın Ararat , Barış Bilir , Elisa Mastrogiacomo

Let $C$ be a closed convex cone in ${\mathbb R}^n$, pointed and with interior points. We consider sets of the form $A=C\setminus A^\bullet$, where $A^\bullet\subset C$ is a closed convex set. If $A$ has finite volume (Lebesgue measure),…

Metric Geometry · Mathematics 2017-11-08 Rolf Schneider

This paper is about integral zonotopes. It is proven that large zonotopes in a convex cone have a limit shape, meaning that, after suitable scaling, the overwhelming majority of the zonotopes are very close to a fixed convex set. Several…

Combinatorics · Mathematics 2018-04-12 Imre Bárány , Julien Bureaux , Ben Lund

Twin-width is a new parameter informally measuring how diverse are the neighbourhoods of the graph vertices, and it extends also to other binary relational structures, e.g. to digraphs and posets. It was introduced just very recently, in…

Discrete Mathematics · Computer Science 2021-07-09 Jakub Balabán , Petr Hliněný

A problem posed by Erd\H{o}s in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi

In this paper, we give for the first time a systematic study of the variance of the distance to the boundary for arbitrary bounded convex domains in $\mathbb{R}^2$ and $\mathbb{R}^3$. In dimension two, we show that this function is strictly…

General Mathematics · Mathematics 2024-07-18 Alastair N. Fletcher , Alexander G. Fletcher

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does…

Computational Geometry · Computer Science 2008-01-28 Alex Benton , Joseph O'Rourke

The present work concerns generalized convex sets in the real multi-dimensional Euclidean space, known as weakly $1$-convex and weakly $1$-semiconvex sets. An open set is called weakly $1$-convex (weakly $1$-semiconvex) if, through every…

General Topology · Mathematics 2024-12-03 Tetiana M. Osipchuk

In this paper we study the Szeged index of partial cubes and hence generalize the result proved by V. Chepoi and S. Klav\v{z}ar, who calculated this index for benzenoid systems. It is proved that the problem of calculating the Szeged index…

Combinatorics · Mathematics 2018-08-28 Matevz Crepnjak , Niko Tratnik

We propose a notion of depth with respect to a finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$ which we call $\text{dep}_\mathcal{F}$. We begin showing that $\text{dep}_\mathcal{F}$ satisfies some expected properties for a…

Combinatorics · Mathematics 2016-12-13 Leonardo Martínez-Sandoval , Roee Tamam

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

Combinatorics · Mathematics 2010-12-13 Roland Bacher , Frédéric Mouton

In chemical graph theory, caterpillar trees have been an appealing model to represent the molecular structures of benzenoid hydrocarbon. Meanwhile, topological index has been thought of as a powerful tool for modeling quantitative…

Probability · Mathematics 2021-02-26 Panpan Zhang , Xiaojing Wang

Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right…

Optimization and Control · Mathematics 2016-02-02 Kira Adaricheva

A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets $A, B\subset\mathbb R$, each of size $n^{1/2}$, the convex grid…

Combinatorics · Mathematics 2015-04-28 Orit E. Raz , Micha Sharir , Ilya D. Shkredov

A contact form on the tight $3$-sphere $(S^3,\xi_0)$ is called weakly convex if the Conley-Zehnder index of every Reeb orbit is at least $2$. In this article, we study Reeb flows of weakly convex contact forms on $(S^3,\xi_0)$ admitting a…

Symplectic Geometry · Mathematics 2024-08-21 Naiara V. de Paulo , Umberto Hryniewicz , Seongchan Kim , Pedro A. S. Salomão

We prove bounds on approximate incidences between families of circles and families of points in the plane. As a consequence, we prove a lower bound for the dimension of circular $(u,v)$-Furstenberg sets, which is new for large $u$ and $v$.

Classical Analysis and ODEs · Mathematics 2025-02-18 John Green , Terence L. J. Harris , Yumeng Ou , Kevin Ren , Sarah Tammen

We consider the family of graphs whose vertex set is Z^k where two vertices are connected by an edge when their l\infty-distance is 1. We prove the optimal vertex isoperimetric inequality for this family of graphs. That is, given a positive…

Combinatorics · Mathematics 2012-02-21 Ellen Veomett , A. J. Radcliffe