Related papers: Computing the determinant of links through Fourier…
The determinants of $\{\pm 1\}$-matrices are calculated by via the oriented hypergraphic Laplacian and summing over an incidence generalization of vertex cycle-covers. These cycle-covers are signed and partitioned into families based on…
We propose to calculate bosonic and fermionic determinants with some general field background, and the corresponding 1-loop effective actions by evaluating random walk worldline loops generated statistically on the lattice. This is…
Let $\{a_k\}$ be a sequence of real numbers defined by an $m$th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix $A=circ(a_1, a_2, \cdots, a_n)$, providing a generalization…
For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split…
We modify our previous construction of link homology in order to include a natural duality functor $\mathfrak{F}$. To a link $L$ we associate a triply-graded module $HXY(L)$ over the graded polynomial ring…
We consider two variables that are related to each other by an invertible function. While it has previously been shown that the dependence structure of the noise can provide hints to determine which of the two variables is the cause, we…
In this note, we explore certain determinantal descriptions of the Robbins numbers. Techniques used for this include continued fractions, Riordan arrays and series inversion. Proven and conjectured representations involve the determinants…
In this paper we resolve a conjecture of Zhi-Wei Sun concerning the integrality and arithmetic structure of certain trigonometric determinants. Our approach builds on techniques developed in our previous work, where trigonometric…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
Four families of special functions, depending on n variables, are studied. We call them symmetric and antisymmetric multivariate sine and cosine functions. They are given as determinants or antideterminants of matrices, whose matrix…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…
A recurring task in particle physics and statistics is to compute the complex critical points of a product of powers of affine-linear functions. The logarithmic discriminant characterizes exponents for which such a function has a degenerate…
We calculate the local Fourier transforms for connections on the formal punctured disk, corroborating the results of J. Fang and C. Sabbah using a different method. Our method is similar to Fang's, but more direct.
In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial…
Chiral perturbation theory gives direct and unambiguous predictions for the form of various two-point hadronic correlators at low momentum in terms of a finite set of couplings in a chiral Lagrangian. In this paper we study the feasibility…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
The $n$-solvable filtration of the $m$-component smooth (string) link concordance group, $$\dots \subset \mathcal{F}^m_{n+1} \subset \mathcal{F}^m_{n.5} \subset \mathcal{F}^m_n \dots \subset \mathcal{F}^m_1 \subset \mathcal{F}^m_{0.5}…
We use Kirk's invariant of link maps $S^2\sqcup S^2\to S^4$ and its variations due to Koschorke and Kirk-Livingston to deduce results about classical links. Namely, we give a new proof of the Nakanishi-Ohyama classification of two-component…
We study the relation of the middle convolution to the $\ell$-adic Fourier transformation in the \'etale context. Using Katz' work and Laumon's theory of local Fourier transformations we obtain a detailed description of the local monodromy…