Related papers: Two statements on path systems related to quantum …
We consider the distribution of quadratic Gauss paths, polygonal paths joining partial sums of quadratic Gauss sums to square-free fundamental discriminant moduli in a dyadic range [Q,2Q]. We prove that this striking ensemble converges in…
We consider the number of paths that must pass through a subset $X$ of vertices of a network $N$ in a maximum sequence of arc-disjoint paths connecting two vertices $y$ and $z$. We show that when $X$ is a singleton, that number equals the…
We prove relations between the number of $k$-connected components of a graph, Crapo's invariant $\beta(M)$ of a matroid, and Speyer's polynomial $g_M(t)$. These yield a simple interpretation of $g_M'(-1)$ when $M$ is graphic or cographic.…
The author has previously constructed a class of admissible vector fields on the path space of an elliptic diffusion process $x$ taking values in a closed compact manifold. In this Note the existence of flows for this class of vector fields…
Two photon-pair creation processes can be arranged such that the paths of the emitted photons are identical. Thereby the path information is not erased but is never born in the first place. In addition to its implications for fundamental…
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…
Let $g:\mathbb{R}^2\to\mathbb{R}$ be a homogeneous polynomial of degree $p>1$, $G=(-g'_{y}, g'_{x})$ be its Hamiltonian vector field, and $G_t$ be the local flow generated by $G$. Denote by $E(G,O)$ the space of germs of $C^{\infty}$…
Differential calculus on the space of asymptotically linear curves is developed. The calculus is applied to the vortex filament equation in its Hamiltonian description. The recursion operator generating the infinite sequence of commuting…
We study multiplicative properties of the (quantum) dual canonical basis B* associated to a semi-simple complex Lie group G. We provide a subset D of B* such that the following property holds : if two elements b, b' in B* q-commute and if…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph K_h as a minor.
The Hadwiger number $h(G)$ is the order of the largest complete minor in $G$. Does sufficient Hadwiger number imply a minor with additional properties? In [2], Geelen et al showed $h(G)\geq (1+o(1))ct\sqrt{\ln t}$ implies $G$ has a…
Fill each box in a Young diagram with the number of paths from the bottom of its column to the end of its row, using steps north and east. Then, any square sub-matrix of this array starting on the south-east boundary has determinant one. We…
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…
This paper gives the quantum walks determined by graph zeta functions. The result enables us to obtain the characteristic polynomial of the transition matrix of the quantum walk, and it determines the behavior of the quantum walk. We treat…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Answering a question of Claudet, we prove that the uniformly random graph $G\sim \mathbb G(n, 1/2)$ is $\Omega(\sqrt n)$-vertex-minor universal with high probability. That is, for some constant $\alpha\approx 0.911$, any graph on any…