Related papers: The tail of a quantum spin network

The concept of pseudo q-factorization graphs was recently introduced by the last two authors as a combinatorial language which is suited for capturing certain properties of Drinfeld polynomials. Using certain known representation theoretic…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

The Rogers-Ramanujan identity for $\!\!\phantom{|}_1\psi_1$ $$ \sum_{n\in\mathbb{Z}} \frac{(a;q)_n}{(b;q)_n} z^n\;=\; \frac{(q,b/a,az,q/az;q)_\infty}{(b,q/a,z,b/az;q)_\infty} $$ can be classified as one related to the Bethe Ansatz for…

The spined cube $SQ_n$ is a variant of the hypercube $Q_n$, introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for parallel computing. A graph $\G$ is an $m$-Cayley graph if its…

Let $Y=\sum_{k\ge 1} 1_{A_k}$ be an infinite sum of the indicators of independent events. We investigate a precise (as opposed to logarithmic) first-order asymptotic behavior of the tail probabilities $\mathbb{P}\{Y\ge n\}$ and the point…

Let $k \geq 2$ be an integer. Let $q$ be a prime power such that $q \equiv 1 \pmod {k}$ if $q$ is even, or, $q \equiv 1 \pmod {2k}$ if $q$ is odd. The generalized Paley graph of order $q$, $G_k(q)$, is the graph with vertex set…

The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q= root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin…

This article gives the foundations of the colored Jones polynomial for singular knots. We extend Masbum and Vogel's algorithm to compute the colored Jones polynomial for any singular knot. We also introduce the tail of the colored Jones…

We prove several power series identities involving the refined generating function of interval orders, as well as the refined generating function of the self-dual interval orders. These identities may be expressed as $\sum_{n\ge…

Let $V$ denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations $A: V\rightarrow V$ and $A^*: V\rightarrow V$ that satisfy (i) and (ii) below. (i) There exists a basis for $V$ with respect…

A conjecture connected with quantum physics led N. Katz to discover some amazing mixed character sum identities over a field of q elements, where q is a power of a prime p > 3. His proof required deep algebro-geometric techniques, and he…

A {\it tiered graph} $G=(V,E)$ with $m $ tiers is a simple graph with $V\subseteq \brk{n}$, where $\brk{n}=\{1,2,\cdots,n\}$, and with a surjective map $t$ from $V$ to $\brk{m}$ such that if $v$ is a vertex adjacent to $v'$ in $G$ with…

We study $q$-pushTASEP, a discrete time interacting particle system whose distribution is related to the $q$-Whittaker measure. We prove a uniform in $N$ lower tail bound on the fluctuation scale for the location $x_N(N)$ of the right-most…

We give explicit bounds for the tail probabilities for sums of independent geometric or exponential variables, possibly with different parameters.

We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the…

Recently some papers, such as Aban, Meerschaert and Panorska (2006), Nuyts (2010) and Clark (2013), have drawn attention to possible truncation in Pareto tail modelling. Sometimes natural upper bounds exist that truncate the probability…

Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$, called `terminal pairs'. Escaping a subset $X\subset T\cap Q$ from $Q$ means finding edge disjoint paths from the…

The purpose of this note is to explain the structure, general strategy, and main ideas of the proof in the work of Huang, McKenzie, and Yau (2024) on the Ramanujan property and edge universality of random regular graphs. The core of the…

We formulate a conjecture (already proven by A. Kricker) about the structure of Kontsevich integral of a knot. We describe its value in terms of the generating functions for the numbers of external edges attached to closed 3-valent…

For fixed integers p and q, let f(n,p,q) denote the minimum number of colors needed to color all of the edges of the complete graph K_n such that no clique of p vertices spans fewer than q distinct colors. A construction is given which…