Related papers: Two statements on path systems related to quantum …
Recently, the authors gave Ramsey-type results for the path cover/partition number of graphs. In this paper, we continue the research about them focusing on digraphs, and find a relationship between the path cover/partition number and…
We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A $q$-colorful graph is defined as a pair $(G, \chi),$ where $G$ is a graph and $\chi$ assigns to each vertex a (possibly empty)…
The traces of the quantum powers of a generic quantum matrix pairwise commute. This was conjectured by Kaoru Ikeda, in connection with certain Hamiltonian systems. The proof involves Newton's formulae for quantum matrices, relating traces…
We propose categories of $1$-dimensional and multi-dimensional quantum walks. In the categories, an object is a quantum walk, and a morphism is an intertwining operator between two quantum walks. The new framework enables us to discuss…
A graph $H$ is an induced minor of a graph $G$ if it can be obtained from an induced subgraph of $G$ by contracting edges. Otherwise, $G$ is said to be $H$-induced minor-free. Robin Thomas showed that $K_4$-induced minor-free graphs are…
We study the evolution, under convex Hamiltonian flows on cotangent bundles of compact manifolds, of certain distinguished subsets of the phase space. These subsets are generalizations of Lagrangian graphs, we call them pseudographs. They…
The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph $G$ with vertices $s$ and $t$, the connectivity $\lambda(s,t)$ from $s$ to $t$ is defined to be…
Let $G$ be a connected graph with vertex set $V(G)=\{v_{1},v_{2},...,v_{n}\}$. The distance matrix $D(G)=(d_{ij})_{n\times n}$ is the matrix indexed by the vertices of $G,$ where $d_{ij}$ denotes the distance between the vertices $v_{i}$…
Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path. This implies there is a hamiltonian path in every connected Cayley…
Kontsevich's graph flows are -- universally for all finite-dimensional affine Poisson manifolds -- infinitesimal symmetries of the spaces of Poisson brackets. We show that the previously known tetrahedral flow and the recently obtained…
We prove that for every graph $G$ with a sufficiently large complete bipartite induced minor, either $G$ has an induced minor isomorphic to a large wall, or $G$ contains a large constellation; that is, a complete bipartite induced minor…
The Known Menger's theorem states that in a finite graph, the size of a minimum separator set of any pair of vertices is equal to the maximum number of disjoint paths that can be found between these two vertices. In this paper, we study the…
Let $G$ be a connected, simply connected, simple, complex, linear algebraic group. Let $P$ be an arbitrary parabolic subgroup of $G$. Let $X=G/P$ be the $G$-homogeneous projective space attached to this situation. We consider the (small)…
We generalize Gaeta's Theorem to the family of determinantal schemes. In other words, we show that the schemes defined by minors of a fixed size of a matrix with polynomial entries belong to the same G-biliaison class of a complete…
We define a spectral flow for paths of selfadjoint Fredholm operators that are equivariant under the orthogonal action of a compact Lie group as an element of the representation ring of the latter. This $G$-equivariant spectral flow shares…
In quantum field theory the path integral is usually formulated in the wave picture, i.e., as a sum over field evolutions. This path integral is difficult to define rigorously because of analytic problems whose resolution may ultimately…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
Paths in an appropriate geometry are usually used as trajectories of test particles in geometric theories of gravity. It is shown that non-symmetric geometries possess some interesting quantum features. Without carrying out any quantization…