Related papers: Jet Graphs
We define a graph encoding the structure of contact surgery on contact 3-manifolds and analyze its basic properties and some of its interesting subgraphs.
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We study derivations and differential forms on the arithmetic jet spaces of smooth schemes, relative to several primes. As applications we give a new interpretation of arithmetic Laplacians and we discuss the de Rham cohomology of some…
The solar atmosphere is full of complicated transients manifesting the reconfiguration of solar magnetic field and plasma. Solar jets represent collimated, beam-like plasma ejections; they are ubiquitous in the solar atmosphere and…
High energy jets and their associated event shapes provide a window into the transition between elementary and composite degrees of freedom in quantum chromodynamics. This talk reviews some methods and a few principles that have led to…
In this note we discuss some arithmetic and geometric questions concerning self maps of projective algebraic varieties.
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
Jet schemes and arc spaces received quite a lot of attention by researchers after their introduction, due to J. Nash, and established their importance as an object of study in M. Kontsevich's motivic integration theory. Several results…
In most studies related to colouring of graphs and perhaps in the study of other invariants and variants of graphs, the restrictions of non-triviality and connectedness are placed upon graphs. For the introduction to comp\^{o}nent\u{a}…
Ambiguities of jet algorithms are reinterpreted as instability wrt small variations of input. Optimal stability occurs for observables possessing property of calorimetric continuity (C-continuity) predetermined by kinematical structure of…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
This paper is devoted to qualgebras and squandles, which are quandles enriched with a compatible binary/unary operation. Algebraically, they are modeled after groups with conjugation and multiplication/squaring operations. Topologically,…
As the LHC prepares to start taking data, this review is intended to provide a QCD theorist's understanding and views on jet finding at hadron colliders, including recent developments. My hope is that it will serve both as a primer for the…
The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…
We develop a generalized field space geometry for higher-derivative scalar field theories, expressing scattering amplitudes in terms of a covariant geometry on the all-order jet bundle. The incorporation of spacetime and field derivative…