Related papers: Computing the determinant of links through Fourier…
An n-dimensional \mu-component boundary link is a codimension 2 embedding of spheres L=\bigsqcup_{\mu}S^n \subset S^{n+2} such that there exist \mu disjoint oriented embedded (n+1)-manifolds which span the components of L. An F_\mu-link is…
We show how to construct central and grouplike quantum determinants for FRT algebras A(R). As an application of the general construction we give a quantum determinant for the q-Lorentz group.
We propose a constraint-based algorithm, which automatically determines causal relevance thresholds, to infer causal networks from data. We call these topological thresholds. We present two methods for determining the threshold: the first…
In this paper, we develop a fast and accurate pseudospectral method to approximate numerically the half Laplacian $(-\Delta)^{1/2}$ of a function on $\mathbb{R}$, which is equivalent to the Hilbert transform of the derivative of the…
We give an algorithm for computing the Teichm\"uller polynomial for a certain class of fibered alternating links associated to trees. Furthermore, we exhibit a mutant pair of such links distinguished by the Teichm\"uller polynomial.
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…
Given a binary nonlinear code, we provide a deterministic algorithm to compute its weight and distance distribution, and in particular its minimum weight and its minimum distance, which takes advantage of fast Fourier techniques. This…
Motivated by various problems in physics and applied mathematics, we look for constraints and properties of real Fourier-positive functions, i.e. with positive Fourier transforms. Properties of the "Dirac comb" distribution and of its…
The Varchenko determinant is the determinant of the bilinear form associated to a real hyperplane arrangement. We show that we can obtain the exact value of this determinant for certain hyperplane arrangements if we know the edges which are…
We introduce two forms of correlations on two $d$-level (qudit) systems for entanglement detection. The correlations can be measured via experimentally tractable two local measurement settings and their separable bounds are determined by…
In this paper we obtain new sufficient conditions for representation of a function as an absolutely convergent Fourier integral. Unlike those known earlier, these conditions are given in terms of belonging to weighted spaces. Adding weights…
This article proposes a new approach in the treatment of the Hilbert transform and some cases of the Fourier transform whose improper integrals are principal values. This approach may be useful for teaching these issues to undergraduate…
We present a simple, yet useful result about the expected value of the determinant of random sum of rank-one matrices. Computing such expectations in general may involve a sum over exponentially many terms. Nevertheless, we show that an…
Associated to an (adelic) Hilbert modular form is a sequence of `Fourier coefficients' which uniquely determine the form. In this paper we characterize Hilbert modular cusp forms by the size of their Fourier coefficients. This answers in…
This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…
This note presents some results about Hankel determinants of backwards shifted Catalan-like numbers and related sequences.
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…
This paper deals with links and braids up to link-homotopy, studied from the viewpoint of Habiro's clasper calculus. More precisely, we use clasper homotopy calculus in two main directions. First, we define and compute a faithful linear…
Following the method of Seifert surfaces in knot theory, we define arithmetic linking numbers and height pairings of ideals using arithmetic duality theorems, and compute them in terms of n-th power residue symbols. This formalism leads to…