Related papers: Pair-Trace Absorption Certificates for Regular Ind…
For $p,q\ge2$ the $\{p,q\}$-tiling graph is the (finite or infinite) planar graph $T_{p,q}$ where all faces are cycles of length $p$ and all vertices have degree $q$. We give algorithms for the problem of recognizing (induced) subgraphs of…
The uniform tracial completion of a C*-algebra A with compact non-empty trace space T(A) is obtained by completing the unit ball with respect to the uniform 2-seminorm $\|a\|_{2,T(A)}=\sup_{\tau \in T(A)} \tau(a^*a)^{1/2}$. The trace…
We show that unitary representations of simply connected, semisimple algebraic groups over local fields of characteristic zero obey a spectral gap absorption principle: that is, that spectral gap is preserved under tensor products. We do…
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$…
Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on $n$ vertices and a positive integer parameter $k$, find if there exist $k$ edges (arcs)…
Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. FPQ-trees are a variant of PQ-trees that includes F-nodes in…
We propose and analyze an efficient scheme for suppressing the absorption of a weak probe field based on intersubband transitions in a four-level asymmetric coupled-quantum well (CQW) driven coherently by a probe laser field and a control…
This paper focuses on the embeddability of hypercubes in an important class of Cayley graphs, known as augmented cubes. An $n$-dimensional augmented cube $AQ_n$ is constructed by augmenting the $n$-dimensional hypercube $Q_n$ with…
We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be determined in polynomial time by a simple reduction to the…
Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection…
The admissibility problem in integral geometry asks for which collections of affine subspaces the Radon transform remains injective. In the discrete setting, this becomes a purely combinatorial question about recovering a function on a…
Given a class of graphs $\mathcal{H}$, the problem $\oplus\mathsf{Sub}(\mathcal{H})$ is defined as follows. The input is a graph $H\in \mathcal{H}$ together with an arbitrary graph $G$. The problem is to compute, modulo $2$, the number of…
In the realm of video object tracking, auxiliary modalities such as depth, thermal, or event data have emerged as valuable assets to complement the RGB trackers. In practice, most existing RGB trackers learn a single set of parameters to…
The problem of the description of finite factor representations of the infinite-dimensional unitary group, investigated by Voiculescu in 1976, is equivalent to the description of all totally positive Toeplitz matrices. Vershik-Kerov showed…
We introduce the notion of dual perfect bases and dual perfect graphs. We show that every integrable highest weight module $V_q(\lambda)$ over a quantum generalized Kac-Moody algebra $U_{q}(\mathcal{g})$ has a dual perfect basis and its…
The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…
An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be…
The problem of joint universal source coding and identification is considered in the setting of fixed-rate lossy coding of continuous-alphabet memoryless sources. For a wide class of bounded distortion measures, it is shown that any…
In a previous paper, we showed that the problem of tunneling in quantum wires was integrable in the isotropic case $g_\sigma=2$. In the present work, we continue the exploration of the general phase diagram by looking for other integrable…
The path space of an inhomogeneous vertex model constructed from the vector representation of $U_q\bigl(gl(2|2)\bigr)$ and its dual is studied for various choices of composite vertices and assignments of $gl(2|2)$-weights. At $q=0$, the…