Related papers: On a subclass of tame problems

People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at…

The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…

In topological dynamics, tame and null systems arise naturally in the study of low-complexity aperiodic behaviour, yet providing concrete and easily testable conditions to establish their existence in a canonical class of systems is often…

Ramification for commutative ring spectra can be detected by relative topological Hochschild homology and by topological Andr\'e-Quillen homology. In the classical algebraic context it is important to distinguish between tame and wild…

We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a…

We prove that the problems of classifying triples of symmetric or skew-symmetric matrices up to congruence, local commutative associative algebras with zero cube radical and square radical of dimension 3, and Lie algebras with central…

We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…

In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…

Consider a graph $G$ where each vertex is visibly labelled as a member of a distinct class, but also has a hidden binary state: wild or tame. Edges with end points in the same class are called agreement edges. Premise: an edge connecting…

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…

This article surveys recent advances and future challenges in the $2$-representation theory of finitary $2$-categories with a particular emphasis on problems related to classification of various classes of $2$-representations.

A problem list in singularity theory. Most of these problems are related with the algorithmic enumeration of possible topological types of non-discriminant Morsifications of real function singularities, and/or with the Picard--Lefschetz…

Let X be a separated scheme of finite type over an algebraically closed field k and let m be a natural number. By an explicit geometric construction using torsors we construct a pairing between the first mod m Suslin homology and the first…

Is tame open? No answer so far. One may pose the Tame-Open Conjecture: Tame is open. But how to support it? No effective way to date. In this note, the rank of a wild algebra is introduced. The Wild-Rank Conjecture, which implies the…

We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more generally, definable in some o-minimal structure. Our sufficient…

In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…

Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…