Related papers: Computing the 4D Geode
Schroedinger's famous quadruple of factorizations of the hypergeometric equation is archived here
We extend the notion of polynomial integration over an arbitrary circle $C$ in the Euclidean geometry over general fields $\mathbb F$ of characteristic zero as a normalized $\mathbb F$-linear functional on $\mathbb{F}\left[\alpha_1,…
In this note, we firstly establish an extended Gauss's summation identity. Using this identity, we compute values of a family of $_4F_3$ hypergeometric functions, which generalize the results obtained by Ferretti et al..
In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…
Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…
In 1960 Schwinger [J. Schwinger, Proc.Natl.Acad.Sci. 46 (1960) 570- 579] proposed the algorithm for factorization of unitary operators in the finite M dimensional Hilbert space according to a coprime decomposition of M. Using a special…
This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Miller, Owen…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…
We investigate resolutions of heterotic orbifolds using toric geometry. Our starting point is provided by the recently constructed heterotic models on explicit blowup of C^n/Z_n singularities. We show that the values of the relevant…
We consider the radius of gyration of a Gaussian topological polymer $G$ formed by subdividing a graph $G'$ of arbitrary topology (for instance, branched or multicyclic). We give a new exact formula for the expected radius of gyration and…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…
We study SOS properties of biquadratic forms. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that every PSD partially symmetric biquadratic…
Hilbert proved in 1888 that a positive semi-definite (PSD) homogeneous quartic polynomial of three variables always can be expressed as the sum of squares (SOS) of three quadratic polynomials, and a psd homogeneous quartic polynomial of…
Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…
We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…
The closed form solution for the geodesics of classical particles in SdS space are obtained in terms of hyperelliptic modular functions and multiple hypergeometric functions. The closed form solution for the five roots of the fifth degree…
The paper describes a prime factorization of the Catalan numbers. Odd prime factors are distributed in layers in accordance with Legendre's formula. The content of each layer is a network of the intervals, Chebyshev's Segments. The primes…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
The Ciliberto-Di Gennaro conjecture predicts that a nodal hypersurface of degree $d\geq 3$ with at most $2(d-2)(d-1)$ nodes is either factorial, or contains a plane and has at least $(d-1)^2$ nodes, or contains a quadric surface and has…