Related papers: Mock Alexander Polynomials

We extend the notion of link colorings with values in an Alexander quandle to link colorings with values in a module $M$ over the Laurent polynomial ring $\Lambda_{\mu}=\mathbb{Z}[t_1^{\pm1},\dots,t_{\mu}^{\pm1}]$. If $D$ is a diagram of a…

We explore the codimension one strata in the degree-one cohomology jumping loci of a finitely generated group, through the prism of the multivariable Alexander polynomial. As an application, we give new criteria that must be satisfied by…

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…

We show how the multivariable signature and Alexander polynomial of a colored link can be computed from a single symmetric matrix naturally defined from a colored link diagram. In the case of a single variable, it coincides with the matrix…

Quasi-alternating links are a natural generalization of alternating links. In this paper, we show that quasi-alternating links are "homologically thin" for both Khovanov homology and knot Floer homology. In particular, their bigraded…

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

We give new characterizations of the algebra $\mathscr{L}_n(\mathbb{F}_{q^n})$ formed by all linearized polynomials over the finite field $\mathbb{F}_{q^n}$ after briefly surveying some known ones. One isomorphism we construct is between…

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be…

This article is based on the lectures in the Winter Braids V (Pau, Feb. 2015). Main puposel of this is to explain how to compute twisted Alexander polynomials for non-experts.

Let $k_i\ (i=1,2,\ldots,t)$ be natural numbers with $k_1>k_2>\cdots>k_t>0$, $k_1\geq 2$ and $t<k_1.$ Given real numbers $\alpha_{ji}\ (1\leq j\leq t,\ 1\leq i\leq s)$, we consider polynomials of the shape…

Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

Smeared link fermionic actions can be straightforwardly simulated with partial-global updating. The efficiency of this simulation is greatly increased if the fermionic matrix is written as a product of several near-identical terms. Such a…

The aim of this paper is to start the study of images of graded polynomials on full matrix algebras. We work with the matrix algebra $M_n(K)$ over a field $K$ endowed with its canonical $\mathbb{Z}_n$-grading (Vasilovsky's grading). We…

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

If the twist numbers of a collection of oriented alternating link diagrams are bounded, then the Alexander polynomials of the corresponding links have bounded euclidean Mahler measure (see Definition 1.2). The converse assertion does not…

By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…

Let $K_n$ be a complete graph with $n$ vertices. An embedding of $K_n$ in $S^3$ is called a spatial $K_n$-graph. Knots in a spatial $K_n$-graph corresponding to simple cycles of $K_n$ are said to be constituent knots. We consider the case…

For a non-split multi-crossing diagram $D$ of a link $L$ we show that $\alpha(L)-2 \leq c_2(D) + \sum_{n> 2}(2n-4)c_n(D)$ holds. Here $\alpha(L)$ is the arc index and $c_n(D)$ is the number of $n$-crossings of $D$. This generalizes and…