English
Related papers

Related papers: Pair-Trace Absorption Certificates for Regular Ind…

200 papers

We measured the single-photon detection efficiency of NbN superconducting single photon detectors as a function of the polarization state of the incident light for different wavelengths in the range from 488 nm to 1550 nm. The polarization…

In an earlier publication, the last two authors showed that a finite-dimensional module for a quantum affine algebra of type $A$ whose $q$-factorization graph is totally ordered is prime. In this paper, we continue the investigation of the…

Representation Theory · Mathematics 2025-11-20 Matheus Brito , Adriano Moura , Clayton Silva

Here we study the initial trace problem for the nonnegative solutions of the equation \[ u\_{t}-\Delta u+|\nabla u|^{q}=0 \] in $Q\_{\Omega,T}=\Omega\times\left( 0,T\right) ,$ $T\leqq\infty,$ where $q>0,$ and $\Omega=\mathbb{R}^{N},$ or…

Analysis of PDEs · Mathematics 2015-02-13 Marie-Françoise Bidaut-Véron , Nguyen Anh Dao

We show that if f: X --> Y is a finite, separable morphism of smooth curves defined over a finite field F_q, where q is larger than an explicit constant depending only on the degree of f and the genus of X, then f maps X(F_q) surjectively…

Number Theory · Mathematics 2008-06-09 Robert M. Guralnick , Thomas J. Tucker , Michael E. Zieve

We study the parity-perturbed Hofstadter-type recursion $$ Q(1)=Q(2)=1,\qquad Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n . $$ We prove, by computer-certified finite-state induction, that this recursion is well-defined for all $(n\ge 1)$. The proof…

Combinatorics · Mathematics 2026-05-19 Marco Mantovanelli

Let $C_{2k_1, 2k_2, \ldots, 2k_t}$ denote the graph obtained by intersecting $t$ distinct even cycles $C_{2k_1}, C_{2k_2}, \ldots, C_{2k_t}$ at a unique vertex. In this paper, we determine the unique graphs with maximum adjacency spectral…

Combinatorics · Mathematics 2023-08-25 Dheer Noal Desai

For a connected graph G=(V,E), a subset U of V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is…

Computational Complexity · Computer Science 2014-10-30 Barnaby Martin , Daniel Paulusma

We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…

Differential Geometry · Mathematics 2011-08-30 Mohammad Ghomi , Ralph Howard

We study the finite dimensional modules on the half-quantum group u_q^+ at a root of unity q, whose action can be extended to u_q (quotient of the quantized enveloping algebra of sl_2). We derive decomposition formulas of the tensor product…

Quantum Algebra · Mathematics 2007-05-23 Elisabet Gunnlaugsdottir

Let $G$ be a locally compact totally disconnected topological group. Under a necessary mild assumption, we show that the irreducible unitary representations of $G$ are uniformly admissible if and only if the irreducible smooth…

Representation Theory · Mathematics 2018-10-16 Uriya A. First , Thomas Rüd

Let V^L and V^R be simple vertex operator algebras satisfying certain natural uniqueness-of-vacuum, complete reducibility and cofiniteness conditions and let F be a conformal full field algebra over the tensor product of V^L and V^R. We…

Quantum Algebra · Mathematics 2013-11-28 Yi-Zhi Huang , Liang Kong

We describe properties of the nonstandard q-deformation U'_q(so_n) of the universal enveloping algebra U(so_n) of the Lie algebra so_n which does not coincide with the Drinfeld--Jimbo quantum algebra U_q(so_n). In particular, it is shown…

Quantum Algebra · Mathematics 2007-05-23 N. Z. Iorgov , A. U. Klimyk

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

Formal Languages and Automata Theory · Computer Science 2026-04-28 Marius Bozga , Radu Iosif , Florian Zuleger

A T-graph (a special case of a chordal graph) is the intersection graph of connected subtrees of a suitable subdivision of a fixed tree T . We deal with the isomorphism problem for T-graphs which is GI-complete in general - when T is a part…

Discrete Mathematics · Computer Science 2022-03-01 Deniz Ağaoğlu Çağırıcı , Petr Hliněný

The optical conductivity of Ba(Fe$_{0.92}$Co$_{0.08}$)$_2$As$_2$ shows a clear signature of the superconducting gap, but a simple $s$-wave description fails in accounting for the low frequency response. This task is achieved by introducing…

Superconductivity · Physics 2010-10-20 R. P. S. M. Lobo , Y. M. Dai , U. Nagel , T. Room , J. P. Carbotte , T. Timusk , A. Forget , D. Colson

For a germ $(X,0)$ of a normal complex analytic surface, let $E:=H^0({}^p_+IC_X\mathbb Z)_0$, where ${}^pIC_X\mathbb Z$ and ${}^p_+IC_X\mathbb Z$ denote the ordinary and dual middle-perversity intersection complexes with integral…

Algebraic Geometry · Mathematics 2026-04-27 Abdul Rahman

In this short note we construct an embedding of the planar algebra for $\overline{\operatorname{Rep}(U_q(sl_3))}$ at $q = e^{2\pi i \frac{1}{24}}$ into the graph planar algebra of di Francesco and Zuber's candidate graph…

Quantum Algebra · Mathematics 2024-02-02 Cain Edie-Michell , Lance Marinelli

It is well known that for irreducible, square-integrable representations of a locally compact group, there exist so-called admissible vectors which allow the construction of generalized continuous wavelet transforms. In this paper we…

Functional Analysis · Mathematics 2016-09-07 Hartmut Fuehr

For $S \subseteq \mathbb{R}$, positive integer $n$, and $d > 0$, let $G(S^n, d)$ be the graph whose vertex set is $S^n$ where any two vertices are adjacent if and only if they are Euclidean distance $d$ apart. The primary question we will…

Combinatorics · Mathematics 2021-08-18 Matt Noble

In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic…

Combinatorics · Mathematics 2012-03-05 Boris Alexeev , Alexandra Fradkin , Ilhee Kim