Related papers: More Discriminants with the Brezing-Weng Method
The objective of this paper is to define an effective strategy for building an ensemble of Genetic Programming (GP) models. Ensemble methods are widely used in machine learning due to their features: they average out biases, they reduce the…
We introduce a new framework for manipulating and interacting with deep generative models that we call network bending. We present a comprehensive set of deterministic transformations that can be inserted as distinct layers into the…
In this work we describe a method to reconstruct the braid monodromy of the preimage of a curve by a Kummer cover. This method is interesting, since it combines two techniques, namely, the reconstruction of a highly non-generic braid…
The decoder-based machine learning generative algorithms such as Generative Adversarial Networks (GAN), Variational Auto-Encoders (VAE), Transformers show impressive results when constructing objects similar to those in a training ensemble.…
The family of f-divergences is ubiquitously applied to generative modeling in order to adapt the distribution of the model to that of the data. Well-definedness of f-divergences, however, requires the distributions of the data and model to…
Polynomial time reductions between problems have long been used to delineate problem classes. Simulation reductions also exist, where an oracle for simulation from some probability distribution can be employed together with an oracle for…
It is proved that the rank of an elliptic curve is one less the arithmetic complexity of the corresponding non-commutative torus. As an illustration, we consider a family of elliptic curves with complex multiplication.
We define a simplicial differential calculus by generalizing divided differences from the case of curves to the case of general maps, defined on general topological vector spaces, or even on modules over a topological ring K. This calculus…
This paper presents a novel approach for deep visualization via a generative network, offering an improvement over existing methods. Our model simplifies the architecture by reducing the number of networks used, requiring only a generator…
The problem of sampling edge-colorings of graphs with maximum degree $\Delta$ has received considerable attention and efficient algorithms are available when the number of colors is large enough with respect to $\Delta$. Vizing's theorem…
We solve a special type of linear systems with coefficients in multivariate polynomial rings. These systems arise in the computation of parametric Bernstein-Sato polynomials associated with certain hypergeometric ideals in the Weyl algebra.
This paper deals with the merging problem of segments of a composite B\'ezier curve, with the endpoints continuity constraints. We present a novel method which is based on the idea of using constrained dual Bernstein polynomial basis (P.…
The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets…
We propose a new method to generate a sequence of random numbers with long-range power-law correlations that overcomes known difficulties associated with large systems. The new method presents an improvement on the commonly-used methods. We…
We prove a strong relation between Chern and log Chern invariants of algebraic surfaces. For a given arrangement of curves, we find nonsingular projective surfaces with Chern ratio arbitrarily close to the log Chern ratio of the log surface…
The purpose of this paper is two-fold. We first prove a series of results, concerned with the notion of Zariski multiplicity, mainly for non-singular algebraic curves. These results are required in the paper "A Theory of Branches for…
We study constructing an algebraic curve from a Riemann surface given via a translation surface, which is a collection of finitely many polygons in the plane with sides identified by translation. We use the theory of discrete Riemann…
The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…
We study the relationships between several varieties parametrizing marked curves with differentials in the literature. More precisely, we prove that the space $\mathcal{B}_n$ of multiscale differentials of genus 0 with $n+1$ marked points…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…