Related papers: Symmetries of Analytic Paths
The past decade has seen a flourishing of advances in harmonic analysis of graphs. They lie at the crossroads of graph theory and such analytical tools as graph Laplacians, Markov processes and associated boundaries, analysis of path-space,…
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…
In this work we develop the path integral optimization in a class of inhomogeneous 2d CFTs constructed by putting an ordinary CFT on a space with a position dependent metric. After setting up and solving the general optimization problem, we…
The symmetric group on a set acts transitively on its subsets of a given size. We define homomorphisms between the corresponding permutation modules, defined over a field of characteristic two, which generalize the boundary maps from…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
We show that the path construction integration of Lie algebroids by Lie groupoids is an actual equivalence from the category of integrable Lie algebroids and complete Lie algebroid comorphisms to the category of source 1-connected Lie…
Path calculus, or graphical linear algebra, is a string diagram calculus for the category of matrices over a base ring. It is the usual string diagram calculus for a symmetric monoidal category, where the monoidal product is the direct sum…
We address the question of symmetries of an important type of quantum walks. We introduce all the necessary definitions and provide a rigorous formulation of the problem. Using a thorough analysis, we reach the complete answer by presenting…
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…
Leavitt path algebras are free algebras subject to relations induced by directed graphs. This paper investigates the ideals of Leavitt path algebras, with an emphasis on the relationship between graph-theoretic properties of a directed…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
We compare Hofer's geometries on two spaces associated with a closed symplectic manifold M. The first space is the group of Hamiltonian diffeomorphisms. The second space L consists of all Lagrangian submanifolds of $M \times M$ which are…
A method is presented for finding the Lie point symmetry transformations acting simultaneously on difference equations and lattices, while leaving the solution set of the corresponding difference scheme invariant. The method is applied to…
To obtain a well defined path integral one often employs discretizations. In the case of gravity and reparametrization invariant systems, the latter of which we consider here as a toy example, discretizations generically break…
We prove that on the set of lattice paths with steps N=(0,1) and E=(1,0) that lie between two fixed boundaries T and B (which are themselves lattice paths), the statistics `number of E steps shared with B' and `number of E steps shared with…
Path graphs are intersection graphs of paths in a tree.~In this paper we give a "6\ good characterization" of path graphs, namely, we prove that path graph membership is in $NP\cap CoNP$ without resorting to existing polynomial time…
2-stratifolds are a generalization of 2-manifolds in that there are disjoint simple closed curves where several sheets meet. They arise in the study of categorical invariants of 3-manifolds and may have applications to topological data…
For sufficiently tame paths in $\mathbb{R}^n$, Euclidean length provides a canonical parametrization of a path by length. In this paper we provide such a parametrization for all continuous paths. This parametrization is based on an…
A symmetry analysis is presented for the three-dimensional nonrelativistic motion of charged particles in arbitrary stationary electromagnetic fields. The general form of the Lie point symmetries is found along with the fields that respect…