Related papers: Minimal Polynomials of Singular Moduli

In (Arnold, 1985), V.I. Arnold has obtained normal forms and has developed a classifier for, in particular, all isolated hypersurface singularities over the complex numbers up to modality 2. Building on a series of 105 theorems, this…

Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…

A self-learning algebraic multigrid method for dominant and minimal singular triplets and eigenpairs is described. The method consists of two multilevel phases. In the first, multiplicative phase (setup phase), tentative singular triplets…

It is shown that rational points over finite fields of moduli spaces of stable quiver representations are counted by polynomials with integer coefficients. These polynomials are constructed recursively using an identity in the Hall algebra…

Let $C$ be an algebraic curve of genus $g$ and $L$ a line bundle over $C$. Let $\mathcal{MS}_C(n,L)$ and $\mathcal{MO}_C(n,L)$ be the moduli spaces of $L$-valued symplectic and orthogonal bundles respectively, over $C$ of rank $n$. We…

In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…

Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimization have submodular structure. In practice, these problems…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

In this article, we solve the problem of constructing moduli spaces of semistable principal bundles (and singular versions of them) over smooth projective varieties over algebraically closed ground fields of positive characteristic.

A result of the second-named author states that there are only finitely many CM-elliptic curves over $\mathbb{C}$ whose $j$-invariant is an algebraic unit. His proof depends on Duke's Equidistribution Theorem and is hence non-effective. In…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…

We describe a framework to construct tropical moduli spaces of rational stable maps to a smooth tropical hypersurface or curve. These moduli spaces will be tropical cycles of the expected dimension, corresponding to virtual fundamental…

Necessary and sufficient conditions are given for a $G$-graded simple module over a unital associative algebra, graded by an abelian group $G$, to be isomorphic to a loop module of a simple module, as well as for two such loop modules to be…

Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…

We show that the virtual Euler characteristics of the moduli spaces of $s$-pointed algebraic curves of genus $g$ can be determined from a polynomial in $1/\gamma$ where $\gamma$ permits specialization, through $\gamma=1,$ to the complex…

We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

For small odd primes $p$, we prove that most of the rational points on the modular curve $X_0(p)/w_p$ parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for…