Related papers: Two statements on path systems related to quantum …

Determining the minimum genus of a graph is a fundamental optimisation problem in the study of network design and implementation as it gives a measure of non-planarity of graphs. In this paper, we are concerned with determining the smallest…

A dominating set $S$ of a graph $G$ of order $n$ is a subset of the vertices of $G$ such that every vertex is either in $S$ or adjacent to a vertex of $S$. %The domination number $G$, denoted $\gamma (G)$, is the cardinality of the smallest…

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…

Lov\'{a}sz proved that two graphs $G$ and $H$ are isomorphic if $\hom(K,G) = \hom(K,H)$ for all graphs $K$, where $\hom(G_1,G_2)$ denotes the number of homomorphisms from $G_1$ to $G_2$. Dvo\v{r}\'{a}k showed that it suffices to count…

We give a new determinant expression for the characteristic polynomial of the bond scattering matrix of a quantum graph G. Also, we give a decomposition formula for the characteristic polynomial of the bond scattering matrix of a regular…

We exhibit a new obstacle to the nascent algorithmic theory for classes excluding an induced minor. We indeed show that on the class of string graphs -- which avoids the 1-subdivision of, say, $K_5$ as an induced minor -- Induced 2-Disjoint…

We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…

In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…

In quantum mechanics, often it is important for the representation of quantum system to study the structure-preserving bijective maps of the quantum system. Such maps are also called isomorphisms or automorphisms. In this note, using the…

In a previous work it is shown that every finite group $G$ of diffeomorphisms of a connected smooth manifold $M$ of dimension $\geq 2$ equals, up to quotient by the flow, the centralizer of the group of smooth automorphisms of a…

We recall the construction of the Kontsevich graph orientation morphism $\gamma \mapsto {\rm O\vec{r}}(\gamma)$ which maps cocycles $\gamma$ in the non-oriented graph complex to infinitesimal symmetries $\dot{\mathcal{P}} = {\rm…

For the case of reduction onto the non-zero momentum level, in the problem of the path integral quantization of a scalar particle motion on a smooth compact Riemannian manifold with the given free isometric action of the compact semisimle…

We consider a locally path-connected compact metric space $K$ with finite first Betti number $b_1(K)$ and a flow $(K, G)$ on $K$ such that $G$ is abelian and all $G$-invariant functions $f\in\mathrm{C}(K)$ are constant. We prove that every…

The first non-obvious case of Hadwiger's Conjecture states that every graph $G$ with chromatic number at least 4 has a $K_4$ minor. We give a new proof that derives the $K_4$ minor from a proper 3-coloring of a subgraph of $G$.

Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a lattice in $G$, let $O$ be an open subset of $X$, and let $F = \{g_t: t\ge 0\}$ be a one-parameter subsemigroup of $G$. Consider the set of points in $X$ whose $F$-orbit misses…

In the paper "Formality conjecture" (1996) Kontsevich designed a universal flow $\dot{\mathcal{P}}=\mathcal{Q}_{a:b}(\mathcal{P})=a\Gamma_{1}+b\Gamma_{2}$ on the spaces of Poisson structures $\mathcal{P}$ on all affine manifolds of…

We consider a family of schemes, that are defined by minors of a homogeneous symmetric matrix with polynomial entries. We assume that they have maximal possible codimension, given the size of the matrix and of the minors that define them.…

The age $\mathcal{A}(G)$ of a graph $G$ (undirected and without loops) is the collection of finite induced subgraphs of $G$, considered up to isomorphy and ordered by embeddability. It is well-quasi-ordered (wqo) for this order if it…

We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other, in the sense that the flow saturates the cut and is zero…