ترغب بنشر مسار تعليمي؟ اضغط هنا

Computational details on the disproof of modularity

189   0   0.0 ( 0 )
 نشر من قبل Ralf Gerkmann
 تاريخ النشر 2007
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

The purpose of these notes is to provide the details of the Jacobian ring computations carried out in [1], based on the computer algebra system Magma [2].



قيم البحث

اقرأ أيضاً

We prove that the moduli space of Calabi-Yau 3-folds coming from eight planes of $P^3$ in general positions is not modular. In fact we show the stronger statement that the Zariski closure of the monodromy group is actually the whole $Sp(20,R)$. We co nstruct an interesting submoduli, which we call emph{hyperelliptic locus}, over which the weight 3 $Q$-Hodge structure is the third wedge product of the weight 1 $Q$-Hodge structure on the corresponding hyperelliptic curve. The non-extendibility of the hyperelliptic locus inside the moduli space of a genuine Shimura subvariety is proved.
128 - Tomer Galanti , Lior Wolf 2020
In the context of learning to map an input $I$ to a function $h_I:mathcal{X}to mathbb{R}$, two alternative methods are compared: (i) an embedding-based method, which learns a fixed function in which $I$ is encoded as a conditioning signal $e(I)$ and the learned function takes the form $h_I(x) = q(x,e(I))$, and (ii) hypernetworks, in which the weights $theta_I$ of the function $h_I(x) = g(x;theta_I)$ are given by a hypernetwork $f$ as $theta_I=f(I)$. In this paper, we define the property of modularity as the ability to effectively learn a different function for each input instance $I$. For this purpose, we adopt an expressivity perspective of this property and extend the theory of Devore et al. 1996 and provide a lower bound on the complexity (number of trainable parameters) of neural networks as function approximators, by eliminating the requirements for the approximation method to be robust. Our results are then used to compare the complexities of $q$ and $g$, showing that under certain conditions and when letting the functions $e$ and $f$ be as large as we wish, $g$ can be smaller than $q$ by orders of magnitude. This sheds light on the modularity of hypernetworks in comparison with the embedding-based method. Besides, we show that for a structured target function, the overall number of trainable parameters in a hypernetwork is smaller by orders of magnitude than the number of trainable parameters of a standard neural network and an embedding method.
We conjecture a formula for the refined $mathrm{SU}(3)$ Vafa-Witten invariants of any smooth surface $S$ satisfying $H_1(S,mathbb{Z}) = 0$ and $p_g(S)>0$. The unrefined formula corrects a proposal by Labastida-Lozano and involves unexpected algebraic expressions in modular functions. We prove that our formula satisfies a refined $S$-duality modularity transformation. We provide evidence for our formula by calculating virtual $chi_y$-genera of moduli spaces of rank 3 stable sheaves on $S$ in examples using Mochizukis formula. Further evidence is based on the recent definition of refined $mathrm{SU}(r)$ Vafa-Witten invariants by Maulik-Thomas and subsequent calculations on nested Hilbert schemes by Thomas (rank 2) and Laarakker (rank 3).
296 - A. Skopenkov 2013
It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller diameter. The argument is due to N. Alon and is a remarkable application of combinatorics and algebra to geometry. This note is purely expository and is accessible for students.
153 - J. Frauendiener , C. Klein 2014
We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the curve. A can onical basis of the homology is introduced algorithmically for this curve. The periods of the holomorphic differentials and the Abel map are computed with the Clenshaw-Curtis method in order to achieve spectral accuracy. The code can handle almost degenerate Riemann surfaces. This work generalizes previous work on real hyperelliptic surfaces with prescribed cuts to arbitrary hyperelliptic surfaces. As an example, solutions to the sine-Gordon equation in terms of multi-dimensional theta functions are studied, also in the solitonic limit of these solutions.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا