arXiv research

New family of braided Thompson groups introduced using recursive braids.

New invariant $c_{sm}$ simplifies computing geometric invariants of recursive group orbits.

We introduce a recursive adaptive group lasso algorithm for real-time penalized least squares prediction that produces a time sequence of optimal sparse predictor coefficient vectors. At each time index the proposed algorithm computes an exact update of the optimal $\ell_{1,\infty}$-penalized recursive least squares (R…

The paper computes infinitesimals for group actions on a multispace of curves.

We prove the ADO invariants are a q-holonomic family and establish recursion relations.

This paper develops efficient algorithms for multibody dynamics using screw and Lie group theory.

In this paper, the method of approximate transformation groups which was proposed by Baikov, Gazizov and Ibragimov, is extended on Hamiltonian and bi-Hamiltonian systems of evolution equations. Indeed, as a main consequence, this extended procedure is applied in order to compute the approximate conservation laws and ap…

We show that the set $SCL^{rp}$ of stable commutator lengths on recursively presented groups equals the set of non-negative right-computable numbers. Hence all non-negative algebraic or computable numbers are in $SCL^{rp}$ and $SCL^{rp}$ is not closed under subtraction. We also show that every non-negative real number …

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.

Paper develops geometry for Kleinian groups using Farey polynomials.

We propose a general theory for constructing functorial assignments $Σ\longmapsto Ω_Σ \in E(Σ)$ for a large class of functors $E$ from a certain category of bordered surfaces to a suitable target category of topological vector spaces. The construction proceeds by successive excisions of homotopy classes of embedded pai…

New method for PKM inverse dynamics second derivatives efficiently.

New spin on Hurwitz theory connects to Gromov-Witten theory and topological recursion.

Classical Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. Monotone Hurwitz numbers restrict the enumeration by imposing a further monotonicity condition on such factorisations. In …

Robustifies tree learning algorithms for corrupted data.

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 …

We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees without any redundant hidden nodes. Unlike many existing methods, the observed …

In general, Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. In this paper, we initiate the study of monotone orbifold Hurwitz numbers. These are simultaneously variations of the or…

The Darboux-Egoroff system of PDEs with any number $n\ge 3$ of independent variables plays an essential role in the problems of describing $n$-dimensional flat diagonal metrics of Egoroff type and Frobenius manifolds. We construct a recursion operator and its inverse for symmetries of the Darboux-Egoroff system and des…

Recursive neural networks have widely been used by researchers to handle applications with recursively or hierarchically structured data. However, embedded control flow deep learning frameworks such as TensorFlow, Theano, Caffe2, and MXNet fail to efficiently represent and execute such neural networks, due to lack of s…

This research connects combinatorial Teichmüller space geometry to Weil-Petersson geometry.

The paper analyzes distances and volumes in lens spaces using recursion and formulas.

Paper defines Farey Recursive Functions and explores their properties.

The paper explores generalizations of Mirzakhani's recursion and computes volumes for physical gravity models.

This paper shows that every Gromov hyperbolic group can be described by a finite subdivision rule acting on the 3-sphere. This gives a boundary-like sequence of increasingly refined finite cell complexes which carry all quasi-isometry information about the group. This extends a result from Cannon and Swenson in 1998 th…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its word problem, and generating sets of the parabolic subgroups. We also give an a…

We prove that every finitely generated group with recursive aspherical presentation embeds into a group with finite aspherical presentation. This and several known facts about groups and manifolds imply that there exists a 4-dimensional closed aspherical manifold $M$ such that the fundamental group $π_1(M)$ coarsely co…

New Coxeter groups have unique boundary structures.

We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from the commutator subgroup of the braid group on $n$ strands to the braid group on …

Tab-TRM uses recursive model for insurance pricing on tabular data.

$R$-coloured knot polynomials for $m$-strand torus knots $Torus_{[m,n]}$ are described by the Rosso-Jones formula, which is an example of evolution in $n$ with Lyapunov exponents, labelled by Young diagrams from $R^{\otimes m}$. This means that they satisfy a finite-difference equation (recursion) of finite degree. For…

New recursion formula for non-orientable surfaces resolves divergences.

Harer and Zagier proved a recursion to enumerate gluings of a $2d$-gon that result in an orientable genus $g$ surface, in their work on Euler characteristics of moduli spaces of curves. Analogous results have been discovered for other enumerative problems, so it is natural to pose the following question: how large is t…

This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.

The article improves prediction by aggregating Kalman recursions online.

Solves a recursion for Gromov-Witten invariants of the unknot.

New recursion found for hyperbolic sphere volumes.

This work generalizes a formula linking Seiberg-Witten prepotential and topological recursion.

LASER compresses recursive model activations by exploiting their low-dimensional structure.

New results on homology torsion growth for various groups.

We describe a method for recursively calculating Gromov-Witten invariants of all blowups of the projective plane. This recursive formula is different from the recursive formulas due to Göttsche and Pandharipande in the zero genus case, and Caporaso and Harris in the case of no blowups. We use tropical curves and a recu…

Breaking symmetry in training data is key for generalization in feature learning kernels.

Topological recursion recovers a specific partition function for colored knots.

We derive the Do and Norbury recursion formula for the one-loop mean of an irregular spectral curve from a variant of replica method by Brezín and Hikami. We express this recursion in special times in which all terms $W_1^{(g)}$ of the genus expansion of the one-loop mean are polynomials. We find a generalization of th…

This paper concerns the recursive utility maximization problem under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a s…

We derive a recursion relation for hyperbolic string vertices and apply it to string field theory.

Benchmarking recursive collapse claims with a new framework under false-positive control.

SRRM improves recursive transport surrogates in the small-discrepancy regime.