arXiv research

The paper calculates the number of oriented rational links with a given deficiency.

Lee's work on twisted torus knots with Fibonacci parameters is extended to Horadam parameters.

Fibonacci Ensembles use Fibonacci weights to improve ensemble learning, inspired by natural growth patterns.

New proof shows how to fill a square with Fibonacci curve.

The study finds new infinite dilogarithm identities related to number sequences and continued fractions.

Study examines Bitcoin's price history and identifies recurring events.

Universal preconditioning reduces sequential prediction regret.

We show that the Conway polynomials of Fibonacci links are Fibonacci polynomials modulo 2. We deduce that, when $ n \not\equiv 0 \Mod 4$ and $(n,j) \neq (3,3),$ the Fibonacci knot $ \cF_j^{(n)} $ is not a Lissajous knot.

Study hyperbolic geometry to find Fibonacci numbers.

The paper computes groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.

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

The paper encloses computation of simple centralizer of simple braids and their connection with Fibonacci numbers. Planarity of some commuting graphs is also discussed in the last section.

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…

Odd Fibonacci groups cannot form hyperbolic 3-orbifolds.

We study the cyclic presentations with relators of the form $x_ix_{i+m}x_{i+k}^{-1}$ and the groups they define. These "groups of Fibonacci type" were introduced by Johnson and Mawdesley and they generalize the Fibonacci groups $F(2,n)$ and the Sieradski groups $S(2,n)$. With the exception of two groups, we classify wh…

New rank 3 distributions with exponentially growing symmetries.

Quantum representations of mapping class groups are locally rigid at prime levels.

Two new feature selection algorithms improve on RFE.

Study connects lens spaces' fundamental group to their symplectic fillings' second Betti numbers.

Topological quantum computation with Fibonacci anyons relies on the possibility of efficiently generating unitary transformations upon pseudoparticles braiding. The crucial fact that such set of braids has a dense image in the unitary operations space is well known; in addition, the Solovay-Kitaev algorithm allows to a…

Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there …

Suppose C is a singular curve in CP^2 and it is topologically an embedded surface of genus g; such curves are called cuspidal. The singularities of C are cones on knots K_i. We apply Heegaard Floer theory to find new constraints on the sets of knots {K_i} that can arise as the links of singularities of cuspidal curves.…

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings in terms of their generating functions. We show in particular how Fibonacci numb…

We establish two-sided bounds for the complexity of two infinite series of closed orientable 3-dimensional hyperbolic manifolds, the Lobell manifolds and the Fibonacci manifolds.

The twin group $T_n$ is a right angled Coxeter group generated by $n-1$ involutions and the pure twin group $PT_n$ is the kernel of the natural surjection from $T_n$ onto the symmetric group on $n$ symbols. In this paper, we investigate some structural aspects of these groups. We derive a formula for the number of conj…

Matrix formulas for super Teichmüller spaces generalize previous work and yield super λ-lengths.

Introduction 1. The two-eigenvalue problem 2. Hecke algebra representations of braid groups 3. Duality of Jones-Wenzl representations 4. Closed images of Jones-Wenzl sectors 5. Distribution of evaluations of Jones polynomials 6. Fibonacci representations

A latent force model is a Gaussian process with a covariance function inspired by a differential operator. Such covariance function is obtained by performing convolution integrals between Green's functions associated to the differential operators, and covariance functions associated to latent functions. In the classica…

A latent function decomposition method is proposed for forecasting the capacity of lithium-ion battery cells. The method uses the Multi-Output Gaussian Process, a generative machine learning framework for multi-task and transfer learning. The MCGP decomposes the available capacity trends from multiple battery cells int…

S4 model improves long sequence modeling efficiency.

Study shows aperiodic sequences enhance Parrondo's effect, with Thue-Morse outperforming others.

To construct flexible nonlinear predictive distributions, the paper introduces a family of softplus function based regression models that convolve, stack, or combine both operations by convolving countably infinite stacked gamma distributions, whose scales depend on the covariates. Generalizing logistic regression that…

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it equals the minimum number of Goda-Scharlemann-Thompson tunnel moves needed to con…

Large-batch stochastic gradient descent (SGD) is widely used for training in distributed deep learning because of its training-time efficiency, however, extremely large-batch SGD leads to poor generalization and easily converges to sharp minima, which prevents naive large-scale data-parallel SGD (DP-SGD) from convergin…

Previous literature on unsupervised learning focused on designing structural priors with the aim of learning meaningful features. However, this was done without considering the description length of the learned representations which is a direct and unbiased measure of the model complexity. In this paper, first we intro…

DYMAG uses dynamic waveforms to improve graph neural networks.

The paper proves properties of quantum representations and their Toledo invariants.

SANs use sparse activation functions to compress data representations.

Characterizes unknotted curves on Seifert surfaces of twist knots.

Improved text-conditioned regression using LLMs and diffusion-based neural processes.

3D RadViz improves 3D data visualization of multidimensional datasets.

Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and relative expansion formulae and rational generating functions for Alexander-Conw…

The paper uses Seshadri constants to construct symplectic ellipsoid embeddings.

It is known that a bi-orderable group has no generalized torsion element, but the converse does not hold in general. We conjecture that the converse holds for the fundamental groups of 3-manifolds, and verify the conjecture for non-hyperbolic, geometric 3-manifolds. We also confirm the conjecture for some infinite fami…

We present an efficient and practical algorithm for the online prediction of discrete-time linear dynamical systems with a symmetric transition matrix. We circumvent the non-convex optimization problem using improper learning: carefully overparameterize the class of LDSs by a polylogarithmic factor, in exchange for con…

The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length $k$ whose maximal lexicographic repres…

We show that several torsion free 3-manifold groups are not left-orderable. Our examples are groups of cyclic branched covers of S^3 branched along links. The figure eight knot provides simple nontrivial examples. The groups arising in these examples are known as Fibonacci groups which we show not to be left-orderable.…

New risk models use chaotic attractors to predict extreme events.