Related papers: Pair-Trace Absorption Certificates for Regular Ind…
We propose quantum circuits to test interferometric complementarity using symmetric two-way interferometers coupled to a which-path detector. First, we consider the two-qubit setup in which the controlled transfer of path information to the…
We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…
We investigate graph transformations, defined using Datalog-like rules based on acyclic conjunctive two-way regular path queries (acyclic C2RPQs), and we study two fundamental static analysis problems: type checking and equivalence of…
This work examines the problem of graph learning over a diffusion network when data can be collected from a limited portion of the network (partial observability). The main question is to establish technical guarantees of consistent…
This paper is the continuation of \cite{CXY}. Let ${\bf G}$ be a simply connected semisimple algebraic group over $\Bbbk=\bar{\mathbb{F}}_q$, the algebraically closure of $\mathbb{F}_q$ (the finite field with $q=p^e$ elements), and $F$ be…
Let X be a Hausdorff quotient of a standard space (that is of a locally compact separable metric space). It is shown that the following are equivalent: (i) X is the image of an irreducible quotient map from a standard space; (ii) X has a…
Unit disk graphs are the intersection graphs of unit radius disks in the Euclidean plane. Deciding whether there exists an embedding of a given unit disk graph, i.e. unit disk graph recognition, is an important geometric problem, and has…
Real-world systems ranging from airline routes to cryptocurrency transfers are naturally modelled as dynamic graphs whose topology changes over time. Conventional benchmarks judge dynamic-graph learners by a handful of task-specific scores,…
Graph matching refers to finding node correspondence between graphs, such that the corresponding node and edge's affinity can be maximized. In addition with its NP-completeness nature, another important challenge is effective modeling of…
Outerplanar Tur\'an problem has received considerable attention recently. We study the spectral version via $Q$-index. We determine the unique graph that maximizes the $Q$-index among all $n$-vertex connected outerplanar graphs which are…
Let F be a closed orientable surface. If i,i':F \to R^3 are two regularly homotopic generic immersions, then it has been shown in [N] that all generic regular homotopies between i and i' have the same number mod 2 of quadruple points. We…
Let Q be a finite quiver without oriented cycles. Denote by U --> M the fine moduli space of stable thin sincere representations of Q with respect to the canonical stability notion. We prove Ext^i(U,U) = 0 for all i >0 and compute the…
Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…
We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs $H$ with components of sublinear order. As a corollary, we recover and extend the work of K\"uhn and…
In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…
Important objects of study in $\tau$-tilting theory include the $\tau$-tilting pairs over an algebra on the form $kQ/I$, with $kQ$ being a path algebra and $I$ an admissible ideal. In this paper, we study aspects of the combinatorics of…
Using the decomposition of rational conformal filed theory characters for the ${\mathbb Z}_k$ parafermion quantum Hall droplets for general $k=2,3, \ldots$, we derive analytically the full modular $S$ matrix for these states, including the…
Graph operations or products play an important role in complex networks. In this paper, we study the properties of $q$-subdivision graphs, which have been applied to model complex networks. For a simple connected graph $G$, its…
We show that Connes' embedding conjecture on von Neumann algebras is equivalent to the existence of certain algebraic certificates for a polynomial in noncommuting variables to satisfy the following nonnegativity condition: The trace is…
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead…