Concept

Partition function (number theory)

Related publications (23)

The ABCD of topological recursion

Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of [43], seeing it as a quantisation of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial da ...

Academic Press Inc Elsevier Science2024

Hilbert series, the Higgs mechanism, and HEFT

Brian Quinn Henning

We expand Hilbert series technologies in effective field theory for the inclusion of massive particles, enabling, among other things, the enumeration of operator bases for non-linearly realized gauge theories. We find that the Higgs mechanism is manifest a ...

Springer Nature2023

Tensor network investigation of frustrated Ising models

Jeanne Colbois

In spin systems, geometrical frustration describes the impossibility of minimizing simultaneously all the interactions in a Hamiltonian, often giving rise to macroscopic ground-state degeneracies and emergent low-temperature physics. In this thesis, combin ...

EPFL2022

Tensor network investigation of the hard-square model

Frédéric Mila, Samuel Louis Nyckees

Using the corner-transfer matrix renormalization group to contract the tensor network that describes its partition function, we investigate the nature of the phase transitions of the hard-square model, one of the exactly solved models of statistical physic ...

AMER PHYSICAL SOC2022

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications

Ngoc Khanh Karol Nguyen

We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Further results on latent discourse models and word embeddings

Youssef Allouah

We discuss some properties of generative models for word embeddings. Namely, (Arora et al., 2016) proposed a latent discourse model implying the concentration of the partition function of the word vectors. This concentration phenomenon led to an asymptotic ...

Microtome Publishing2021

Entanglement Entropy from Nonequilibrium Work

Jonathan D'Emidio

The Renyi entanglement entropy in quantum many-body systems can be viewed as the difference in free energy between partition functions with different trace topologies. We introduce an external field lambda that controls the partition function topology, all ...

AMER PHYSICAL SOC2020

Experiments with the Markoff Surface

Matthew De Courcy-Ireland, Sandy Lee

We confirm, for the primes up to 3000, the conjecture of Bourgain-Gamburd-Sarnak and Baragar on strong approximation for the Markoff surface modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some natural graphs constructed fro ...

TAYLOR & FRANCIS INC2022

Functional relations in nineteen-vertex models with domain-wall boundaries

Aleksi Antoine Bossart

This work is concerned with functional properties shared by partition functions of nineteen-vertex models with domain-wall boundary conditions. In particular, we describe both Izergin-Korepin and Fateev-Zamolodchikov models with the aforementioned boundary ...

2019

Almost tiling of the Boolean lattice with copies of a poset

Istvan Tomon

Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...

ELECTRONIC JOURNAL OF COMBINATORICS2018

Lonely Runner Polyhedra

Matthias Schymura

We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...

2019

Spinner: Scalable Graph Partitioning in the Cloud

Andreas Loukas, Dionysios Logothetis

In this paper, we present a graph partitioning algorithm to partition graphs with trillions of edges. To achieve such scale, our solution leverages the vertex-centric Pregel abstraction provided by Giraph, a system for large-scale graph analytics. We desig ...

Ieee2017

Partition function on spheres: How to use zeta function regularization

Alexander Monin

It is known that not all summation methods are linear and stable. Zeta function regularization is in general nonlinear. However, in some cases formal manipulations with zeta function regularization (assuming linearity of sums) lead to correct results. We c ...

American Physical Society2016

Discrete stochastic heat equation driven by fractional noise : Feynman-Kac representation and asymptotic behavior

Kamran Kalbasi

We consider the parabolic Anderson model on

\mathbb{Z}^d

driven by fractional noise. We prove that it has a mild solution given by Feynman-Kac representation which coincides with the partition function of a directed polymer in a fractional Brownian envir ...

EPFL2014

Bin Packing via Discrepancy of Permutations

Friedrich Eisenbrand, Thomas Rothvoss, Doemoetoer Palvoelgyi

A well-studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxati ...

Association for Computing Machinery2013

Stable averages of central values of Rankin-Selberg L-functions: Some new variants

Paul David Nelson

As shown by Michel and Ramakrishnan (2007) and later generalized by Feigon and Whitehouse (2008), there are "stable" formulas for the average central L-value of the Rankin-Selberg convolutions of some holomorphic forms of fixed even weight and large level ...

Academic Press Inc Elsevier Science2013

Polychromatic colorings of arbitrary rectangular partitions

Balázs Keszegh, Doemoetoer Palvoelgyi

A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex 4-colorings of general partitions where every subrectangle is required to have all four colors appear on i ...

Elsevier2010

Looping probabilities of elastic chains: A path integral approach

John Maddocks, Ludovica Cotta-Ramusino

We consider an elastic chain at thermodynamic equilibrium with a heat bath, and derive an approximation to the probability density function, or pdf, governing the relative location and orientation of the two ends of the chain. Our motivation is to exploit ...

2010

Path integral evaluation of equilibrium isotope effects

Jiri Vanicek, Tomas Zimmermann

A general and rigorous methodology to compute the quantum equilibrium isotope effect is described. Unlike standard approaches, ours does not assume separability of rotational and vibrational motions and does not make the harmonic approximation for vibratio ...

2009

On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function

Mehdi Molkaraie

Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition function of a g ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008