Related papers: The Signs in Elliptic Nets
We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure math- ematics and string theory. We then…
We classify elliptic curves over the rationals whose N\'eron model over the integers is semi-abelian, with good reduction at p=2, and whose Mordell--Weil group contains an element of order two that stays non-trivial at p=2. Furthermore, we…
Petrovskii elliptic systems of linear differential equations given on a closed smooth manifold are investigated on the extended Sobolev scale. This scale consists of all Hilbert spaces that are interpolation spaces with respect to the…
In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…
We propose an extension of a result by Repetowicz et al. about Wick's theorem and its applications: we first show that Wick's theorem can be extended to the uniform distribution on the sphere and then to the whole class of elliptical…
We introduce a new class of "electrical" Lie groups. These Lie groups, or more precisely their nonnegative parts, act on the space of planar electrical networks via combinatorial operations previously studied by Curtis-Ingerman-Morrow. The…
This paper is a continuation of \cite{Lu1}. In Part I, applying the new splitting theorems developed therein we generalize previous some results on computations of critical groups and some critical point theorems to weaker versions. In Part…
In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of…
Withdrawal Notice: SWJPAM does not allow articles it publishes to appear on archives. An updated version of this article along with new results, can be found at the author's web page: www.math.psu.edu/horwitz/papers.html
The classification of elliptic curves E over the rationals Q is studied according to their torsion subgroups E_{tors}(Q) of rational points. Explicit criteria for the classification are given when E_{tors}(Q) are cyclic groups with even…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
Let E/k(T) be an elliptic curve defined over a rational function field of characteristic zero. Fix a Weierstrass equation for E. For points R in E(k(T)), write x_R=A_R/D_R^2 with relatively prime polynomials A_R(T) and D_R(T) in k[T]. The…
In this paper, we calculate the $ \phi (\hat{\phi})-$Selmer groups $ S^{(\phi)} (E / \Q) $ and $ S^{(\hat{\varphi})} (E^{\prime} / \Q) $ of elliptic curves $ y^{2} = x (x + \epsilon p D) (x + \epsilon q D) $ via descent theory (see [S,…
One of the major issues in signed networks is to use network structure to predict the missing sign of an edge. In this paper, we introduce a novel probabilistic approach for the sign prediction problem. The main characteristic of the…
We study the set of networks, which consist of sources, sinks and neutral points, bijective to the permutations. The set of directed edges, which characterizes a network, is constructed from a polyomino or a Rothe diagram of a permutation…
For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…
We use a method, inspired by Pohozeav's work, to study asymptotic behaviors of non-variational elliptic systems in dimension n greater than two. The results apply to changing sign solutions.
We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.
We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…
It is proved in this paper that for any point on an elliptic curve, the mean value of x-coordinates of its n-division points is the same as its x-coordinate and that of y-coordinates of its n-division points is n times of its y-coordinate.