Related papers: Equiangular tight frames with centroidal symmetry
The symmetry data of a $d$-dimensional quantum field theory (QFT) can often be captured in terms of a higher-dimensional symmetry topological field theory (SymTFT). In top down (i.e., stringy) realizations of this structure, the QFT in…
A comprehensive symmetry resolution of the entanglement entropy (EE) in $(1+1)$-d rational conformal field theories (RCFT) with categorical non-invertible symmetries is presented. This amounts to symmetry resolving the entanglement with…
An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…
The supersymmetric model developed by Witten to study the equivariant cohomology of a manifold with an isometric circle action is derived from the BRST quantization of a simple classical model. The gauge-fixing process is carefully…
Subgraph pattern detection aims to uncover complex interaction structures in graphs. However, state-of-the-art graph neural network (GNN)-based solutions assume centralized access to the entire graph. When graphs are instead distributed…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
We study the properties of a set of vectors called tight frames that obtained as the orthogonal projection of some orthonormal basis of $\R^n$ onto $\R^k.$ We show that a set of vectors is a tight frame if and only if the set of all cross…
In this paper we use the AdS/CFT correspondence to refine and then establish a set of old conjectures about symmetries in quantum gravity. We first show that any global symmetry, discrete or continuous, in a bulk quantum gravity theory with…
The bulk-edge correspondence for topological quantum liquids states that the spectrum of the reduced density matrix of a large subregion reproduces the thermal spectrum of a physical edge. This correspondence suggests an intricate…
In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. (*) Panchromatic Graphs: For fixed integer k, a k-panchromatic graph is, roughly speaking, a…
This paper presents an elementary introduction to Consistent Quantum Theory (CQT), as developed by Griffiths and others over the past 25 years. The theory is a version of orthodox(Copenhagen) quantum mechanics, based on the notion that the…
De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted treewidth resulting…
Enhancement of global symmetry and supersymmetry in the infrared is one of the most intriguing phenomena in quantum field theory. We investigate such phenomena in a large class of three dimensional superconformal field theories, known as…
A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. [8] provided a characterization of equimatchable graphs with girth at least $5$. In this paper, we extend this result by providing a…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
Steiner Tree Packing (STP) is a notoriously hard problem in classical complexity theory, which is of practical relevance to VLSI circuit design. Previous research has approached this problem by providing heuristic or approximate algorithms.…
Atmospheric and oceanic mass transport near the equator display a well-studied asymmetry characterized by two modes moving eastward. This asymmetric edge transport is characteristic of interfaces separating two-dimensional topological…
The purpose of this note is to discuss several results that have been obtained in the last decade in the context of sharp adjoint Fourier restriction/Strichartz inequalities. Rather than aiming at full generality, we focus on several…
The $f$ adjacency matrix is a type of edge-weighted adjacency matrix, whose weight of an edge $ij$ is $f(d_i,d_j)$, where $f$ is a real symmetric function and $d_i,d_j$ are the degrees of vertex $i$ and vertex $j$. The $f$-spectral radius…