arXiv research

Equivalent condition found for q-holonomic sequences.

A sequence $f_n(q)$ is $q$-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in $q$ and $q^n$. Our main theorems state that $q$-holonomicity is preserved under twisting, i.e., replacing $q$ by $ωq$ where $ω$ is a complex root of unity, and under the substitution $q \to q^α$ where $α…

The SL_3 colored Jones polynomial of the trefoil knot is a $q$-holonomic sequence of two variables with natural origin, namely quantum topology. The paper presents an explicit set of generators for the annihilator ideal of this $q$-holonomic sequence as a case study. On the one hand, our results are new and useful to q…

A sequence of rational functions in a variable $q$ is $q$-holonomic if it satisfies a linear recursion with coefficients polynomials in $q$ and $q^n$. We prove that the degree of a $q$-holonomic sequence is eventually a quadratic quasi-polynomial. Our proof uses differential Galois theory (adapting proofs regarding hol…

New homologies prove $q$-holonomicity of knot polynomials.

Quantum invariants from $U_h\mathfrak{sl}(2|1)$ are q-holonomic.

Introduces modular $q$-holonomic modules to solve $q$-difference equations.

The colored Jones function of a knot is a sequence of Laurent polynomials. It was shown by TTQ. Le and the author that such sequences are $q$-holonomic, that is, they satisfy linear $q$-difference equations with coefficients Laurent polynomials in $q$ and $q^n$. We show from first principles that $q$-holonomic sequence…

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

We compute q-holonomic formulas for the HOMFLY polynomials of 2-bridge links colored with one-column (or one-row) Young diagrams.

We formulate a stability conjecture for the coefficients of the colored Jones polynomial of a knot, colored by irreducible representations in a fixed ray of a simple Lie algebra, and verify it for all torus knots and all simple Lie algebras of rank $2$. Our conjecture is motivated by a structure theorem for the degree …

We prove that the colored HOMFLY polynomial of a link, colored by symmetric or exterior powers of the fundamental representation, is q-holonomic with respect to the color parameters. As a result, we obtain the existence of an (a,q) super-polynomial of all knots in 3-space. Our result has implications on the quantizatio…

We prove that the HOMFLYPT polynomial of a link, colored by partitions with a fixed number of rows is a $q$-holonomic function. Specializing to the case of knots colored by a partition with a single row, it proves the existence of an $(a,q)$ super-polynomial of knots in 3-space, as was conjectured by string theorists. …

A function of several variables is called holonomic if, roughly speaking, it is determined from finitely many of its values via finitely many linear recursion relations with polynomial coefficients. Zeilberger was the first to notice that the abstract notion of holonomicity can be applied to verify, in a systematic and…

Using elementary ideas from Tropical Geometry, we assign a a tropical curve to every $q$-holonomic sequence of rational functions. In particular, we assign a tropical curve to every knot which is determined by the Jones polynomial of the knot and its parallels. The topical curve explains the relation between the AJ Con…

We study q-holonomic sequences that arise as the colored Jones polynomial of knots in 3-space. The minimal-order recurrence for such a sequence is called the (non-commutative) A-polynomial of a knot. Using the "method of guessing", we obtain this polynomial explicitly for the K_p = (-2, 3, 3+2p) pretzel knots for p = -…

A classical spin network consists of a ribbon graph (i.e., an abstract graph with a cyclic ordering of the vertices around each edge) and an admissible coloring of its edges by natural numbers. The standard evaluation of a spin network is an integer number. In a previous paper, we proved an existence theorem for the as…

The paper generalizes BPS-series for $(2,2w+1)$-cabling of figure eight knot.

Constructs explicit nontrivial cycles in Habiro cohomology of smooth varieties.

Murakami-Ohtsuki-Yamada introduced an evaluation of certain oriented planar trivalent graphs with colored edges. This evaluation plays a key role in the evaluation of the colored HOMFLY polynomial of a link in 3-space and its Khovanov-Rozansky categorification. Our goal is is to give a generating series formula for the…

The colored Jones function of a knot is a sequence of Laurent polynomials in one variable, whose n-th term is the Jones polynomial of the knot colored with the n-dimensional irreducible representation of SL(2). It was recently shown by TTQ Le and the author that the colored Jones function of a knot is q-holonomic, ie, …

Verifies a conjecture for the figure eight knot.

The generalized volume conjecture and the AJ conjecture (a.k.a. the quantum volume conjecture) are extended to $U_q(\fraksl_2)$ colored quantum invariants of the theta and tetrahedron graph. The $\SL(2,\bC)$ character variety of the fundamental group of the complement of a trivalent graph with $E$ edges in $S^3$ is a L…

Let G be a simple complex algebraic group and g its Lie algebra. We show that the g-Witten-Reshetikhin-Turaev quantum invariants determine a deformation-quantization, C_q[X_G(torus)], of the coordinate ring of the G-character variety of the torus. We prove that this deformation is in the direction of the Goldman's brac…

Unified ADO and colored Jones polynomials for knots.

Although the sequence-to-sequence (encoder-decoder) model is considered the state-of-the-art in deep learning sequence models, there is little research into using this model for recovering missing sensor data. The key challenge is that the missing sensor data problem typically comprises three sequences (a sequence of o…

Classifies intrinsically linked tournaments by their score sequences.

Enhances sequence memory capacity in neural networks.

Deep generative models have been successfully used to learn representations for high-dimensional discrete spaces by representing discrete objects as sequences and employing powerful sequence-based deep models. Unfortunately, these sequence-based models often produce invalid sequences: sequences which do not represent a…

The abstract discusses a spectral sequence for Lie algebroids.

Many machine learning tasks can be expressed as the transformation---or \emph{transduction}---of input sequences into output sequences: speech recognition, machine translation, protein secondary structure prediction and text-to-speech to name but a few. One of the key challenges in sequence transduction is learning to …

Mining tasks over sequential data, such as clickstreams and gene sequences, require a careful design of embeddings usable by learning algorithms. Recent research in feature learning has been extended to sequential data, where each instance consists of a sequence of heterogeneous items with a variable length. However, m…

Paper proposes using LSTM for LSH-based sequence alignment.

Study on continuous sequence classification with distribution uncertainty.

Deep learning models optimize protein sequences.

Sequence classification is an important data mining task in many real world applications. Over the past few decades, many sequence classification methods have been proposed from different aspects. In particular, the pattern-based method is one of the most important and widely studied sequence classification methods in …

We study the Thompson sampling algorithm in an adversarial setting, specifically, for adversarial bit prediction. We characterize the bit sequences with the smallest and largest expected regret. Among sequences of length $T$ with $k < \frac{T}{2}$ zeros, the sequences of largest regret consist of alternating zeros and …

Unimodal sequences of moves connect 3-manifold triangulations.

This paper presents a novel end-to-end approach to program repair based on sequence-to-sequence learning. We devise, implement, and evaluate a system, called SequenceR, for fixing bugs based on sequence-to-sequence learning on source code. This approach uses the copy mechanism to overcome the unlimited vocabulary probl…

This work compresses sequences by treating them as continuous-time processes, enabling efficient discretization.

Characterizes sequences from two-component link diagrams.

In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we introduce the inconstancy of a sequence and we show why it seems more pertinent …

Generative adversarial nets (GAN) has been successfully introduced for generating text to alleviate the exposure bias. However, discriminators in these models only evaluate the entire sequence, which causes feedback sparsity and mode collapse. To tackle these problems, we propose a novel mechanism. It first segments th…

Researchers develop flexible kernels for biological sequences with guaranteed reliability.

A convolutional sequence to sequence non-intrusive load monitoring model is proposed in this paper. Gated linear unit convolutional layers are used to extract information from the sequences of aggregate electricity consumption. Residual blocks are also introduced to refine the output of the neural network. The partiall…

Using sequence to sequence algorithms for query expansion has not been explored yet in Information Retrieval literature nor in Question-Answering's. We tried to fill this gap in the literature with a custom Query Expansion engine trained and tested on open datasets. Starting from open datasets, we built a Query Expansi…

P3BO optimizes biological sequence design by combining multiple methods.

Undirected neural sequence models such as BERT (Devlin et al., 2019) have received renewed interest due to their success on discriminative natural language understanding tasks such as question-answering and natural language inference. The problem of generating sequences directly from these models has received relativel…