Results 1  10
of
12,385
Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties
 J. Alg. Geom
, 1994
"... We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by a Newton polyhedron ∆ consists of (n − 1)dimensional CalabiYau varieties then the dual, or polar, polyhedron ∆ ∗ in the dual space defines another family F( ∆ ∗ ) of CalabiYau varieties, so that we obtain the remarkable duality between two different families of CalabiYau varieties. It is shown that the properties of this duality coincide with the properties of Mirror Symmetry discovered by physicists for CalabiYau 3folds. Our method allows to construct many new examples of CalabiYau 3folds and new candidates for their mirrors which were previously unknown for physicists. We conjecture that there exists an isomorphism between two conformal field theories corresponding to CalabiYau varieties from two families F(∆) and F( ∆ ∗). 1
Abstract A Data Locality Optimizing Algorithm
"... This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling. The loop transformation rrlgorithm is based on two concepts: a mathematical formulation of reuse and locality, and a loop transformation theory that u ..."
Abstract
 Add to MetaCart
that unifies the various transforms as unimodular matrix tmnsfonnations. The algorithm haa been implemented in the SUIF (Stanford University Intermediate Format) compiler, and is successful in optimizing codes such as matrix multiplication, successive overrelaxation (SOR), LU decomposition without pivoting
Efficient randomized patternmatching algorithms
, 1987
"... We present randomized algorithms to solve the
following stringmatching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much ..."
Abstract

Cited by 397 (1 self)
 Add to MetaCart
We present randomized algorithms to solve the
following stringmatching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much shorter strings called fingerprints, and achieve their efficiency by manipulating fingerprints instead of longer strings. The algorithms require a constant number of storage locations, and essentially run in real time. They are conceptually simple and easy to implement. The method readily generalizes to higherdimensional patternmatching problems.
Quantum field theory on noncommutative spaces
"... A pedagogical and selfcontained introduction to noncommutative quantum field theory is presented, with emphasis on those properties that are intimately tied to string theory and gravity. Topics covered include the WeylWigner correspondence, noncommutative Feynman diagrams, UV/IR mixing, noncommuta ..."
Abstract

Cited by 397 (26 self)
 Add to MetaCart
A pedagogical and selfcontained introduction to noncommutative quantum field theory is presented, with emphasis on those properties that are intimately tied to string theory and gravity. Topics covered include the WeylWigner correspondence, noncommutative Feynman diagrams, UV/IR mixing, noncommutative YangMills theory on infinite space and on the torus, Morita equivalences of noncommutative gauge theories, twisted reduced models, and an indepth study of the gauge group of noncommutative YangMills theory. Some of the more mathematical ideas and
Gravity coupled with matter and the foundation of non commutative geometry
, 1996
"... We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element ds. Its unitary representations correspond to Riemannian metrics and Spin structure while ds is the Dirac propagator ds = ×— × = D −1 where D i ..."
Abstract

Cited by 354 (18 self)
 Add to MetaCart
We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element ds. Its unitary representations correspond to Riemannian metrics and Spin structure while ds is the Dirac propagator ds = ×— × = D −1 where D is the Dirac operator. We extend these simple relations to the non commutative case using Tomita’s involution J. We then write a spectral action, the trace of a function of the length element in Planck units, which when applied to the non commutative geometry of the Standard Model will be shown (in a joint work with Ali Chamseddine) to give the SM Lagrangian coupled to gravity. The internal fluctuations of the non commutative geometry are trivial in the commutative case but yield the full bosonic sector of SM with all correct quantum numbers in the slightly non commutative case. The group of local gauge transformations appears spontaneously as a normal subgroup of the diffeomorphism group.
Branchandprice: Column generation for solving huge integer programs
 Oper. Res
, 1998
"... We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which th ..."
Abstract

Cited by 348 (13 self)
 Add to MetaCart
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which this approach decomposes the problem, provides tighter LP relaxations, and eliminates symmetry. Wethen discuss computational issues and implementation of column generation, branchandbound algorithms, including special branching rules and e cient ways to solve the LP relaxation. We also discuss the relationship with Lagrangian duality. 1
Improving Data Locality with Loop Transformations
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1996
"... ..."
Black Hole Entropy Function, Attractors and Precision Counting of Microstates
, 2007
"... In these lecture notes we describe recent progress in our understanding of attractor mechanism and entropy of extremal black holes based on the entropy function formalism. We also describe precise computation of the microscopic degeneracy of a class of quarter BPS dyons in N = 4 supersymmetric strin ..."
Abstract

Cited by 326 (28 self)
 Add to MetaCart
In these lecture notes we describe recent progress in our understanding of attractor mechanism and entropy of extremal black holes based on the entropy function formalism. We also describe precise computation of the microscopic degeneracy of a class of quarter BPS dyons in N = 4 supersymmetric string theories, and compare the statistical entropy of these dyons, expanded in inverse powers of electric and magnetic charges, with a similar expansion of the corresponding black hole entropy. This comparison is extended to include the contribution to the entropy from multicentered black holes as well.
Results 1  10
of
12,385