Related papers: Computing the determinant of links through Fourier…

A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…

Let f be a newform of weight two, prime level p. If D is a fundamental discriminant, define the twisted L-function L(f,D,s) to be the L-function associated to the twist of f by the quadratic character of conductor D. In this paper we…

In this paper, a new kind of resultant, called the determinantal resultant, is introduced. This operator computes the projection of a determinantal variety under suitable hypothesis. As a direct generalization of the resultant of a very…

Let L be any infinite biperiodic alternating link. We show that for any sequence of finite links that Folner converges almost everywhere to L, their determinant densities converge to the Mahler measure of the 2-variable characteristic…

Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links…

For the orthogonal-unitary and symplectic-unitary transitions in random matrix theory, the general parameter dependent distribution between two sets of eigenvalues with two different parameter values can be expressed as a quaternion…

The higher order supersymmetric partners of the Schroedinger's Hamiltonians can be explicitly constructed by iterating a simple finite difference equation corresponding to the Baecklund transformation. The method can completely replace the…

We calculate the local Fourier transforms for formal connections. In particular, we verify an analogous conjecture suggested in Laumon's paper: "Transformation de Fourier, constantes d'equations fonctionnelles et conjecture de Weil, 2.6.3".

We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete…

A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…

We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an…

Using the overlap formulation, we calculate the fermionic determinant on the lattice for chiral fermions with twisted boundary conditions in two dimensions. When the lattice spacing tends to zero we recover the results of the usual…

We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…

This paper describes a method of calculating the transforms, currently obtained via Fourier and reverse Fourier transforms. The method allows calculating efficiently the transforms of a signal having an arbitrary dimension of the digital…

In the paper, by a general and fundamental, but non-extensively circulated, formula for derivatives of a ratio of two differentiable functions and by a recursive relation of the Hessenberg determinant, the author finds a new determinantal…

We describe an algorithm that can effectively calculate the $s$-invariant of a link as defined by Beliakova and Wehrli. Our computations show that this cannot be done by merely calculating the $E_\infty$-page of the Bar-Natan--Lee--Turner…

We prove that there are only finitely many values of the Jones polynomial of quasi-alternating links of a given determinant. Consequently, we prove that there are only finitely many quasi-alternating links of a given Jones polynomial iff…

A colored link, as defined by Francesca Aicardi, is an oriented classical link together with a coloration, which is a function defined on the set of link components and whose image is a finite set of colors. An oriented classical link can…

This study proposes a novel method for estimation and hypothesis testing in high-dimensional single-index models. We address a common scenario where the sample size and the dimension of regression coefficients are large and comparable.…

We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…