Related papers: Some computability-theoretic reductions between pr…

We prove various results connected together by the common thread of computability theory. First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing…

Let $A_p(G)$ denote the Figa-Talamanca-Herz Banach Algebra of the locally compact group $G$, thus $A_2(G)$ is the Fourier Algebra of $G$. If $G$ is commutative then $A_2(G)=L^1(\hat{G}){\hat{}}$. Let $A^r_p(G)=A_p\cap L^r(G)$ with norm…

We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The…

We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…

We study versions of the tree pigeonhole principle, $\mathsf{TT}^1$, in the context of Weihrauch-style computable analysis. The principle has previously been the subject of extensive research in reverse mathematics. Two outstanding…

We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…

We apply a variety of machine learning methods to the study of Seiberg duality within 4d $\mathcal{N}=1$ quantum field theories arising on the worldvolumes of D3-branes probing toric Calabi-Yau 3-folds. Such theories admit an elegant…

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

Let $A$ be a finite-dimensional algebra over an algebraically closed field. The problem of constructing indecomposable $A$-modules inductively from simple ones by means of exact sequences - called accessibility - is the starting point of…

We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…

This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…

We first construct an action of the extended double affine braid group $\mathcal{\ddot{B}}$ on the quantum toroidal algebra $U_{q}(\mathfrak{g}_{\mathrm{tor}})$ in untwisted and twisted types. As a crucial step in the proof, we obtain a…

Representation theory of the quantum torus Hopf algebra, when the parameter $q$ is a root of unity, is studied. We investigate a decomposition map of the tensor product of two irreducibles into the direct sum of irreducibles, realized as a…

In this paper, we give the oriented quantum algebra (abbr. OQA) structures on the tensor product of two different OQAs by using Chen's weak $\mathfrak{R}$-matrix in [J. Algebra 204(1998):504-531]. As a special case, the OQA structures on…

The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…

Let N be a square-free positive integer and let f be a newform of weight 2 on \Gamma_0(N). Let A denote the abelian subvariety of J_0(N) associated to f and let m be a maximal ideal of the Hecke algebra T that contains Ann_T(f) and has…

We consider the problem of developing a method to reconstruct a potential $q$ from the partial data Dirichlet-to-Neumann map for the Schr\"odinger equation $(-\Delta_g+q)u=0$ on a fixed admissible manifold $(M,g)$. If the part of the…