Related papers: On the volume conjecture for classical spin networ…
We introduce semiclassical methods into the study of the volume spectrum in loop gravity. The classical system behind a 4-valent spinnetwork node is a Euclidean tetrahedron. We investigate the tetrahedral volume dynamics on phase space and…
The main goal of this paper is to prove the following two conjectures for genus up to two: 1. Witten's conjecture on the relations between higher spin curves and Gelfand--Dickey hierarchy. 2. Virasoro conjecture for target manifolds with…
The hyperbolic volume of a link complement is known to be unchanged when a half-twist is added to a link diagram, and a suitable 3-punctured sphere is present in the complement. We generalize this to the simplicial volume of link…
A method to evaluate spin networks for (2+1)-dimensional quantum gravity is given. We analyse the evaluation of spin networks for Lorentzian, Euclidean and a new limiting case of Newtonian quantum gravity. Particular attention is paid to…
We give a characterization of critical points that allows us to define a metric invariant on all Riemannian manifolds $M$ with a lower sectional curvature bound and an upper radius bound. We show there is a uniform upper volume bound for…
For a knot K in S^3 we construct according to Casson--or more precisely taking into account Lin and Heusener's further works--a volume form on the SU(2)-representation space of the group of K. We prove that this volume form is a topological…
We establish the volume conjecture for (m,2)-cables of the figure 8 knot, when m is odd. For (m,2)-cables of general knots where m is even, we show that the limit in the volume conjecture depends on the parity of the color (of the Kashaev…
Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…
Brouwer conjectured that the sum of the first $k$ largest Laplacian eigenvalues of an $n$-vertex graph is less than or equal to the number of its edges plus $\binom{k+1}{2}$ for each $k\in \{1,2,\cdots,n\}$, which has come to be known as…
The dodecahedral conjecture states that the volume of the Voronoi polyhedron of a sphere in a packing of equal spheres is at least the volume of a regular dodecahedron with inradius 1. The authors prove the conjecture following the…
We prove the volume conjecture for any twist knots by using an equivalence relation, complex analysis, analytic continuation, and function of several complex variables on the basis of colored Jones polynomials.
We introduce a new spin-fermion mapping, for arbitrary spin $S$ generating the SU(2) group algebra, that constitutes a natural generalization of the Jordan-Wigner transformation for $S=1/2$. The mapping, valid for regular lattices in any…
We construct a geometric ideal triangulation for every fundamental shadow link complement and solve the gluing equation explicitly in terms of the logarithmic holonomies of the meridians of the link for any generic character in the…
In this paper, spinor and vector decomposition of SU(2) gauge potential are presented and their equivalence is constructed using a simply proposal. We also obtain the action of Faddeev nonlinear O(3) sigma model from the SU(2) massive gauge…
We propose a generalization of pseudospin and spin symmetries, the SU(2) symmetries of Dirac equation with scalar and vector mean-field potentials originally found independently in the 70's by Smith and Tassie, and Bell and Ruegg. As…
In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable…
Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\sigma$ is the same…
We investigate lower bounds on the average degree in r-cliques in graphs of order n and size greater than t(r,n), where t(r,n) is the size of the Turan graph on n vertices and r color classes. Continuing earlier research of Edwards and…
In 2002, Nikiforov proved that for an $n$-vertex graph $G$ with clique number $\omega$ and edge number $m$, the spectral radius $\lambda(G)$ satisfies $\lambda (G) \leq \sqrt{2(1 - 1/\omega) m}$, which confirmed a conjecture implicitly…
In an earlier paper, we considered several restriction problems in the representation theory of classical groups over local and global fields. Assuming the Langlands-Vogan parameterization of irreducible representations, we formulated…