相关论文: Geometric coincidence results from multiplicity of…

We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…

The aim of this paper is to generalize some of the properties and results regarding both the coincidence point set and the common fixed point set of any two digitally continuous maps to the case of several (more than two) digitally…

It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Makeev conjectured that every constant-width body is inscribed in the dual difference body of a regular simplex. We prove that homologically, there are an odd number of such circumscribing bodies in dimension 3, and therefore geometrically…

Gr\"unbaum's inequality gives sharp bounds between the volume of a convex body and its part cut off by a hyperplane through the centroid of the body. We provide a generalization of this inequality for hyperplanes that do not necessarily…

Coincidences of maps between smooth manifolds are studied via a geometric approach which involves (nonstabilized) normal bordism theory and pathspaces.

We present coincidence and common fixed point results of selfmappings satisfying a contraction type in partially ordered metric spaces. As an application, we give an existence theorem for a common solution of integral equations.

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

We show that any two holomorhpic maps, not both of which are constant, from a generalized Hopf manifold to its base must have a coincidence. We prove a similar result for holomorphic maps from a generalized Calabi-Eckmann manifold.

We study the coincidence theory of maps between two manifolds of the same dimension from an axiomatic viewpoint. First we look at coincidences of maps between manifolds where one of the maps is orientation true, and give a set of axioms…

``Can number and geometric spaces be reconstructed from their symmetries?'' This question, which is at the heart of anabelian geometry, a theory built on the collaborative efforts of an international community in many variants and with the…

In this article, we investigate some properties of the coincidence point set of digitally continuous maps. Following the Rosenfeld graphical model which seems more combinatorial than topological, we expect to achieve results that might not…

For a given pair of maps f,g:X->M from an arbitrary topological space to an n-manifold, the Lefschetz homomorphism is a certain graded homomorphism L:H(X)->H(M) of degree (-n). We prove a Lefschetz-type coincidence theorem: if the Lefschetz…

The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…

We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…

Let $P$ be a set of at most $n$ points and let $R$ be a set of at most $n$ geometric ranges, such as for example disks or rectangles, where each $p \in P$ has an associated supply $s_{p} > 0$, and each $r \in R$ has an associated demand…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Polygon inclusion problems have been studied extensively in geometric optimization. In this paper, we consider the variant of computing the maximum area parallelograms (MAPs) and all the locally maximal area parallelograms (LMAPs) in a…