42,604 research outputs found
Algebra diagrams: a HANDi introduction
A diagrammatic notation for algebra is presented – Hierarchical Al- gebra Network Diagrams, HANDi. The notation uses a 2D network notation with systematically designed icons to explicitly and coherently encode the fun- damental concepts of algebra. The structure of the diagrams is described and the rules for making derivations are presented. The key design features of HANDi are discussed and compared with the conventional formula notation in order demonstrate that the new notation is a more logical codification of intro- ductory algebra
Minimizing Communication in Linear Algebra
In 1981 Hong and Kung proved a lower bound on the amount of communication
needed to perform dense, matrix-multiplication using the conventional
algorithm, where the input matrices were too large to fit in the small, fast
memory. In 2004 Irony, Toledo and Tiskin gave a new proof of this result and
extended it to the parallel case. In both cases the lower bound may be
expressed as (#arithmetic operations / ), where M is the size
of the fast memory (or local memory in the parallel case). Here we generalize
these results to a much wider variety of algorithms, including LU
factorization, Cholesky factorization, factorization, QR factorization,
algorithms for eigenvalues and singular values, i.e., essentially all direct
methods of linear algebra. The proof works for dense or sparse matrices, and
for sequential or parallel algorithms. In addition to lower bounds on the
amount of data moved (bandwidth) we get lower bounds on the number of messages
required to move it (latency). We illustrate how to extend our lower bound
technique to compositions of linear algebra operations (like computing powers
of a matrix), to decide whether it is enough to call a sequence of simpler
optimal algorithms (like matrix multiplication) to minimize communication, or
if we can do better. We give examples of both. We also show how to extend our
lower bounds to certain graph theoretic problems.
We point out recently designed algorithms for dense LU, Cholesky, QR,
eigenvalue and the SVD problems that attain these lower bounds; implementations
of LU and QR show large speedups over conventional linear algebra algorithms in
standard libraries like LAPACK and ScaLAPACK. Many open problems remain.Comment: 27 pages, 2 table
Hopf algebras, coproducts and symbols: an application to Higgs boson amplitudes
We show how the Hopf algebra structure of multiple polylogarithms can be used
to simplify complicated expressions for multi-loop amplitudes in perturbative
quantum field theory and we argue that, unlike the recently popularized
symbol-based approach, the coproduct incorporates information about the zeta
values. We illustrate our approach by rewriting the two-loop helicity
amplitudes for a Higgs boson plus three gluons in a simplified and compact form
involving only classical polylogarithms.Comment: 46 page
Centers and Azumaya loci of finite -algebras
In this paper, we study the center of the finite -algebra
associated with a semi-simple Lie algebra
over an algebraically closed field \mathds{k} of
characteristic , and an arbitrarily given nilpotent element
. We obtain an analogue of Veldkamp's theorem on the center.
For the maximal spectrum , we show that its Azumaya locus
coincides with its smooth locus of smooth points. The former locus reflects
irreducible representations of maximal dimension for
.Comment: 31 page
M. Kontsevich's graph complex and the Grothendieck-Teichmueller Lie algebra
We show that the zeroth cohomology of M. Kontsevich's graph complex is
isomorphic to the Grothendieck-Teichmueller Lie algebra grt_1. The map is
explicitly described. This result has applications to deformation quantization
and Duflo theory. We also compute the homotopy derivations of the Gerstenhaber
operad. They are parameterized by grt_1, up to one class (or two, depending on
the definitions). More generally, the homotopy derivations of the (non-unital)
E_n operads may be expressed through the cohomology of a suitable graph
complex. Our methods also give a second proof of a result of H. Furusho,
stating that the pentagon equation for grt_1-elements implies the hexagon
equation
Minkowski Spacetime and QED from Ontology of Time
Classical mechanics, relativity, electrodynamics and quantum mechanics are
often depicted as separate realms of physics, each with its own formalism and
notion. This remains unsatisfactory with respect to the unity of nature and to
the necessary number of postulates. We uncover the intrinsic connection of
these areas of physics and describe them using a common symplectic Hamiltonian
formalism. Our approach is based on a proper distinction between variables and
constants, i.e. on a basic but rigorous ontology of time. We link these concept
with the obvious conditions for the possibility of measurements. The derived
consequences put the measurement problem of quantum mechanics and the
Copenhagen interpretation of the quantum mechanical wavefunction into
perspective. According to our (onto-) logic we find that spacetime can not be
fundamental. We argue that a geometric interpretation of symplectic dynamics
emerges from the isomorphism between the corresponding Lie algebra and the
representation of a Clifford algebra. Within this conceptional framework we
derive the dimensionality of spacetime, the form of Lorentz transformations and
of the Lorentz force and fundamental laws of physics as the Planck-Einstein
relation, the Maxwell equations and finally the Dirac equation.Comment: 36 pages, 3 figures, several typos corrected, references with title
Duality Symmetries and G^{+++} Theories
We show that the non-linear realisations of all the very extended algebras
G^{+++}, except the B and C series which we do not consider, contain fields
corresponding to all possible duality symmetries of the on-shell degrees of
freedom of these theories. This result also holds for G_2^{+++} and we argue
that the non-linear realisation of this algebra accounts precisely for the form
fields present in the corresponding supersymmetric theory. We also find a
simple necessary condition for the roots to belong to a G^{+++} algebra.Comment: 35 pages. v2: 2 appendices added, other minor corrections. v3: tables
corrected, other minor changes, one appendix added, refs. added. Version
published in Class. Quant. Gra
- …