Related papers: Taming the hydra: the word problem and extreme int…
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…
Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…
We establish distortion estimates in completely solvable Lie groups, using a sublinear bilipschitz retraction constructed by Cornulier, and interpolating between two theorems of Osin. This provides new lower bounds on Dehn functions. Our…
Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This…
Assuming the Generalised Riemann Hypothesis, we prove a sharp upper bound on moments of shifted Dirichlet $L$-functions. We use this to obtain conditional upper bounds on high moments of theta functions. Both of these results strengthen…
We explore contemporary, data-driven techniques for solving math word problems over recent large-scale datasets. We show that well-tuned neural equation classifiers can outperform more sophisticated models such as sequence to sequence and…
In this note, we study the notion of random Dehn function and compute an asymptotic upper bound for finitely presented acylindrically hyperbolic groups whose Dehn function is at most polynomial. By showing that in these cases, if the group…
Strings are a natural representation of biological data such as DNA, RNA and protein sequences. The problem of finding a string that summarizes a set of sequences has direct application in relative compression algorithms for genome and…
We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…
The main result of this thesis is to show that there are only finitely many integers $n$ such that both $n$ and $d(n)$ are highly composite numbers at the same time, where $d(n)$ is the divisor function. Bertrand's postulate [4] is used…
We show that if the Sch\"{u}tzenberger graph of every positive word, that contains an $R$-word only once as it's subword, is finite over an Adain presentation $\langle X|u=v\rangle$, then the Sch\"{u}tzenberger graph of every positive word…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We propose `Dracula', a new framework for unsupervised feature selection from sequential data such as text. Dracula learns a dictionary of $n$-grams that efficiently compresses a given corpus and recursively compresses its own dictionary;…
We are interested in the numerical solution of large systems of hyperbolic conservation laws or systems in which the characteristic decomposition is expensive to compute. Solving such equations using finite volumes or Discontinuous Galerkin…
In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case…
This paper deals with the two fundamental problems concerning the handling of large n-gram language models: indexing, that is compressing the n-gram strings and associated satellite data without compromising their retrieval speed; and…
We exhibit explicit and easily realisable bijections between Hecke--Kiselman monoids of type $A_n$/$\widetilde{A}_n$; certain braid diagrams on the plane/cylinder; and couples of integer sequences of particular types. This yields a fast…
Recurrent neural networks have proved to be an effective method for statistical language modeling. However, in practice their memory and run-time complexity are usually too large to be implemented in real-time offline mobile applications.…
Recently Ermon et al. (2013) pioneered a way to practically compute approximations to large scale counting or discrete integration problems by using random hashes. The hashes are used to reduce the counting problem into many separate…
It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using…