English
Related papers

Related papers: Approximate Fixed Point Property for Digital Trees…

200 papers

For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…

Combinatorics · Mathematics 2024-03-14 Debsoumya Chakraborti , Ben Lund

Building upon work of L\"{u}cke and Schlicht, we study (higher) Kurepa trees through the lens of higher descriptive set theory, focusing in particular on various perfect set properties and representations of sets of branches through trees…

Logic · Mathematics 2024-12-02 Chris Lambie-Hanson , Šárka Stejskalová

The paper is devoted to a study of certain fixed point properties, and their relatives, in the context of full automorphism groups of countable rooted trees. Namely, we study Serre's property (FA'), also called unsplittability, property…

Group Theory · Mathematics 2011-10-21 Maciej Malicki

In this paper, first we have established two sets of sufficient conditions for a TS-IF contractive mapping to have unique fixed point in a intuitionistic fuzzy metric space. Then we have defined \,$(\,\epsilon \,,\, \lambda\,)$\,…

General Mathematics · Mathematics 2011-03-16 T. K. Samanta , Sumit Mohinta

This paper is concerned with the fast computation of a relation $\R$ on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the…

Discrete Mathematics · Computer Science 2013-08-12 Marc Hellmuth , Wilfried Imrich , Tomas Kupka

It is shown, for a given graph group $G$, that the fixed point subgroup Fix$\,\varphi$ is finitely generated for every endomorphism $\varphi$ of $G$ if and only if $G$ is a free product of free abelian groups. The same conditions hold for…

Group Theory · Mathematics 2013-10-29 Emanuele Rodaro , Pedro V. Silva , Mihalis Sykiotis

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

Metric Geometry · Mathematics 2023-08-28 Alice Kerr

A compact polyhedron $X$ is said to have the Bounded Index Property for Homotopy Equivalence (BIPHE) if there is a finite bound $\mathcal{B}$ such that for any homotopy equivalence $f:X\rightarrow X$ and any fixed point class $\mathbf{F}$…

Geometric Topology · Mathematics 2019-09-04 Shengkui Ye , Qiang Zhang

Let $p$ be an odd prime and $A \subseteq \mathbb{F}_p$ be a subset of the finite field with $p$ elements. We show that $A \times A \subseteq \mathbb{F}_p^2$ determines at least a constant multiple of $\min\{p, |A|^{3/2}\}$ distinct pinned…

Combinatorics · Mathematics 2018-11-08 Giorgis Petridis

The map x -> x^x modulo p is related to a variation of the digital signature scheme in a similar way to the discrete exponentiation map, but it has received much less study. We explore the number of fixed points of this map by a statistical…

Number Theory · Mathematics 2018-06-06 Matthew Friedrichsen , Joshua Holden

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

Functional Analysis · Mathematics 2026-04-15 Jie Shi

Probabilistic relational models such as parametric factor graphs enable efficient (lifted) inference by exploiting the indistinguishability of objects. In lifted inference, a representative of indistinguishable objects is used for…

Artificial Intelligence · Computer Science 2025-08-28 Malte Luttermann , Jan Speller , Marcel Gehrke , Tanya Braun , Ralf Möller , Mattis Hartwig

Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we…

Data Structures and Algorithms · Computer Science 2020-04-07 Mark Jones , Steven Kelk , Leen Stougie

We provide criteria for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. These criteria reduce the projection problem to a certain…

Computer Vision and Pattern Recognition · Computer Science 2015-03-14 Joseph M. Burdis , Irina A. Kogan

In this technical note, we derive a closed-form expression for the affine transformation mapping local image patches between two calibrated views. We show that the transformation is a function of the relative camera pose, the image…

Computer Vision and Pattern Recognition · Computer Science 2026-02-09 Levente Hajder

We consider vector fixed point (FP) equations in large dimensional spaces involving random variables, and study their realization-wise solutions. We have an underlying directed random graph, that defines the connections between various…

Probability · Mathematics 2021-12-09 Veeraruna Kavitha , Indrajit Saha , Sandeep Juneja

The goal of this paper is to establish a general fixed point theorem for compact single-valued continuous mapping in Hausdorff p-vector spaces, and the fixed point theorem for upper semicontinuous set-valued mappings in Hausdorff locally…

Functional Analysis · Mathematics 2023-04-13 George Xianzhi Yuan

A locally compact groupoid is said to be exact if its associated reduced crossed product functor is exact. In this paper, we establish some permanence properties of exactness, including generalizations of some known results for exact…

Operator Algebras · Mathematics 2018-11-07 Scott M. LaLonde

We give an axiomatic characterization of the fixed point index of an $n$-valued map. For $n$-valued maps on a polyhedron, the fixed point index is shown to be unique with respect to axioms of homotopy invariance, additivity, and a splitting…

Algebraic Topology · Mathematics 2017-08-01 P. Christopher Staecker

We study the Equitable Connected Partition (ECP for short) problem, where we are given a graph G=(V,E) together with an integer p, and our goal is to find a partition of V into p parts such that each part induces a connected sub-graph of G…

Data Structures and Algorithms · Computer Science 2024-05-01 Václav Blažej , Dušan Knop , Jan Pokorný , Šimon Schierreich