A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.
Estimating the difficulty level of math word problems is an important task for many educational applications. Identification of relevant and irrelevant sentences in math word problems is an important step for calculating the difficulty levels of such problems. This paper addresses a novel application of text categoriza…
Constructing accurate and automatic solvers of math word problems has proven to be quite challenging. Prior attempts using machine learning have been trained on corpora specific to math word problems to produce arithmetic expressions in infix notation before answer computation. We find that custom-built neural networks…
We use Klyachko's methods [A funny property of sphere and equations over groups, Comm. in Alg. 21 (1993) 2555--2575] (see also Fenn-Rourke, L'Enseignment Math. 42 (1996) 49--74 and math.GR/9810184 and Cohen-Rourke, math.GR/0009101) to prove that, if a 1-cell and a 2-cell are added to a complex with torsion-free fundame…
When a bilingual student learns to solve word problems in math, we expect the student to be able to solve these problem in both languages the student is fluent in,even if the math lessons were only taught in one language. However, current representations in machine learning are language dependent. In this work, we pres…
We incorporate Tensor-Product Representations within the Transformer in order to better support the explicit representation of relation structure. Our Tensor-Product Transformer (TP-Transformer) sets a new state of the art on the recently-introduced Mathematics Dataset containing 56 categories of free-form math word-pr…
MathChat uses LLM agents to solve challenging math problems through conversational problem-solving.
We survey what is known about singularities of special Lagrangian submanifolds (SL m-folds) in (almost) Calabi-Yau manifolds. The bulk of the paper summarizes the author's five papers math.DG/0211294, math.DG/0211295, math.DG/0302355, math.DG/0302356, math.DG/0303272 on SL m-folds X with isolated conical singularities.…
This paper presents a number of problems about mapping class groups and moduli space. The paper will appear in the book "Problems on Mapping Class Groups and Related Topics", ed. by B. Farb, Proc. Symp. Pure Math. series, Amer. Math. Soc.
Riemannian and pseudo-Riemannian symmetric spaces with semisimple transvection group are known and classified for a long time. Contrary to that the description of pseudo-Riemannian symmetric spaces with non-semisimple transvection group is an open problem. In the last years some progress on this problem was achieved. I…
3-manifold groups' word problem solved in nearly linear time.
This paper presents fifteen problems about mapping class groups. It is an expanded and updated version of the author's preprint "Ten problems on the mapping class groups". The paper will appear in the book "Problems on Mapping Class Groups and Related Topics", ed. by B. Farb, Proc. Symp. Pure Math. series, Amer. Math. …
Algorithm solves word problem in mapping class group quickly.
Study shows challenges in reinforcement learning math problems, proposing enhancements and a hardness measure.
We study how well one can recover sparse principal components of a data matrix using a sketch formed from a few of its elements. We show that for a wide class of optimization problems, if the sketch is close (in the spectral norm) to the original data matrix, then one can recover a near optimal solution to the optimiza…
There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm{ü}ller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of su…
This text proposes geometrical descriptions of all variational problems invariant by conformal transformations in two variables. First a characterisation in terms of C-Finsler manifolds, a suitable generalization of Finsler manifolds, is given. Second Hamiltonian formalisms are explored, with an emphasis on Caratheodor…
We give topological lower bounds on the number of periodic and closed trajectories in strictly convex smooth billiards. We use variational reduction admitting a finite group of symmetries and apply topological approach based on equivariant Morse and Lusternik - Schnirelman theories. The paper continues results publishe…
Existing approaches for automatically generating mathematical word problems are deprived of customizability and creativity due to the inherent nature of template-based mechanisms they employ. We present a solution to this problem with the use of deep neural language generation mechanisms. Our approach uses a Character …
We give a solution to the word problem for the singular braid monoid SB_n. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically reprove a result of Fenn, Keyman and Rourke that the monoid embeds into a group an…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated group has the word problem solvable in subexponential time and has a subgroup of…
This is no longer available.
We show a simple and easily implementable solution to the word problem for virtual braid groups.
Among the six challenges of neural machine translation (NMT) coined by (Koehn and Knowles, 2017), rare-word problem is considered the most severe one, especially in translation of low-resource languages. In this paper, we propose three solutions to address the rare words in neural machine translation systems. First, we…
The goal of this article was the S^1-equivariant transversality-problem and the compactification-problem for the moduli spaces of (perturbed) PU(2)-monopoles. A substantially improved version entitled "Moduli spaces of PU(2)-monopoles (revised version)" which gives simpler, clearer proofs of the transversality results,…
Enhances math problem-solving models with multi-turn preference learning.
The papers math.QA/0403527 and math.QA/0409414 v.1 are now merged together. The final version is available at math.QA/0409414 v.2. To avoid duplication of papers, math.QA/0403527 is now removed.
Word translation is a problem in machine translation that seeks to build models that recover word level correspondence between languages. Recent approaches to this problem have shown that word translation models can learned with very small seeding dictionaries, and even without any starting supervision. In this paper w…
In their paper `A new algorithm for recognizing the unknot', in Geometry and Topology', 2 (1998) n. 9, 175-220, the first author and Michael Hirsch presented a then new algorithm for recognizing the unknot. The first part of the algorithm required the systematic enumeration of all discs which support a `braid foliation…
Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed, geometric 3-manifolds is algorithmically recognizable. In our terminology, the …
Rapid progress has been made recently on symmetry breaking operators for real reductive groups. Based on Program A-C for branching problems (T.Kobayashi [Progr.Math.2015]), we illustrate a scheme of the classification of (local and nonlocal) symmetry breaking operators by an example of conformal representations on diff…
Word embedding is a powerful tool in natural language processing. In this paper we consider the problem of word embedding composition \--- given vector representations of two words, compute a vector for the entire phrase. We give a generative model that can capture specific syntactic relations between words. Under our …
We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem. If the group is not word-hyperbolic, the procedure continues indefinitely. We a…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these results follow from observing that automorphisms of the free group strongly resemble s…
This paper proposes for every , linear time reductions of the word and conjugacy problems on the braid groups to the corresponding problems on the braid monoids and moreover only using positive words representations.
-stratifolds are a generalization of -manifolds in that there are disjoint simple closed curves where several sheets meet. We show that the word problem for fundamental groups of -stratifolds is solvable.
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive current research. We look at the braid group from a topological point of view (rather …
Text classification has become indispensable due to the rapid increase of text in digital form. Over the past three decades, efforts have been made to approach this task using various learning algorithms and statistical models based on bag-of-words (BOW) features. Despite its simple implementation, BOW features lack se…
We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w|^2 g^2). We also carry out the same method…
Simple framework decouples word alignment and multilingual embedding mapping.
Word evolution refers to the changing meanings and associations of words throughout time, as a byproduct of human language evolution. By studying word evolution, we can infer social trends and language constructs over different periods of human history. However, traditional techniques such as word representation learni…
We describe several configurations of clasped ropes which are balanced and thus critical for the Gehring ropelength problem of arXiv:math.DG/0402212.
Transformer model estimates keywords for better audio captioning.
Embedding words in a vector space has gained a lot of attention in recent years. While state-of-the-art methods provide efficient computation of word similarities via a low-dimensional matrix embedding, their motivation is often left unclear. In this paper, we argue that word embedding can be naturally viewed as a rank…
While the celebrated Word2Vec technique yields semantically rich representations for individual words, there has been relatively less success in extending to generate unsupervised sentences or documents embeddings. Recent work has demonstrated that a distance measure between documents called \emph{Word Mover's Distance…
The article introduces a new set of Polish word embeddings, built using KGR10 corpus, which contains more than 4 billion words. These embeddings are evaluated in the problem of recognition of temporal expressions (timexes) for the Polish language. We described the process of KGR10 corpus creation and a new approach to …
New algorithms solve word and conjugacy problems in braid group B3.
Because of the relevance of the results, this paper is merged into the paper titled "On the Number of Solutions to Asymptotic Plateau Problem" (arXiv:math.DG/0505593) as a new section.