Related papers: Jet Graphs
Given a scheme X over a field k, a generalized jet scheme parametrizes maps from Spec(A) to X, where A is a finite-dimensional, local algebra over k. We give an overview of known results concerning the dimensions of these schemes when A has…
Jets of modules over a commutative ring are well known to make up the representative objects of linear differential operators on these modules. In noncommutative geometry, jets of modules provide the representative objects only of a certain…
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. In this paper, we completely determine the edge chromatic number of outer 1-planar graphs.
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…
In this paper, we study the flip graph on the perfect matchings of a complete graph of even order. We investigate its combinatorial and spectral properties including connections to the signed reversal graph and we improve a previous upper…
This paper introduces a novel topology, referred to as the star topology, on finite graphs. By treating vertices and edges as points in a unified space, we explore continuous maps between Bare representations of a graph and their…
We define and study jets of flat partial connections with respect to singular foliations. In particular, we use the first sheaf of transverse jets to address the problem of extending a flat partial connection to a (flat) meromorphic…
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…
The asymptotic study of percolation on finite transitive graphs is considered. Several questions and very few answers regarding percolation on finite graphs are presented.
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
Jets, collimated outflows of particles and fields, are observed in a wide variety of astrophysical systems, including Active Galactic Nuclei of various types, microquasars, gamma-ray bursts, and young stellar objects. Despite intensive…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…
In this paper, we construct a bialgebraic and further a Hopf algebraic structure on top of subgraphs of a given graph. Further, we give the dual structure of this Hopf algebraic structure. We study the algebra morphisms induced by graph…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
We study the plane automorphisms given by polynomials with certain degree decompositions.
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
In this paper we give a brief overview of the geometry of involute gears, from a mathematical more than an engineering perspective. We also list some of the many variant geared mechanisms and discuss some of our 3D printed mechanisms.
We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.