Related papers: Computing the determinant of links through Fourier…

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…

Following the line of \cite{AS} we propose an improved algorithm which allows to calculate a D-dimensional fermion determinant integrating the exponent of D+1 dimensional Hermitean bosonic action. For a finite extra dimension the…

We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision…

This paper describes an estimator of the additive components of a nonparametric additive model with a known link function. When the additive components are twice continuously differentiable, the estimator is asymptotically normally…

We describe a method for computing discriminants for a large class of families of isolated determinantal singularities -- more precisely, for subfamilies of ${\mathcal G}$-versal families. The approach intrinsically provides a decomposition…

The sparse difference resultant introduced in \citep{gao-2015} is a basic concept in difference elimination theory. In this paper, we show that the sparse difference resultant of a generic Laurent transformally essential system can be…

We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…

We generalize linear superalgebra to higher gradings and commutation factors, given by arbitrary abelian groups and bicharacters. Our central tool is an extension, to monoidal categories of modules, of the Nekludova-Scheunert faithful…

Given a generic rational curve $C$ in the group of Euclidean displacements we construct a linkage such that the constrained motion of one of the links is exactly $C$. Our construction is based on the factorization of polynomials over dual…

We prove some necessary conditions for a link to be either concordant to a quasi-positive link, quasi-positive, positive, or the closure of a positive braid. The main applications of our results are a characterisation of positive links with…

The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…

We generalize an algorithm of Rudolph to establish that every link is topologically concordant to a strongly quasipositive link.

We develop symmetric Cartan calculus, an analogue of classical Cartan calculus for symmetric differential forms. We first show that the analogue of the exterior derivative, the symmetric derivative, is not unique and its different choices…

This work proposes a novel technique for the numerical calculus of the fractal dimension of fractal objects which can be represented as a closed contour. The proposed method maps the fractal contour onto a complex signal and calculates its…

The foundation for the theory of correlation functions of exactly solvable models is determinant representation. Determinant representation permit to describe correlation functions by classical completely integrable differential equations…

In this paper we develop a technique of computation of correlation functions in theories with action being cubic or higher degree form in terms of discriminants of corresponding tensors. These are analogues of formula $\int \exp…

In this paper, we propose a new general and stable fixed-point approach to compute the resolvents of the composition of a set-valued maximal monotone operator with a linear bounded mapping. Weak, strong and linear convergence of the…

We calculate the four-point function of $1/2$-BPS determinant operators in $\mathcal{N}=4$ SYM at next-to-leading order at weak coupling. We use two complementary methods recently developed for a class of determinant three-point functions:…

This article is concerned with the Fourier coefficients of cusp forms (not necessarily eigenforms) of half-integer weight lying in the plus space. We give a soft proof that there are infinitely many fundamental discriminants $D$ such that…