English
Related papers

Related papers: The Bethe Partition Function of Log-supermodular G…

200 papers

Hecke operators acting on modular functions arise naturally in the context of 2d conformal field theory, but in seemingly disparate areas, including permutation orbifold theories, ensembles of code CFTs, and more recently in the context of…

High Energy Physics - Theory · Physics 2026-04-10 Nico Cooper

We revisit the factorisation of supersymmetric partition functions of 3d $\mathcal{N}=4$ gauge theories. The building blocks are hemisphere partition functions of a class of UV $\mathcal{N}=(2,2)$ boundary conditions that mimic the presence…

High Energy Physics - Theory · Physics 2021-05-12 Mathew Bullimore , Samuel Crew , Daniel Zhang

We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.…

Optimization and Control · Mathematics 2024-03-01 Rajan Udwani

We define and study an inference algorithm based on "belief propagation" (BP) and the Bethe approximation. The idea is to encode into a graph an a priori information composed of correlations or marginal probabilities of variables, and to…

Physics and Society · Physics 2007-05-23 Cyril Furtlehner , Jean-Marc Lasgouttes , Arnaud De La Fortelle

In 1970 Baxter considered the statistical three-coloring lattice model for the case of toroidal boundary conditions. He used the Bethe ansatz and found the partition function of the model in the thermodynamic limit. We consider the same…

Mathematical Physics · Physics 2015-05-13 A. V. Razumov , Yu. G. Stroganov

The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…

Statistical Mechanics · Physics 2020-11-23 Nikolay Bogoliubov , Cyril Malyshev

We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of…

Combinatorics · Mathematics 2024-01-09 Tara Abrishami , Maria Chudnovsky , Cemil Dibek , Kristina Vušković

Using unitary equivalence of magnetic translation operators, explicit upper and lower convex bounds on the partition function of the Hofstadter model are given for any rational ``flux" and any value of Bloch momenta. These bounds (i)…

Condensed Matter · Physics 2009-10-28 Alexander Moroz

The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti and M. M\'ezard [Eur. Phys. B. 57, 175…

Portfolio Management · Quantitative Finance 2016-12-15 Takashi Shinzato , Muneki Yasuda

We study Bethe/gauge correspondence at the special locus of Coulomb moduli where the integrable system exhibits the splitting of degenerate levels. For this investigation, we consider the four-dimensional pure $\mathcal{N}=2$ supersymmetric…

High Energy Physics - Theory · Physics 2018-12-17 Saebyeok Jeong

We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…

Functional Analysis · Mathematics 2013-01-08 Marek Cúth

In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be computed tractably, it…

Machine Learning · Computer Science 2015-05-08 Bharath Sankaran , Marjan Ghazvininejad , Xinran He , David Kale , Liron Cohen

We derive novel conditions that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages. The computational…

Information Theory · Computer Science 2007-12-18 Joris M. Mooij , Hilbert J. Kappen

We propose an effective Bethe ansatz for solving quantum many-body systems near an integrable point. Our approach retains the functional form of the Bethe wave function while renormalizing the Bethe roots to account for…

Statistical Mechanics · Physics 2026-04-07 Wenlong Zhao , Yunfeng Jiang , Rui-Dong Zhu

We discuss schemes for exact and approximate computations of permanents, and compare them with each other. Specifically, we analyze the Belief Propagation (BP) approach and its Fractional Belief Propagation (FBP) generalization for…

Discrete Mathematics · Computer Science 2013-01-08 M. Chertkov , A. B. Yedidia

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…

Data Structures and Algorithms · Computer Science 2020-07-29 Ajinkya Gaikwad , Soumen Maity , Shuvam Kant Tripathi

Some of the classical results of Ramsey Theory can be naturally stated in terms of image partition regularity of matrices. There have been many significant results of image partition regular matrices as well as image partition regular…

Combinatorics · Mathematics 2014-09-23 Tanushree Biswas

Let $\{w_{i,j}\}_{1\leq i\leq n, 1\leq j\leq s} \subset L_m=F(X_1,...,X_m)[{\partial \over \partial X_1},..., {\partial \over \partial X_m}]$ be linear partial differential operators of orders with respect to ${\partial \over \partial…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev

The diffusion model has been a crucial component in studies about social networks. Many studies, especially these about influence maximization concern the proof of the submodularity of particular diffusion models. Such proofs have been…

Social and Information Networks · Computer Science 2020-02-28 Fangqi Li , Chong Di , Wenwen Xia

We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity lambda is sufficiently large, there is no fully polynomial randomised approximation…

Computational Complexity · Computer Science 2014-07-08 Leslie Ann Goldberg , Mark Jerrum , Colin McQuillan
‹ Prev 1 8 9 10 Next ›