Related papers: The General O(n) Quartic Matrix Model and its appl…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
We introduce colorings of oriented surface-links by biquasiles using marked graph diagrams. We use these colorings to define counting invariants and Boltzmann enhancements of the biquasile counting invariants for oriented surface-links. We…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
We introduce multi-tribrackets, algebraic structures for region coloring of diagrams of knots and links with different operations at different kinds of crossings. In particular we consider the case of component multi-tribrackets which have…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
We describe how the entanglement renormalisation approach to topological lattice systems leads to a general procedure for treating the whole spectrum of these models, in which the Hamiltonian is gradually simplified along a parallel…
We describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$…
We propose a novel diagrammatic method for computing transport coefficients in relativistic quantum field theory. The self-consistent equation for summing the diagrams with pinch singularities has a form of a linearized kinetic equation as…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
I explain the methods that are used in field theory for problems involving typical momenta on two or more widely disparate scales. The principal topics are: (a) renormalization, which treats the problem of taking an ultra-violet cut-off to…
Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing "k-connected components" of a graph (though in a twisted way). They play an important role in…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…
Matrix Factorization has emerged as a widely adopted framework for modeling data exhibiting low-rank structures. To address challenges in manifold learning, this paper presents a subspace-constrained quadratic matrix factorization model.…
Let $K$ be a link of Conway's normal form $C(m)$, $m \geq 0$, or $C(m,n)$ with $mn\textgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all…
Using renormalization group techniques, we examine several interesting relations among masses and mixing angles of quarks and leptons in the Standard Model. We extend the analysis to the minimal supersymmetric extension to determine its…
In this work we present a general mathematical framework to deal with Quantum Networks, i.e. networks resulting from the interconnection of elementary quantum circuits. The cornerstone of our approach is a generalization of the Choi…
Let $X$ be a normal, separated and integral scheme of finite type over $\mathbb{Z}$ and $\mathcal{M}$ a set of closed points of $X$. To a Galois cover $\tilde{X}$ of $X$ unramified over $\mathcal{M}$, we associate a quandle whose underlying…
In this manuscript, we explore the intersection of QML and TN in the context of the one-dimensional ANNNI model with a transverse field. The study aims to concretely connect QML and TN by combining them in various stages of algorithm…
We propose a matrix model which embodies the semiclassical approach to the problem of quantum transport in chaotic systems. Specifically, a matrix integral is presented whose perturbative expansion satisfies precisely the semiclassical…
The coming quantum computation is forcing us to reexamine the cryptosystems people use. We are applying graph colorings of topological coding to modern information security and future cryptography against supercomputer and quantum computer…