arXiv research

New findings on stable commutator lengths in recursively presented groups.

New family of braided Thompson groups introduced using recursive braids.

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…

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.

New method for PKM inverse dynamics second derivatives efficiently.

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…

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

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…

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 …

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…

Robustifies tree learning algorithms for corrupted data.

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.

New Coxeter groups have unique boundary structures.

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…

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 …

Classifies homomorphisms between specific braid groups.

Let IA_n be the Torelli subgroup of Aut(F_n). We give an explicit finite set of generators for H_2(IA_n) as a GL_n(Z)-module. Corollaries include a version of surjective representation stability for H_2(IA_n), the vanishing of the GL_n(Z)-coinvariants of H_2(IA_n), and the vanishing of the second rational homology grou…

The materials accompany a lecture short course presented at the 2011 Park City Mathematics Institute, Graduate Summer School on Moduli Spaces of Riemann Surfaces. The lectures were part of/coordinated with an overall program, including lectures by Ursula Hamenstadt on Teichmueller Theory, Andy Putman on Mapping Class a…

New recursive algorithm estimates conditional kernel mean embeddings in Hilbert space.

We present several formulas for the traces of elements in complex hyperbolic triangle groups generated by complex reflections. The space of such groups of fixed signature is of real dimension one. We parameterise this space by a real invariant alpha of triangles in the complex hyperbolic plane. The main result of the p…

Paper develops geometry for Kleinian groups using Farey polynomials.

Paper presents novel online MTL methods using WRLS and OSLSSVR.

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 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 …

The second author and Norbury initiated the enumeration of lattice points in the Deligne-Mumford compactifications of moduli spaces of curves. They showed that the enumeration may be expressed in terms of polynomials, whose top and bottom degree coefficients store psi-class intersection numbers and orbifold Euler chara…

R2-B2 optimizes game interactions with recursive reasoning.

Using the duality between Wilson loop expectation values of SU(N) Chern-Simons theory on $S^3$ and topological open-string amplitudes on the local mirror of the resolved conifold, we study knots on $S^3$ and their invariants encoded in colored HOMFLY polynomials by means of topological recursion. In the context of the …

Novel method recursively partitions sample space for density estimation.

Theoretical study on AI models' resilience to data contamination during recursive training.

Improved Heston model produces steeper smile for short maturities.

Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation. While these algorithms perform well for bi-partitioning tasks, their recursive extensions yield unimpressive results for multiclass clustering tasks. This paper presents a g…

In this Article, a fast numerical numerical algorithm for pricing discrete double barrier option is presented. According to Black-Scholes model, the price of option in each monitoring date can be evaluated by a recursive formula upon the heat equation solution. These recursive solutions are approximated by using Legend…

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…

In the spirit of [Surya07'], we develop an average problem approach to prove the optimality of threshold type strategies for optimal stopping of Lévy models with a continuous additive functional (CAF) discounting. Under spectrally negative models, we specialize this in terms of conditions on the reward function and ran…

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.

This paper reviews graph convolutional neural networks (GCNNs) through the lens of edge-variant graph filters. The edge-variant graph filter is a finite order, linear, and local recursion that allows each node, in each iteration, to weigh differently the information of its neighbors. By exploiting this recursion, we fo…

Most of the existing solutions to enterprise threat management are preventive approaches prescribing means to prevent policy violations with varying degrees of success. In this paper we consider the complementary scenario where a number of security violations have already occurred, or security threats, or vulnerabiliti…

AdaVol adapts QML for real-time GARCH volatility prediction.

This study presents a rapid multiple incremental and decremental mechanism based on Weight-Error Curves (WECs) for support-vector analysis. Recursion-free computation is proposed for predicting the Lagrangian multipliers of new samples. This study examines Ridge Support Vector Models, subsequently devising a recursion-…

Paper defines Farey Recursive Functions and explores their properties.

We present an integrated approach for structure and parameter estimation in latent tree graphical models. Our overall approach follows a "divide-and-conquer" strategy that learns models over small groups of variables and iteratively merges onto a global solution. The structure learning involves combinatorial operations…

Guichard's transformations generate Voss surfaces from sine-Gordon solutions.

Paper computes Alexander polynomials for arborescent links.