Related papers: Pair-Trace Absorption Certificates for Regular Ind…
A connected graph $G$ is of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently if the distance matrix is conditionally negative definite, or equivalently if the quadratic embedding constant $\mathrm{QEC}(G)$ is…
Work of Glover and Huneke shows that a cubic graph embeds into the real projective plane if and only if it does not contain one of six topological minors called cubic projective plane obstructions. Here we classify up to equivalence the…
Leighton's Graph Covering Theorem states that if two finite graphs have the same universal covering tree, then they also have a common finite degree cover. Bass and Kulkarni gave an alternative proof of this fact using tree lattices. We…
It was conjectured by Gupta et al. [Combinatorica04] that every planar graph can be embedded into $\ell_1$ with constant distortion. However, given an $n$-vertex weighted planar graph, the best upper bound on the distortion is only…
A directed graph $G$ is upward planar if it admits a planar embedding such that each edge is $y$-monotone. Unlike planarity testing, upward planarity testing is NP-hard except in restricted cases, such as when the graph has the…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
Let $U_q(\hat{\cal G})$ be a quantized affine Lie algebra. It is proven that the universal R-matrix $R$ of $U_q(\hat{\cal G})$ satisfies the celebrated conjugation relation $R^\dagger=TR$ with $T$ the usual twist map. As applications, braid…
We study the interplay between embedding constrained planarity and hybrid planarity testing. We consider a constrained planarity testing problem, called 1-Fixed Constrained Planarity, and prove that this problem can be solved in quadratic…
Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough results and led to development of new techniques both within…
The use of a few intermediate qutrits for efficient decomposition of 3-qubit unitary gates has been proposed, to obtain an exponential reduction in the depth of the decomposed circuit. An intermediate qutrit implies that a qubit is operated…
We consider the problem of neutral inclusions for two-dimensional conductivity and anti-plane elasticity. The neutral inclusion, when inserted in a matrix having a uniform field, does not disturb the field outside the inclusion. The…
We study the uniform query reliability problem, which asks, for a fixed Boolean query Q, given an instance I, how many subinstances of I satisfy Q. Equivalently, this is a restricted case of Boolean query evaluation on tuple-independent…
We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting the k-vertex induced subgraphs having an odd number of edges.…
Recent medical image segmentation methods apply implicit neural representation (INR) to the decoder for achieving a continuous coordinate decoding to tackle the drawback of conventional discrete grid-based data representations. However, the…
Let A be a simple, unital, exact, and finite C*-algebra which absorbs the Jiang-Su algebra Z tensorially. We prove that the Cuntz semigroup of A admits a complete order embedding into an ordered semigroup obtained from the Elliott invariant…
Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…
A dominating induced matching, also called an efficient edge domination, of a graph $G=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges is a subset $F \subseteq E$ of edges in the graph such that no two edges in $F$ share a common endpoint…
We study the discrete groups $\Lambda$ whose duals embed into a given compact quantum group, $\hat{\Lambda}\subset G$. In the matrix case $G\subset U_n^+$ the embedding condition is equivalent to having a quotient map $\Gamma_U\to\Lambda$,…
G.W. Mackey's celebrated obstruction theory for projective representations of locally compact groups was remarkably generalized by J. M. G. Fell and R. S. Doran to the wide area of saturated Banach *-algebraic bundles. Analogous obstruction…
We experimentally demonstrate single beam directional perfect absorption (to within experimental accuracy) of p-polarized light in the near-infrared using unpatterned, deep subwavelength films of indium tin oxide (ITO) on Ag. The…