Related papers: jQuery.Feyn: Drawing Feynman Diagrams with SVG
Vector format has been popular for representing icons and sketches. It has also been famous for design purposes. Regarding image editing, research on vector graphics editing rarely exists in contrast with the raster counterpart. We…
This paper summarizes the development of Veamy, an object-oriented C++ library for the virtual element method (VEM) on general polygonal meshes, whose modular design is focused on its extensibility. The linear elastostatic and Poisson…
We propose a framework for calculating two-loop Feynman diagrams which appear within a renormalizable theory in the general mass case and at finite external momenta. Our approach is a combination of analytical results and of high accuracy…
Details of recent developments of the Feynman diagram analyzer DIANA (DIagram ANAlyser) are presented. Apart from some discussion about QGRAF and new plotting features, we concentrate on a new sophisticated mechanism of momenta mapping.
A Mathematica implementation of the program LERG-I is presented that performs the reduction of tensor integrals, encountered in one-loop Feynman diagram calculations, to scalar integrals. The program was originally coded in REDUCE and in…
Graph streams represent data interactions in real applications. The mining of graph streams plays an important role in network security, social network analysis, and traffic control, among others. However, the sheer volume and high dynamics…
A diagram approach to classical nonlinear stochastic field theory is introduced. This approach is intended to serve as a link between quantum and classical field theories, resulting in an independent constructive characterisation of the…
We present a light formalism for proofs that encodes their inferential structure, along with a system that transforms these representations into flow-chart diagrams. Such diagrams should improve the comprehensibility of proofs. We discuss…
Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…
Direct manipulation interfaces provide intuitive and interactive features to a broad range of users, but they often exhibit two limitations: the built-in features cannot possibly cover all use cases, and the internal representation of the…
The Fried-Yennie gauge is a covariant gauge for which the mass-shell renormalization procedure can be performed without introducing spurious infrared divergences to the theory. It is usually applied in calculations in regular…
Control flow graphs (CFGs) are essential tools for understanding program behavior, yet the size of real-world CFGs makes them difficult to interpret. With thousands of nodes and edges, sophisticated graph drawing algorithms are required to…
This report introduces Juno, a modular Python package for optical design and simulation. Juno consists of a complete library that includes a graphical user interface to design and visualise arbitrary optical elements, set up wave…
In this lecture series I will give a fundamental insight into configuration space techniques which are of help to calculate a broad class of Feynman diagrams, the sunrise-type diagrams. Applications are shown along with basic concepts and…
We present the new version of the FeynGrav. The package provides tools to operate with Feynman rules for quantum gravity within FeynCalc. The latest version improves package efficiency and implements new physical models. We discover…
The calculation of the symmetry factor corresponding to a given Feynman diagram is well known to be a tedious problem. We have derived a simple formula for these symmetry factors. Our formula works for any diagram in scalar theory ($\phi^3$…
Automating the creation of scientific diagrams from academic papers can significantly streamline the development of tutorials, presentations, and posters, thereby saving time and accelerating the process. Current text-to-image models…
The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a type of tensor networks that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we can intuitively reason about quantum theory, and optimise…
Graph querying is the process of retrieving information from graph data using specialized languages (e.g., Cypher), often requiring programming expertise. Visual Graph Querying (VGQ) streamlines this process by enabling users to construct…
This article describes three Mathematica packages for the automatic calculation of one-loop Feynman diagrams: the diagrams are generated with FeynArts, algebraically simplified with FormCalc, and finally evaluated numerically using the…