中文
相关论文

相关论文: Uniquely constructed figures

200 篇论文

We give a necessary condition on a geodesic in a Riemannian manifold that can run in some convex hypersurface. As a corollary we obtain peculiar properties that hold true for every convex set in any generic Riemannian manifold (M,g). For…

微分几何 · 数学 2022-01-13 Alexander Lytchak , Anton Petrunin

A normalized univalent function is uniformly convex if it maps every circular arc contained in the open unit disk with center in it into a convex curve. This article surveys recent results on the class of uniformly convex functions and on…

复变函数 · 数学 2011-08-23 R. M. Ali , V. Ravichandran

A description is an entity that can be interpreted as true or false of an object, and using feature structures as descriptions accrues several computational benefits. In this paper, I create an explicit interpretation of a typed feature…

cmp-lg · 计算机科学 2008-02-03 Paul John King

We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…

组合数学 · 数学 2013-08-23 Laszlo Lovasz , Balazs Szegedy

A set $W\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$…

组合数学 · 数学 2012-05-03 Behrooz Bagheri , Mohsen Jannesari , Behnaz Omoomi

We give a variety of uniqueness results for minimal ellipsoids circumscribing and maximal ellipsoids inscribed into a convex body. Uniqueness follows from a convexity or concavity criterion on the function used to measure the size of the…

度量几何 · 数学 2012-05-10 Matthias J. Weber , Hans-Peter Schröcker

Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…

组合数学 · 数学 2017-01-27 Kira Adaricheva , J. B. Nation

A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…

逻辑 · 数学 2018-10-16 Manuel Bodirsky , Friedrich Martin Schneider

In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the…

We study in this work flat surfaces with conical singularities, that is, surfaces provided with a flat structure with conical singular points. Finding good parameters for these surfaces in the general case is an open question. We give an…

度量几何 · 数学 2010-11-23 Ousama Malouf

A variety V is said to be coherent if any finitely generated subalgebra of a finitely presented member of V is finitely presented. It is shown here that V is coherent if and only if it satisfies a restricted form of uniform deductive…

逻辑 · 数学 2018-03-28 Tomasz Kowalski , George Metcalfe

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

逻辑 · 数学 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

For a graph $G$ and partition $\mathcal{U}$ of its vertex set, an independent transversal of $(G, \mathcal{U})$ is an independent set of $G$ that contains one vertex from each block of $\mathcal{U}$. Buys, Kang, and Ozeki studied when a…

组合数学 · 数学 2026-04-24 Ronen Wdowinski

We prove that a connected bipartite graph G is a partial cube if and only if the set of attaching points of any copoint of G is convex. A consequence of this result is that any connected bipartite graph with pre-hull number at most 1 is a…

组合数学 · 数学 2019-01-23 Norbert Polat

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…

组合数学 · 数学 2016-11-04 Mohammad Hadi Shekarriz , Madjid Mirzavaziri

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

一般拓扑 · 数学 2015-09-28 Paul Gartside , Max F. Pitz , Rolf Suabedissen

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph $G$ is called uniformly well-covered if there is a partition of the set of vertices of $G$ such that each maximal…

组合数学 · 数学 2013-04-12 Rashid Zaare-Nahandi

The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…

综合数学 · 数学 2026-04-24 Angshuman R. Goswami

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

微分几何 · 数学 2010-11-16 François Fillastre

A fake quadric is a smooth projective surface that has the same rational cohomology as a smooth quadric surface but is not biholomorphic to one. We provide an explicit classification of all irreducible fake quadrics according to the…

代数几何 · 数学 2019-06-04 Benjamin Linowitz , Matthew Stover , John Voight