English
Related papers

Related papers: Convex Geometries yielded by Transit Functions

200 papers

Binary clustering systems are closely related to monotone transit functions. An interesting class are pyramidal transit functions defined by the fact that their transit sets form an interval hypergraph. We investigate here properties of…

Combinatorics · Mathematics 2022-12-20 Manoj Changat , Ameera Vaheeda Shanavas , Peter F. Stadler

Many interesting problems are obtained by attempting to generalize classical results on convexity in Euclidean spaces to other convexity spaces, in particular to convexity spaces on graphs. In this paper we consider $P_3$-convexity on…

Combinatorics · Mathematics 2013-02-08 Shoham Letzter

In this paper we study the structure of $k$-transitive closures of directed paths and formulate several properties. Concept of $k$-transitive orientation generalize the traditional concept of transitive orientation of a graph.

Combinatorics · Mathematics 2014-12-24 Krzysztof Pszczoła

In this work, we present a new efficient method for convex shape representation, which is regardless of the dimension of the concerned objects, using level-set approaches. Convexity prior is very useful for object completion in computer…

Computer Vision and Pattern Recognition · Computer Science 2020-03-24 Lingfeng li , Shousheng Luo , Xue-Cheng Tai , Jiang Yang

We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…

Optimization and Control · Mathematics 2020-07-14 Mitchell Harris , Thomas Kalinowski

Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…

Probability · Mathematics 2024-11-20 Maria Deijfen , Riccardo Michielan

Let $k$ be an integer. We prove a rough structure theorem for separations of order at most $k$ in finite and infinite vertex transitive graphs. Let $G = (V,E)$ be a vertex transitive graph, let $A \subseteq V$ be a finite vertex-set with…

Combinatorics · Mathematics 2011-10-24 Matt DeVos , Bojan Mohar

This paper analyzes the convex hull of the parametric curve $\left(t, t^2, \cdots, t^N\right)$, where $t$ is in a closed interval. It finds that every point in the convex hull is representable as a convex combination of $\frac{N+1}{2}$…

General Topology · Mathematics 2017-06-08 Kostyantyn Mazur

It is well-known that if a real valued function acting on a convex set satisfies the $n$-variable Jensen inequality, for some natural number $n\geq 2$, then, for all $k\in\{1,\dots, n\}$, it fulfills the $k$-variable Jensen inequality as…

Classical Analysis and ODEs · Mathematics 2017-06-29 Tibor Kiss , Zsolt Páles

We study continuity and regularity of convex extensions of functions from a compact set $C$ to its convex hull $K$. We show that if $C$ contains the relative boundary of $K$, and $f$ is a continuous convex function on $C$, then $f$ extends…

Functional Analysis · Mathematics 2013-12-05 Orest Bucicovschi , Jiri Lebl

A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…

Operator Algebras · Mathematics 2025-04-15 Kenneth R. Davidson , Adam Dor-On , Orr Shalit , Baruch Solel

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

Complex Variables · Mathematics 2022-10-14 Golam Mostafa Mondal

We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…

Probability · Mathematics 2022-02-28 Wojciech Cygan , Nikola Sandrić , Stjepan Šebek

A non-empty set $X$ of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by $X$ is connected and it is called convex if no two vertices of $X$ are connected by a directed path in which some…

Discrete Mathematics · Computer Science 2007-12-18 P. Balister , S. Gerke , G. Gutin

With any convex function F on a finite-dimensional linear space X such that F goes to infinity at infinity, we associate a Borel measure on the dual space X*. This measure is obtained by pushing forward the measure exp(-F(x))dx under the…

Functional Analysis · Mathematics 2013-04-03 Dario Cordero-Erausquin , Bo'az Klartag

In this work, we introduce a new graph convexity, that we call Cycle Convexity, motivated by related notions in Knot Theory. For a graph $G=(V,E)$, define the interval function in the Cycle Convexity as $I_{cc}(S) = S\cup \{v\in V(G)\mid…

Combinatorics · Mathematics 2020-12-11 Júlio Araújo , Victor Campos , Darlan Girão , João Nogueira , António Salgueiro , Ana Silva

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

We show that a differentiable function on the 2-Wasserstein space is geodesically convex if and only if it is also convex along a larger class of curves which we call `acceleration-free'. In particular, the set of acceleration-free curves…

Functional Analysis · Mathematics 2023-06-21 Guy Parker

We introduce the notion of trace convexity for functions and respectively, for subsets of a compact topological space. This notion generalizes both classical convexity of vector spaces, as well as Choquet convexity for compact metric…

Functional Analysis · Mathematics 2020-04-07 Mohammed Bachir , Aris Daniilidis

A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…

Combinatorics · Mathematics 2022-12-06 Daniel W. Cranston , Jiaxi Nie , Jacques Verstraëte , Alexandra Wesolek
‹ Prev 1 8 9 10 Next ›