arXiv research

Proof shows homeomorphism problem is unsolvable.

The isomorphism problem for [free abelian]-by-free groups is unsolvable.

This paper is an introduction to the theory of virtual knots and links and it gives a list of unsolved problems in this subject.

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Survey of recent results on homogeneous finite-dimensional spaces.

Recently, Rips produced an example of a double of two free groups which has unsolvable generalized word problem. In this paper, we show that Rips's example fits into a large class of doubles of groups, each member of which contains F_2 x F_2 and therefore has unsolvable generalized word problem and is incoherent.

This paper is a concise introduction to virtual knot theory, coupled with a list of research problems in this field.

Study on homological Dehn functions of groups of type $FP_2$.

Gödel's sentence is an adversarial example but unsolvable.

Research explores Kähler and semi-para-Kähler structures on specific Lie groups.

This short note serves as a historical introduction to the Hopf problem: "Does there exist a complex structure on $S^6$?" This unsolved mathematical question was the subject of the Conference "MAM 1 $-$ (Non-)Existence of Complex Structures on $S^6$", which took place at Philipps-Universität Marburg, Germany, between M…

We give an updated extended survey of results related to the celebrated unsolved generalized R. L. Moore problem. In particular, we address the problem of characterizing codimension one manifold factors, i.e. spaces $X$ having the property that $X \times \mathbb{R}$ is a topological manifold. A main part of the paper i…

This paper will serve as an introduction to the body of work on robust subspace recovery. Robust subspace recovery involves finding an underlying low-dimensional subspace in a dataset that is possibly corrupted with outliers. While this problem is easy to state, it has been difficult to develop optimal algorithms due t…

Minimalist softmax attention learns constrained Boolean functions with supervision.

In these notes we describe heuristics to predict computational-to-statistical gaps in certain statistical problems. These are regimes in which the underlying statistical problem is information-theoretically possible although no efficient algorithm exists, rendering the problem essentially unsolvable for large instances…

Kempe discusses NTK approach to machine learning problems.

The possible existence of a complex structure on the 6-sphere has been a famous unsolved problem for over 60 years. In that time many "solutions" have been put forward, in both directions. Mistakes have always been found. In this paper I present a short proof of the non-existence, based on ideas developed, but not full…

We show that the Dirichlet problem at infinity is unsolvable for the p-Laplace equation for any nonconstant continuous boundary data, for certain range of p>n, on an n-dimensional Cartan-Hadamard manifold constructed from a complete noncompact shrinking gradient Ricci soliton. Using the steady gradient Ricci soliton, w…

Natural metric structures on the tangent bundle and tangent sphere bundles $S_rM$ of a Riemannian manifold $M$ with radius function $r$ enclose many important unsolved problems. Admitting metric connections on $M$ with torsion, we deduce the equations of induced metric connections on those bundles. Then the equations o…

Matter-antimatter asymmetry is one of the major unsolved problems in physics that can be probed through precision measurements of charge-parity symmetry violation at current and next-generation neutrino oscillation experiments. In this work, we demonstrate the capability of variational autoencoders and normalizing flow…

Proposes a credit scoring system for Aave accounts.

The question of whether a closed Riemannian manifold has infinitely many geometrically distinct closed geodesics has a long history. Though unsolved in general, it is well understood in the case of surfaces. For surfaces of revolution diffeomorphic to the sphere, a refinement of this problem was introduced by Borzellin…

In reinforcement learning (RL), temporal abstraction still remains as an important and unsolved problem. The options framework provided clues to temporal abstraction in the RL, and the option-critic architecture elegantly solved the two problems of finding options and learning RL agents in an end-to-end manner. However…

This paper introduces and solves the simultaneous source separation and phase retrieval (S$^3$PR) problem. S$^3$PR is an important but largely unsolved problem in a number application domains, including microscopy, wireless communication, and imaging through scattering media, where one has multiple independent coherent…

The use of alternative measures to evaluate classifier performance is gaining attention, specially for imbalanced problems. However, the use of these measures in the classifier design process is still unsolved. In this work we propose a classifier designed specifically to optimize one of these alternative measures, nam…

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure braid group and into the area-preserving diffeomorphism groups of the 2--disk an…

In the present paper, we describe new approaches for constructing virtual knot invariants. The main background of this paper comes from formulating and bringing together the ideas of biquandle (Kauffman and Radford) the virtual quandle (Manturov), the ideas of quaternion biquandles by Roger Fenn and Andrew Bartholomew,…

In his 1957 paper, John Milnor introduced link invariants which measure the homotopy class of the longitudes of a link relative to the lower central series of the link group. Consequently, these invariants determine the lower central series quotients of the link group. This work has driven decades of research with prof…

We solve the local equivalence problem for second order (smooth or analytic) ordinary differential equations. We do so by presenting a {\em complete convergent normal form} for this class of ODEs. The normal form is optimal in the sense that it is defined up to the automorphism group of the model (flat) ODE $y"=0$. For…

Paper proves rigidity theorems for geodesically reversible Finsler metrics.

Paper solves Musielak-Orlicz-Gauss image problem using parabolic flows.

The paper explores rigidity of hypersurfaces with constant curvature in Euclidean spaces.

In this paper, we derive a new handy integral equation for the free-boundary of infinite time horizon, continuous time, stochastic, irreversible investment problems with uncertainty modeled as a one-dimensional, regular diffusion $X$. The new integral equation allows to explicitly find the free-boundary $b(\cdot)$ in s…

Extending methods first used by Casson, we show how to verify a hyperbolic structure on a finite triangulation of a closed 3-manifold using interval arithmetic methods. A key ingredient is a new theoretical result (akin to a theorem by Neumann-Zagier and Moser for ideal triangulations upon which HIKMOT is based) showin…

The topological Tverberg conjecture was considered a central unsolved problem of topological combinatorics. The conjecture asserts that for any integers $r,d>1$ and any continuous map $f:Δ\to\mathbb R^d$ of the $(d+1)(r-1)$-dimensional simplex there are pairwise disjoint faces $σ_1,\ldots,σ_r\subsetΔ$ such that $f(σ_1)…

K-means is a classical clustering algorithm with wide applications. However, soft K-means, or fuzzy c-means at m=1, remains unsolved since 1981. To address this challenging open problem, we propose a novel clustering model, i.e. Probabilistic K-Means (PKM), which is also a nonlinear programming model constrained on lin…

An integral hyperbolic lattice is called reflective if its automorphism group is generated by reflections, up to finite index. Since 1981, it is known that their number is essentially finite. We show that K3 surfaces over C with reflective Picard lattices can be characterized in terms of compositions of their self-corr…

Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two nodes, or the expected weight of a minimum spanning tree of the graph, etc. These sta…

In the present paper, we introduce $\mathbb{Z}_2$-braids and, more generally, $G$-braids for an arbitrary group $G$. They form a natural group-theoretic counterpart of $G$-knots, see \cite{reidmoves}. The underlying idea, used in the construction of these objects --- decoration of crossings with some additional informa…

Integrating visual and linguistic information into a single multimodal representation is an unsolved problem with wide-reaching applications to both natural language processing and computer vision. In this paper, we present a simple method to build multimodal representations by learning a language-to-vision mapping and…

We study the abelianization of Kontsevich's Lie algebra associated with the Lie operad and some related problems. Calculating the abelianization is a long-standing unsolved problem, which is important in at least two different contexts: constructing cohomology classes in $H^k(\mathrm{Out}(F_r);\mathbb Q)$ and related g…

To a branched cover f between orientable surfaces one can associate a certain branch datum D(f), that encodes the combinatorics of the cover. This D(f) satisfies a compatibility condition called the Riemann-Hurwitz relation. The old but still partly unsolved Hurwitz problem asks whether for a given abstract compatible …

Efficient exploration is an unsolved problem in Reinforcement Learning which is usually addressed by reactively rewarding the agent for fortuitously encountering novel situations. This paper introduces an efficient active exploration algorithm, Model-Based Active eXploration (MAX), which uses an ensemble of forward mod…

Empirical risk minimization is the main tool for prediction problems, but its extension to relational data remains unsolved. We solve this problem using recent ideas from graph sampling theory to (i) define an empirical risk for relational data and (ii) obtain stochastic gradients for this empirical risk that are autom…

Survey on mean curvature flow with sphere theorems and Yau rigidity theory.

New algorithm tackles optimization with distributed constraints.

The inverse problem of the calculus of variations consists in determining if the solutions of a given system of second order differential equations correspond with the solutions of the Euler-Lagrange equations for some regular Lagrangian. This problem in the general version remains unsolved. Here, we contribute to it w…

We obtain a number of finiteness results for groups acting on Gromov-hyperbolic spaces. In particular we show that a torsion-free locally quasiconvex hyperbolic group has only finitely many conjugacy classes of $n$-generated one-ended subgroups. We also show that the rank problem is solvable for the class of torsion-fr…