相关论文: Traveller Salesman Property and Richard Thompson's…

This technical report provides additional results for the main paper ``Probabilistic bounds on the $k-$Traveling Salesman Problem ($k-$TSP) and the Traveling Repairman Problem (TRP)''. For the $k-$TSP, we extend the probabilistic bounds…

A machine developed by the second author produces a rich family of unitary representations of the Thompson groups F,T and V. We use it to give direct proofs of two previously known results. First, we exhibit a unitary representation of V…

We investigate fixed-point properties of automorphisms of groups similar to R. Thompson's group $F$. Revisiting work of Gon\c{c}alves-Kochloukova, we deduce a cohomological criterion to detect infinite fixed-point sets in the…

We show that certain ways of solving some combinatorial optimization problems can be understood as using query planes to divide the space of problem instances into polyhedra that could fit into those that characterize the problem's various…

A new class of groups, the locally finitely determined groups of local similarities on compact ultrametric spaces, is introduced and it is proved that groups in this class have the Haagerup property (that is, they are a-T-menable in the…

Relative property (T) has recently been used to construct a variety of new rigidity phenomena, for example in von Neumann algebras and the study of orbit-equivalence relations. However, until recently there were few examples of group pairs…

Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2.…

Let p be a real number with 1<p and different from 2. We study Property (T_lp) for a second countable locally compact group G. Property (T_lp) is a weak version of Kazhdan's Property (T), defined in terms of the orthogonal representations…

It is known that for $\sigma$-compact groups Kazhdan's Property $(T)$ is equivalent to Serre's Property $(FH)$. Generalized versions of those properties, called properties $(T_{B})$ and $(F_{B})$, can be defined in terms of the isometric…

We solve the twisted conjugacy problem on Thompson's group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut_+(F) are orbit decidable provided a certain conjecture on Thompson's group T is true.…

Let $f$ be an automorphism of a group $G$. Two elements $x, y$ in $G$ are said to be in the same $f$-twisted conjugacy class if there exists an element $z$ in $G$ such that $y=z x f(z^{-1})$. This is an equivalence relation known as…

The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) addresses such…

Property (T) for groups means a dichotomy: a representation either has an invariant vector or all vectors are far from being invariant. We show that, under a stronger condition of A.Zuk, a similar dichotomy holds for almost representations…

The traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization. Several semidefinite programming relaxations have been proposed recently that exploit a variety of mathematical structures including, e.g.,…

We show that each of Thompson's groups F, T, and V have infinitely many ends relative to certain subgroups. We go on to show that T and V both have Serre's property FA, i.e., any action of T or V on a tree will have a fixed point. (The…

In this paper we study a natural special case of the Traveling Salesman Problem (TSP) with point-locational-uncertainty which we will call the {\em adversarial TSP} problem (ATSP). Given a metric space $(X, d)$ and a set of subsets $R =…

If $\phi$ is an automorphism of a group $G$ and $x,y\in G$, we say that $x$ and $y$ are $\phi$-twisted conjugates if there exists an $z\in G$ such that $y=z.x.\phi(z^{-1})$. This is an equivalence relation. If there are infinitely many…

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0,…

We show that an accessible group with infinitely many ends has property $R_{\infty}$. That is, it has infinitely many twisted conjugacy classes for any twisting automorphism. We deduce that having property $R_{\infty}$ is undecidable…

We show that property (T) is not profinite, that is, we construct two finitely generated residually finite groups which have isomorphic profinite completions while one admits property (T) and the other does not. This settles a question…