Edwards Curves and Gaussian Hypergeometric Series

Let $E$ be an elliptic curve described by either an Edwards model or a twisted Edwards model over $\mathbb{F}_p$, namely, $E$ is defined by one of the following equations $x^2+y^2=a^2(1+x^2y^2),\, a^5-a\not\equiv 0$ mod $p$, or, $ax^2+y^2=1+dx^2y^2,\,ad(a-d)\not\equiv0$ mod $p$, respectively. We express the number of rational points of $E$ over $\mathbb{F}_p$ using the Gaussian hypergeometric series $\displaystyle {_2F_1}\left(\begin{matrix} \phi&\phi {} & \epsilon \end{matrix}\Big| x\right)$ where $\epsilon$ and $\phi$ are the trivial and quadratic characters over $\mathbb{F}_p$ respectively. This enables us to evaluate $|E(\mathbb{F}_p)|$ for some elliptic curves $E$, and prove the existence of isogenies between $E$ and Legendre elliptic curves over $\mathbb{F}_p$

Tensor algebras and displacement structure. IV. Invariant kernels

In this paper we investigate the class of invariant positive definite kernels on the free semigroup on N generators. We provide a combinatorial description of the positivity of the kernel in terms of Dyck paths and then we find a displacement equation that encodes the invariance property of the kernel.Comment: 19 pages, 5 figure

A combinatorial interpretation of the LDU-decomposition of totally positive matrices and their inverses

We study the combinatorial description of the LDU-decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU-decomposition of totally positive matrices in terms of the combinatorial structure of essential planar networks described by Fomin and Zelevinsky [5]. Similarly, we find a combinatorial description of the inverses of these matrices. In addition, we provide recursive formulae for computing the L, D, and U matrices of a totally positive matrix