Related papers: Pair-Trace Absorption Certificates for Regular Ind…
Paths $P_1,\ldots, P_k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P_i$ and $P_j$ have neither common vertices nor adjacent vertices. The Induced Disjoint Paths problem is to decide if a graph $G$ with $k$ pairs of…
We associate two modules, the $G$-parking critical module and the toppling critical module, to an undirected connected graph $G$. The $G$-parking critical module and the toppling critical module are canonical modules (with suitable twists)…
A coherent receiver that can demodulate high-speed in-phase and quadrature signals of light is an essential component for optical communication, interconnects, imaging, and computing. Conventional waveguide-based coherent receivers,…
We establish the existence of common fixed points for $C_q$-commuting self-mappings satisfying a generalized Gregus-type inequality with quadratic terms in $q$-starshaped subsets of normed linear spaces. Our framework extends classical…
A thin conducting sheet - graphene, for example - transmits, absorbs, and reflects radiation. A sheet that is very thin, even vanishingly so, can still produce 50% absorption at normal incidence if it has conductivity corresponding to half…
Subgraph matching is a compute-intensive problem that asks to enumerate all the isomorphic embeddings of a query graph within a data graph. This problem is generally solved with backtracking, which recursively evolves every possible partial…
We study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its…
A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…
Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since Q may…
Let $\mathfrak{g}$ be a complex simple Lie algebra and $U_q(\hat{\mathfrak{g}})$ the corresponding quantum affine algebra. We prove that every irreducible finite-dimensional $U_q(\hat{\mathfrak{g}})$-module gives rise to a family of…
It is conjectured by Chen and Raspaud that for each integer $k \ge 2$, any graph $G$ with \[ \mathrm{mad}(G) < \frac{2k+1}{k} \quad\text{and}\quad \mathrm{odd\text{-}girth}(G) \ge 2k+1 \] admits a homomorphism into the Kneser graph…
The world-sheet S-matrix of the string in AdS5 x S5 has been shown to admit a q-deformation that relates it to the S-matrix of a generalization of the sine-Gordon theory, which arises as the Pohlmeyer reduction of the superstring. Whilst…
In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids. We define non-even oriented matroids generalising non-even…
Recent advances in Multi-Object Tracking (MOT) have demonstrated significant success in short-term association within the separated tracking-by-detection online paradigm. However, long-term tracking remains challenging. While graph-based…
We construct a representation of $U_q(\widehat{sl}_2)$ at level $-1/2$ by using the bosonic Fock spaces. The irreducible modules are obtained as the kernel of a certain operator, in contrast to the construction by Feingold and Frenkel for…
We present a theory of electronic excitation energies and optical absorption spectra which incorporates energy-level renormalization and phonon-assisted optical absorption within a unified framework. Using time-independent perturbation…
We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the…
A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an…
This is my PhD thesis which was defended in May 2021. We call an induced cycle of length at least four a hole. The parity of a hole is the parity of its length. Forbidding holes of certain types in a graph has deep structural implications.…