Related papers: Branching data for curves up to genus 48
Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…
There is presented a method for computing the number of branches of a real analytic curve germ from $R^n$ to $R^m$, where m is greater or equal to n, having a singular point at the origin, and the number of half--branches of the set of…
Let $k$ be an algebraically closed field of characteristic $p>0$ and $C$ a connected nonsingular projective curve over $k$ with genus $g \geq 2$. This paper continues the work begun by Lehr and Matignon, namely the study of "big actions",…
A smooth complex projective curve is called pseudoreal if it is isomorphic to its conjugate but is not definable over the reals. Such curves, together with real Riemann surfaces, form the real locus of the moduli space $\mathcal M_g$. This…
We develop some general tools for computing the Brauer group of a tame algebraic stack $\mathscr X$ by studying the difference between it and the Brauer group of the coarse space $X$ of $\mathscr X$. It is our hope that these tools will be…
Gene expression programming, a genotype/phenotype genetic algorithm (linear and ramified), is presented here for the first time as a new technique for the creation of computer programs. Gene expression programming uses character linear…
Let n_\delta be the number of \delta-nodal curves lying in a suitably ample complete linear system |L| and passing through appropriately many points on a smooth projective complex algebraic surface. A major open problem is to understand the…
Genetic Programming, a kind of evolutionary computation and machine learning algorithm, is shown to benefit significantly from the application of vectorized data and the TensorFlow numerical computation library on both CPU and GPU…
Modern computing systems are increasingly more complex, with their multicore CPUs and GPUs accelerators changing yearly, if not more often. It thus has become very challenging to write programs that efficiently use the associated complex…
For each group $G$, $(|G| > 2)$ \, which acts as a full automorphism group on a genus 3 hyperelliptic curve, we determine the family of curves which have 2-Weierstrass points. Such families of curves are explicitly determined in terms of…
Let $\mathcal{X}$ be a (projective, non-singular, geometrically irreducible) curve of even genus $g(\mathcal{X}) \geq 2$ defined over an algebraically closed field $K$ of odd characteristic $p$. If the $p$-rank $\gamma(\mathcal{X})$ equals…
We study the problem of efficiently constructing a curve C of genus 2 over a finite field F for which either the curve C itself or its Jacobian has a prescribed number N of F-rational points. In the case of the Jacobian, we show that any…
Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximation scheme to estimate the probability that a graph $G$ becomes disconnected, given that its edges are removed independently with probability $p$. This…
We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…
We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time…
We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model of computation is a natural generalization of several…
We compute the Brauer group of the moduli stack of elliptic curves over the integers, localizations of the integers, finite fields of odd characteristic, and algebraically closed fields of characteristic not $2$. The methods involved…
Graph burning is a discrete-time process that models the propagation of information in a network. Initially, we have an undirected graph of unburned vertices. At each time step, an unburned vertex is chosen to burn; additionally, unburned…
Combinatorial optimization is essential across numerous disciplines. Traditional metaheuristics excel at exploring complex solution spaces efficiently, yet they often struggle with scalability. Deep learning has become a viable alternative…
To advance formal verification of stochastic systems against temporal logic requirements for handling unknown dynamics, researchers have been designing data-driven approaches inspired by breakthroughs in the underlying machine learning…