Related papers: On Tarski's Decidability Problem
By providing a procedure to apply Hrushovski's amalgamation method to the setting of classes of infinite structures, we introduce the notion of \textit{paracollapsed} structures. We show that this approach provides existentially closed…
Sources of uncertainties in perturbative calculations, tadpole improvement and its role in lattice perturbation theory, and six recent calculations are discussed.
We continue a discussion of published assertions that are incorrect, incorrectly proven, or trivial, in the theory of fixed points in digital topology.
A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.
We provide a type theoretic treatment of the paper "On Tarski's fixed point theorem" by Giovanni Curi. There are benefits to having a type theoretic formulation apart from routine implementation in a proof assistant. By taking advantage of…
The purpose of this article is to present a survey of our recent results on length commensurable and isospectral locally symmetric spaces. The geometric questions led us to the notion of "weak commensurability" of two Zariski-dense…
We examine the interplay of symmetry and topological order in $2+1$ dimensional topological phases of matter. We present a definition of the \it topological symmetry \rm group, which characterizes the symmetry of the emergent topological…
The problem of interpreting a set of ${\cal W}$-algebra constraints constructed in terms of an arbitrarily twisted scalar field as the recursion relations of a topological theory is addressed. In this picture, the conventional models of…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
This is the second of three papers motivated by the author's desire to understand and explain "algebraically" one aspect of Dmitriy Zhuk's proof of the CSP Dichotomy Theorem. In this paper we extend Zhuk's "bridge" construction to arbitrary…
This is an expostion of various aspects of amenability and paradoxical decompositions for groups, group actions and metric spaces. First, we review the formalism of pseudogroups, which is well adapted to stating the alternative of Tarski,…
This paper is concerned with a posteriori error bounds for linear transport equations and related questions of contriving corresponding adaptive solution strategies in the context of Discontinuous-Petrov-Galerkin schemes. After indicating…
We continue to develop an obstruction theory for embedding 2-spheres into 4-manifolds in terms of Whitney towers. The proposed intersection invariants take values in certain graded abelian groups generated by labelled trivalent trees, and…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
Let $W$ be a complex reflection group of the form $G(l,1,n)$. Following [BK12, BPW12, Gor06, GS05, GS06, KR08, MN11], the theory of deform quantising conical symplectic resolutions allows one to study the category of modules for the…
We prove the equivalence of the semantic version of Tarski's theorem on the undefinability of truth with a semantic version of the Diagonal Lemma, and also show the equivalence of syntactic Tarski's Undefinability Theorem with a weak…
In this work, we study generalized entropies and information geometry in a group-theoretical framework. We explore the conditions that ensure the existence of some natural properties and at the same time of a group-theoretical structure for…