1,861 research outputs found
Formal Desingularization of Surfaces - The Jung Method Revisited -
In this paper we propose the concept of formal desingularizations as a
substitute for the resolution of algebraic varieties. Though a usual resolution
of algebraic varieties provides more information on the structure of
singularities there is evidence that the weaker concept is enough for many
computational purposes. We give a detailed study of the Jung method and show
how it facilitates an efficient computation of formal desingularizations for
projective surfaces over a field of characteristic zero, not necessarily
algebraically closed. The paper includes a generalization of Duval's Theorem on
rational Puiseux parametrizations to the multivariate case and a detailed
description of a system for multivariate algebraic power series computations.Comment: 33 pages, 2 figure
Discrete spheres and arithmetic progressions in product sets
We prove that if is a set of positive integers such that
contains an arithmetic progression of length , then for some absolute ,
where is the prime counting function.
This improves on previously known bounds of the form and
gives a bound which is sharp up to the second order term, as Pach and S\'andor
gave an example for which
The main new tool is a reduction of the original problem to the question of
approximate additive decomposition of the -sphere in which
is the set of vectors with exactly three non-zero coordinates.
Namely, we prove that such a set cannot have an additive basis of order two of
size less than with absolute constant .Comment: An updated version with an essentially sharp bound. To appear in Acta
Arithmetic
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
The fastest known algorithm for factoring univariate polynomials over finite
fields is the Kedlaya-Umans (fast modular composition) implementation of the
Kaltofen-Shoup algorithm. It is randomized and takes time to factor polynomials of degree over the finite field
with elements. A significant open problem is if the
exponent can be improved. We study a collection of algebraic problems and
establish a web of reductions between them. A consequence is that an algorithm
for any one of these problems with exponent better than would yield an
algorithm for polynomial factorization with exponent better than
Flavor Structure in F-theory Compactifications
F-theory is one of frameworks in string theory where supersymmetric grand
unification is accommodated, and all the Yukawa couplings and Majorana masses
of right-handed neutrinos are generated. Yukawa couplings of charged fermions
are generated at codimension-3 singularities, and a contribution from a given
singularity point is known to be approximately rank 1. Thus, the approximate
rank of Yukawa matrices in low-energy effective theory of generic F-theory
compactifications are minimum of either the number of generations N_gen = 3 or
the number of singularity points of certain types. If there is a geometry with
only one E_6 type point and one D_6 type point over the entire 7-brane for
SU(5) gauge fields, F-theory compactified on such a geometry would reproduce
approximately rank-1 Yukawa matrices in the real world. We found, however, that
there is no such geometry. Thus, it is a problem how to generate hierarchical
Yukawa eigenvalues in F-theory compactifications. A solution in the literature
so far is to take an appropriate factorization limit. In this article, we
propose an alternative solution to the hierarchical structure problem (which
requires to tune some parameters) by studying how zero mode wavefunctions
depend on complex structure moduli. In this solution, the N_gen x N_gen CKM
matrix is predicted to have only N_gen entries of order unity without an extra
tuning of parameters, and the lepton flavor anarchy is predicted for the lepton
mixing matrix. We also obtained a precise description of zero mode
wavefunctions near the E_6 type singularity points, where the up-type Yukawa
couplings are generated.Comment: 148 page
- …