Related papers: More Discriminants with the Brezing-Weng Method
Hypergraphs, which use hyperedges to capture groupwise interactions among different entities, have gained increasing attention recently for their versatility in effectively modeling real-world networks. In this paper, we study the problem…
Every smooth minimal complex algebraic surface of general type, $X$, may be mapped into a moduli space, $\MM_{c_1^2(X), c_2(X)}$, of minimal surfaces of general type, all of which have the same Chern numbers. Using the braid group and braid…
While there has been considerable interest in the problem of finding elliptic curves of high rank over $\mathbb{Q}$, very few parametrized families of elliptic curves of generic rank $\geq 8$ have been published. In this paper we use…
In this paper, we develop a new approach to the discrimi-nant of a complete intersection curve in the 3-dimensional projective space. By relying on the resultant theory, we first prove a new formula that allows us to define this…
In this paper, we present a novel non-parametric clustering technique. Our technique is based on the notion that each latent cluster is comprised of layers that surround its core, where the external layers, or border points, implicitly…
The aim of this paper is to classify reduction types of algebraic curves. Reduction types capture the discrete invariants of fibres in one-dimensional families of curves, and they have been described in genus 1, 2 and 3. For fixed genus…
There has been exciting progress in generating images from natural language or layout conditions. However, these methods struggle to faithfully reproduce complex scenes due to the insufficient modeling of multiple objects and their…
This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree…
We consider two systems of curves $(\alpha_1,...,\alpha_m)$ and $(\beta_1,...,\beta_n)$ drawn on a compact two-dimensional surface $M$ with boundary. Each $\alpha_i$ and each $\beta_j$ is either an arc meeting the boundary of $M$ at its two…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
We provide a simple unified approach to obtain (i) Discrete polygonal isoperimetric type inequalities of arbitrary high order. (ii) Arbitrary high order isoperimetric type inequalities for smooth curves, where both upper and lower bounds…
We introduce a novel technique to generate Benders' cuts from a conic relaxation ("corner") derived from a basis of a higher-dimensional polyhedron that we aim to outer approximate in a lower-dimensional space. To generate facet-defining…
In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…
Some general criteria to produce explicit free algebras inside the division ring of fractions of skew polynomial rings are presented. These criteria are applied to some special cases of division rings with natural involutions, yielding, for…
We propose a trait-specific image generation method that models forehead creases geometrically using B-spline and B\'ezier curves. This approach ensures the realistic generation of both principal creases and non-prominent crease patterns,…
Flow matching models typically use linear interpolants to define the forward/noise addition process. This, together with the independent coupling between noise and target distributions, yields a vector field which is often non-straight.…
Incremental methods for structure learning of pairwise Markov random fields (MRFs), such as grafting, improve scalability by avoiding inference over the entire feature space in each optimization step. Instead, inference is performed over an…
In this paper, we propose a Bregman frame for several classical alternating minimization algorithms. In the frame, these algorithms have uniform mathematical formulation. We also present convergence analysis for the frame algorithm. Under…
Learning Bayesian Networks (BNs) from high-dimensional data is a complex and time-consuming task. Although there are approaches based on horizontal (instances) or vertical (variables) partitioning in the literature, none can guarantee the…
We study the problem of generating the endomorphism ring of a supersingular elliptic curve by two cycles in $\ell$-isogeny graphs. We prove a necessary and sufficient condition for the two endomorphisms corresponding to two cycles to be…