Related papers: Combinatorial study of graphs arising from the Sac…
We argue that in certain class of coupled Sachdev-Ye-Kitaev(SYK) models the low energy physics at large N is governed by a non-local action rather than the Schwartzian action. We present a partial analytic and extensive numerical evidence…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We study the behavior of a single electron transistor (SET) represented by a dissipative tunnel junction between a pair of quantum dots described by two (possibly, different) Sachdev-Ye-Kitaev (SYK) models. A combined influence of the soft…
Certain models with rank-$3$ tensor degrees of freedom have been shown by Gurau and collaborators to possess a novel large $N$ limit, where $g^2 N^3$ is held fixed. In this limit the perturbative expansion in the quartic coupling constant,…
This short note contains a combinatorial construction of symmetries arising in symplectic geometry (partially wrapped or infinitesimal Fukaya categories), algebraic geometry (derived categories of singularities), and K-theory (Waldhausen's…
A model of color particle confinement is considered. The model is based on the Snyder-Yang algebra, which takes into account a non-commutativity of generalized momenta and coordinates of a color particle and contains two new constants. An…
This paper is an introduction to the language of Feynman Diagrams. We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic expansions of Gaussian integrals can be written as a sum over a suitable…
Tensor models and, more generally, group field theories are candidates for higher-dimensional quantum gravity, just as matrix models are in the 2d setting. With the recent advent of a 1/N-expansion for coloured tensor models, more focus has…
In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify…
We study spectral and thermodynamic properties of the Sachdev-Ye-Kitaev model, a variant of the $k$-body embedded random ensembles studied for several decades in the context of nuclear physics and quantum chaos. We show analytically that…
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…
We investigate the supersymmetric Sachdev-Ye-Kitaev (SYK) model, $N$ Majorana fermions with infinite range interactions in $0+1$ dimensions. We have found that, close to the ground state $E \approx 0$, discrete symmetries alter…
We show that a variant of the Gross-Neveu Yukawa model with disorder provides a real, nonsupersymmetric generalization of the Sachdev-Ye Kitaev (SYK) model to three dimensions. The model contains $M$ real scalar fields and $N$ Dirac (or…
Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
We develop a systematic and unified random matrix theory to classify Sachdev-Ye-Kitaev (SYK) and supersymmetric (SUSY) SYK models and also work out the structure of the energy levels in one periodic table. The SYK with even $q$- and SUSY…
Sachdev-Ye-Kitaev (SYK) model, which describes $N$ randomly interacting Majorana fermions in 0+1 dimension, is found to be an solvable UV-complete toy model for holographic duality in nearly AdS$_2$ dilaton gravity. Ref. [1] proposed a…
A uniquely $k$-colourable graph is a graph with exactly one partition of the vertex set into at most $k$ colour classes. Here, we investigate some constructions of uniquely $k$-colourable graphs and give a construction of $K_k$-free…
The sparse version of the Sachdev-Ye-Kitaev (SYK) model reproduces essential features of the original SYK model while reducing the number of disorder parameters. In this paper, we propose a further simplification of the model which we call…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…