Related papers: The tail of a quantum spin network

The tail of a quantum spin network in the two-sphere is a $q$-series associated to the network. We study the existence of the head and tail functions of quantum spin networks colored by $2n$. We compute the $q$-series for an infinite family…

The colored Jones polynomial is a $q$-polynomial invariant of links colored by irreducible representations of a simple Lie algebra. A $q$-series called a tail is obtained as the limit of the $\mathfrak{sl}_2$ colored Jones polynomials…

The tail of the colored Jones polynomial of an alternating link is a $q$-series invariant whose first $n$ terms coincide with the first $n$ terms of the $n$-th colored Jones polynomial. Recently, it has been shown that the tail of the…

We obtain first decay rates of probabilities of tails of multivariate polynomials built on independent random variables with heavy tails. Then we derive stable limit theorems for nonconventional sums of the form $\sum_{Nt\geq n\geq…

We extend the table of Garoufalidis, Le and Zagier concerning conjectural Rogers-Ramanujan type identities for tails of colored Jones polynomials to all alternating knots up to 10 crossings. We then prove these new identities using q-series…

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 $\omega q$…

The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields. We study an old problem of Linial…

Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This…

A graph $G$ is a $k$-prime product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the product of at most $k$ primes. A graph has prime product…

We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…

A new sums-of-tails identity involving two parameters $b$ and $d$ is obtained and is used to derive more results of similar type. One of Ramanujan's sums-of-tails identities from the Lost Notebook is shown to be a special case of our…

Let $q$ be a prime power such that $q\equiv 1\pmod{4}$. The Paley graph of order $q$ is the graph with vertex set as the finite field $\mathbb{F}_q$ and edges defined as, $ab$ is an edge if and only if $a-b$ is a non-zero square in…

This paper investigates the asymptotics of the number of prime values taken by a polynomial in several variables with integer coefficients. Based on probabilistic heuristics and the multidimensional Bateman Horn conjecture, the expected…

In this article, a finite analogue of the generalized sum-of-tails identity of Andrews and Freitas is obtained. We derive several interesting results as special cases of this analogue, in particular, a recent identity of Dixit, Eyyyunni,…

Recently, a relation between Schreier-type sets and Tur\'{a}n graphs was discovered. In this note, we give a combinatorial proof and obtain a generalization of the relation. Specifically, for $p, q\ge 1$, let $$\mathcal{A}_q :=…

In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…

We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…

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…

To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…

We prove tail estimates for variables $\sum_i f(X_i)$, where $(X_i)_i$ is the trajectory of a random walk on an undirected graph (or, equivalently, a reversible Markov chain). The estimates are in terms of the maximum of the function $f$,…