Related papers: Factorization of the Ising model form factors
Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…
From the results in the literature, the algebraic set of the hyperbola with parameter $n$ defined by $\mathcal{B}_{n}(X, Y, Z)_{\mid_{x\geq 4n}}= \displaystyle \lbrace \left(X: Y: Z\right)\in \mathbb{P}^{2}(\mathbb{Q}) \ \vert \…
Factorial designs have broad applications in agricultural, engineering and scientific studies. In constructing and studying properties of factorial designs, traditional design theory treats all factors as nominal. However, this is not…
We give a geometric approach to integer factorization. This approach is based on special approximations of segments of the curve that is represented by $y=n/x$, where $n$ is the integer whose factorization we need.
We study the factorization of the hypergeometric-type difference equation of Nikiforov and Uvarov on nonuniform lattices. An explicit form of the raising and lowering operators is derived and some relevant examples are given.
We study operators on a singular manifold, here of conical or edge type, and develop a new general approach of representing asymptotics of solutions to elliptic equations close to the singularities. The idea is to construct so-called…
In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-\varepsilon$,…
The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…
Division polynomials associated to an elliptic curve $E/K$ are polynomials $\phi_n, \psi_n^2$ that arise from the sequence of points $\{nP\}_{n \in \mathbb{N}}$ on this curve. If one wishes to study $\mathbb{Z}$--linear combination of…
We consider the problem of obtaining higher order in regularization parameter $\epsilon$ analytical results for master integrals with elliptics. The two commonly employed methods are provided by the use of differential equations and direct…
We review certain classes of iterated integrals that appear in the computation of Feynman integrals that involve elliptic functions. These functions generalise the well-known class of multiple polylogarithms to elliptic curves and are…
Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…
Within the differential equation method for multiloop calculations, we examine the systems irreducible to $\epsilon$-form. We argue that for many cases of such systems it is possible to obtain nontrivial quadratic constraints on the…
The form factor of the unitary group U(N) endowed with the Haar measure characterizes the correlations within the spectrum of a typical unitary matrix. It can be decomposed into a sum over pairs of ``periodic orbits'', where by periodic…
The eigenvectors of the $(N+1)\times (N+1)$ symmetric Pascal matrix $T_N$ are analogs of prolate spheroidal wave functions in the discrete setting. The generating functions of the eigenvectors of $T_N$ are prolate spheroidal functions in…
We investigate structure functions in deep inelastic scattering processes (DIS) at Bj\"{o}rken limit and found that they are factorized into the longitudinal and transversal parts. We see that the longitudinal part can be linked to exact…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…
We study the 3d Ising universality class using the functional renormalisation group. With the help of background fields and a derivative expansion up to fourth order we compute the leading index, the subleading symmetric and anti-symmetric…
We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…