14,552 research outputs found
On the frontiers of polynomial computations in tropical geometry
We study some basic algorithmic problems concerning the intersection of
tropical hypersurfaces in general dimension: deciding whether this intersection
is nonempty, whether it is a tropical variety, and whether it is connected, as
well as counting the number of connected components. We characterize the
borderline between tractable and hard computations by proving
-hardness and #-hardness results under various
strong restrictions of the input data, as well as providing polynomial time
algorithms for various other restrictions.Comment: 17 pages, 5 figures. To appear in Journal of Symbolic Computatio
Minsky machines and algorithmic problems
This is a survey of using Minsky machines to study algorithmic problems in
semigroups, groups and other algebraic systems.Comment: 19 page
The maximum likelihood degree of Fermat hypersurfaces
We study the critical points of the likelihood function over the Fermat
hypersurface. This problem is related to one of the main problems in
statistical optimization: maximum likelihood estimation. The number of critical
points over a projective variety is a topological invariant of the variety and
is called maximum likelihood degree. We provide closed formulas for the maximum
likelihood degree of any Fermat curve in the projective plane and of Fermat
hypersurfaces of degree 2 in any projective space. Algorithmic methods to
compute the ML degree of a generic Fermat hypersurface are developed throughout
the paper. Such algorithms heavily exploit the symmetries of the varieties we
are considering. A computational comparison of the different methods and a list
of the maximum likelihood degrees of several Fermat hypersurfaces are available
in the last section.Comment: Final version. Accepted for publication on Journal of Algebraic
Statistic
A minimal nonfinitely based semigroup whose variety is polynomially recognizable
We exhibit a 6-element semigroup that has no finite identity basis but
nevertheless generates a variety whose finite membership problem admits a
polynomial algorithm.Comment: 16 pages, 3 figure
Polar Varieties and Efficient Real Elimination
Let be a smooth and compact real variety given by a reduced regular
sequence of polynomials . This paper is devoted to the
algorithmic problem of finding {\em efficiently} a representative point for
each connected component of . For this purpose we exhibit explicit
polynomial equations that describe the generic polar varieties of . This
leads to a procedure which solves our algorithmic problem in time that is
polynomial in the (extrinsic) description length of the input equations and in a suitably introduced, intrinsic geometric parameter, called
the {\em degree} of the real interpretation of the given equation system .Comment: 32 page
A New Method for Finding Vacua in String Phenomenology
One of the central problems of string-phenomenology is to find stable vacua
in the four dimensional effective theories which result from compactification.
We present an algorithmic method to find all of the vacua of any given
string-phenomenological system in a huge class. In particular, this paper
reviews and then extends hep-th/0606122 to include various non-perturbative
effects. These include gaugino condensation and instantonic contributions to
the superpotential.Comment: 27 pages, 5 .eps figures. V2: Minor corrections, reference adde
- …