Related papers: More Discriminants with the Brezing-Weng Method

Given a large social or information network, how can we partition the vertices into sets (i.e., colors) such that no two vertices linked by an edge are in the same set while minimizing the number of sets used. Despite the obvious practical…

By identifying a family of corner cutting schemes as a dimension elevation process of Gelfond-Bezier curves, we give a Muntz type condition for the convergence of the generated control polygons to the underlying curve. The surprising…

Let $E$ be an elliptic curve over a number field $K$. Descent calculations on $E$ can be used to find upper bounds for the rank of the Mordell-Weil group, and to compute covering curves that assist in the search for generators of this…

In this paper we present a family of algorithms that can simultaneously align and cluster sets of multidimensional curves measured on a discrete time grid. Our approach is based on a generative mixture model that allows non-linear time…

The defect of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre upper bound for the number of points on the curve. We present algorithms for constructing curves of genus 5,…

We first normalize the derivative Weierstrass $\wp'$-function appearing in Weierstrass equations which give rise to analytic parametrizations of elliptic curves by the Dedekind $\eta$-function. And, by making use of this normalization of…

Macrocyclic peptides are an emerging therapeutic modality, yet computational approaches for accurately sampling their diverse 3D ensembles remain challenging due to their conformational diversity and geometric constraints. Here, we…

We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with embedding degree k = 10, which solves an open problem posed…

The imbalanced data classification remains a vital problem. The key is to find such methods that classify both the minority and majority class correctly. The paper presents the classifier ensemble for classifying binary, non-stationary and…

The fairing curves and surfaces are used extensively in geometric design, modeling, and industrial manufacturing. However, the majority of conventional fairing approaches, which lack sufficient parameters to improve fairness, are based on…

We examine several aspects of explicability of a classification system built from neural networks. The first aspect is the pairwise explicability, which is the ability to provide the most accurate prediction when the range of possibilities…

In this paper, we present a novel approach to the problem of merging of B\'ezier curves with respect to the $L_2$-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for…

We generate ring class fields of imaginary quadratic fields in terms of the special values of certain eta-quotients, which are related to the relative norms of Siegel-Ramachandra invariants. These give us minimal polynomials with relatively…

The method of brackets is a method for the evaluation of definite integrals based on a small number of rules. This is employed here for the evaluation of Mellin-Barnes integral. The fundamental idea is to transform these integral…

In this paper we give an algorithm of how to determine a Weierstrass equation with minimal discriminant for superelliptic curves generalizing work of Tate for elliptic curves and Liu for genus 2 curves.

In this article, we study the existence of new and general type meromorphic $1$-forms on curves through explicit construction. Specifically, we have constructed a large family of new and general type meromorphic $1$-forms on $\mathbb{P}^1,$…

We give a 'recursive' formula (in terms of reducible limits) for counting rational curves on a variety moving in any sufficiently large and well-behaved family. Our approach is completely elementary and makes no use of moduli spaces for…

We enumerate several classes of pattern-avoiding rectangulations. We establish new bijective links with pattern-avoiding permutations, prove that their generating functions are algebraic, and confirm several conjectures by Merino and…

We introduce ring theoretic constructions that are similar to the construction of wreath product of groups. In particular, for a given graph $\Gamma=(V,E)$ and an associate algebra $A,$ we construct an algebra $B=A\, wr\, L(\Gamma)$ with…

We develop a Bregman proximal gradient method for structure learning on linear structural causal models. While the problem is non-convex, has high curvature and is in fact NP-hard, Bregman gradient methods allow us to neutralize at least…