SearcharxivSearch

arXiv subjects

SanMin Wang

Publications and source records attributed to SanMin Wang.

5 recordsLinked to original sources

Algorithms for Modular Parametrizations of Elliptic Curves over $\mathbb{Q}$

Let \( E \) be a complex elliptic curve with conductor \( N \) and modular invariant \( j(E) \in \mathbb{Q} \). We construct a class of modular polynomials $F_N(x,j)$ that relate the modular function $x$ on $X_0(N)$ to the $j$-invariant $j$, where $x$ is obtained by composing the first coordinate function of $E$ with the modular parametrization $φ: X_0(N) \rightarrow E$. Using $F_N(x,j)$, we can precisely determine the poles of $φ$, compute exact values of $φ$ at cusps, and develop an algorithm for calculating ramification points of $φ$. Moreover, $F_N(x,j)$ yields an efficient algorithm for computing the fibres of $φ$ over arbitrary points on $E$. In some sense, $F_N(x,j)$ also provides a ``total" formula for computing the minimal polynomial of the images of Heegner points on $X_0(N)$ under $φ$. Especially, we compute the semi-trace of the image $φ([\frac{{ - 1 + \sqrt { - 3} }}{2}])$ of the CM-point $[\frac{-1 + \sqrt{-3}}{2}]$ on $X_{0}(389)$, under the action of a 65-element subgroup of the 260-element Galois group of $\mathbb{Q}(\sqrt{-3}, j(389 \cdot \frac{-1 + \sqrt{-3}}{2}))$. Finally, we associate a point of infinite order in~\( E(\mathbb{Q}) \) with an infinite sequence~$\{ (j(τ_n), j(Nτ_n)) \}_{n \in \mathbb{Z}^+} $ of algebraic numbers whose degrees are bounded by the degree of~$φ$. This provides one seemingly practicable approach to addressing the BSD conjecture.

math.NT

An E-sequence approach to the 3x + 1 problem

For any odd positive integer $x$, define $(x_n)_{n\geqslant 0} $ and $(a_n )_{n\geqslant 1} $ by setting $x_{0}=x, \,\, x_n =\cfrac{3x_{n-1} +1}{2^{a_n }}$ such that all $x_n $ are odd. The 3x+1 problem asserts that there is an $x_n =1$ for all $x$. Usually, $(x_n )_{n\geqslant 0} $ is called the trajectory of $x$. In this paper, we concentrate on $(a_n )_{n\geqslant 1} $ and call it the E-sequence of $x$. The idea is that, we generalize E-sequences to all infinite sequence $(a_n )_{n\geqslant 1} $ of positive integers and consider all these generalized E-sequences. We then define $(a_n )_{n\geqslant 1} $ to be $Ω-$convergent to $x$ if it is the E-sequence of $x$ and to be $Ω-$divergent if it is not the E-sequence of any odd positive integer. We prove a remarkable fact that the $Ω-$divergence of all non-periodic E-sequences implies the periodicity of $(x_n )_{n\geqslant 0} $ for all $x_0$. The principal results of this paper are to prove the $Ω-$divergence of several classes of non-periodic E-sequences. Especially, we prove that all non-periodic E-sequences $(a_n )_{n\geqslant 1} $ with $\mathop {\overline {\lim } }\limits_{n\to \infty } \cfrac{b_n }{n}>\log _23$ are $Ω-$divergent by using the Wendel's inequality and the Matthews and Watts's formula $x_n =\cfrac{3^n x_0 }{2^{b_n }}\prod\limits_{k=0}^{n-1} {(1+\cfrac{1}{3x_k })} $, where $b_n =\sum\limits_{k=1}^n {a_k } $. These results present a possible way to prove the periodicity of trajectories of all positive integers in the 3x + 1 problem and we call it the E-sequence approach.

math.NT

Density Elimination for Semilinear Substructural Logics

We present a uniform method of density elimination for several semilinear substructural logics. Especially, the density elimination for the involutive uninorm logic IUL is proved. Then the standard completeness of IUL follows as a lemma by virtue of previous work by Metcalfe and Montagna.

math.LO

Semilinear substructural logics with the finite embeddability property

In this paper, three semilinear substructural logics ULw, IULw and HpsUL*w are constructed. Then the completeness of ULw and IULw with respect to classes of finite UL and IUL-algebras, respectively, is proved. Algebraically, non-integral ULw and IULw-algebras have the finite embeddability property, which gives a characterization for finite UL and IUL-algebras. Furthermore, the standard completeness of ULw, IULw and HpsUL*w is proved, which shows that they are substructural fuzzy logics.

math.LO

The logic of pseudo-uninorms and their residua

Our method of density elimination is generalized to the non-commutative substructural logic GpsUL*. Then the standard completeness of GpsUL* follows as a lemma by virtue of previous work by Metcalfe and Montagna. This result shows that GpsUL* is the logic of pseudo-uninorms and their residua and answered the question posed by Prof. Metcalfe, Olivetti, Gabbay and Tsinakis.

math.LO