Related papers: A challenge in enumerative combinatorics: The grap…
Lattice simulations can play an important role in the study of dynamical electroweak symmetry breaking by providing quantitative results on the nonperturbative dynamics of candidate theories. For this programme to succeed, it is crucial to…
This PhD thesis deals with a number of different problems in mathematical physics with the common thread that they have probabilistic aspects. The problems all stem from mathematical studies of lattice systems in statistical and quantum…
Artificial intelligence models trained through loss minimization have demonstrated significant success, grounded in principles from fields like information theory and statistical physics. This work explores these established connections…
The partition function of a quantum field theory with an exact symmetry can be decomposed into a sum of functional integrals each giving the contribution from states with definite symmetry properties. The composition rules of the…
In this paper, we provide the notions of connection $1$-forms and curvature $2$-forms on graphs. We prove a Weitzenb\"ock formula for connection Laplacians in this setting. We also define a discrete Yang-Mills functional and study its…
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|), where lambda > 0 is the vertex activity. We show that…
This is a draft of an article to appear in the October 2022 issue of the Notices of the AMS. In this survey article we explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed…
In the first part of the thesis we construct models, called integrable, in which we can perform exact computations of physical quantities. We introduce several new out-of-equilibrium models that are obtained by solving, in specific cases,…
We show that observables in QED-type theories can be realized in terms of a combinatorial structure called chord diagrams. One advantage of this combinatorial representation is that it simplifies the study of the asymptotic behavior of…
This essay advocates the view that any problem that has a meaningful empirical content, can be formulated in constructive, more definitely, finite terms. We consider combinatorial models of dynamical systems and approaches to statistical…
In this brief review, I summarize the current theoretical knowledge in supersymmetry on the lattice, with special emphasis on recent results in the framework of N=1 supersymmetric Yang Mills theory, Wess-Zumino model and Yang-Mills theory…
Lev Davidovich Landau was arguably one of the greatest and most versatile physicists. His work spans a very wide range and has had a considerable impact on all areas of physics including condensed matter physics, plasma, high energy and…
These notes are dedicated to whom may be interested in algorithms, Markov chain, coupling, and graph theory etc. I present some preliminaries on coupling and explanations of the important formulas or phrases, which may be helpful for us to…
A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…
We prove a conjecture of Bonini et al. on the precise values of the Lin--Lu--Yau curvature of conference graphs, i.e., strongly regular graphs with parameters $(4\gamma+1,2\gamma,\gamma-1,\gamma)$. Our method depends only on the parameter…
A book Chapter consisting of some of the main areas of research in graph theory applied to physics. It includes graphs in condensed matter theory, such as the tight-binding and the Hubbard model. It follows the study of graph theory and…
These notes aim to provide a pedagogical introduction to Lattice QCD. The topics covered include the scope of LQCD calculations, lattice discretization of gauge and fermion (naive, Wilson, and staggered) actions, doubling problem, improved…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer…
This is a continuation of our previous works on entanglement entropy (EE) in interacting field theories. In arXiv:2103.05303, we have proposed the notion of $\mathbb{Z}_M$ gauge theory on Feynman diagrams to calculate EE in quantum field…