Concept

Partition (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

Determination of server location in emergency care systems: an index proposal using data envelopment analysis and the hypercube queuing model

Caio Vitor Beojone

The objective of this article is to propose a new composite index (CI) that helps to determine the most effective location of servers in an Emergency Care System (ECS), using Benefit of the Doubt (BoD)/Data Envelopment Analysis (DEA) and the Hypercube queu ...

Peerj Inc2023

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

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

Haldane Gap of the Three-Box Symmetric SU(3) Chain

Frédéric Mila, Pierre Marcel Nataf, Samuel Gozel

Motivated by the recent generalization of the Haldane conjecture to SU(3) chains [Lajko et al., Nucl. Phys. B924, 508 (2017)] according to which a Haldane gap should be present for symmetric representations if the number of boxes in the Young diagram is a ...

2020

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

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

Aleksi Antoine Bossart, Alexander Huyberechts

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

Self-conjugate representation SU(3) chains

Frédéric Mila, Miklos Lajko, Francisco Hyunkyu Kim

It was recently argued that SU(3) chains in the p-box symmetric irreducible representation (irrep) exhibit a "Haldane gap" when p is a multiple of 3 and are otherwise gapless [Nucl. Phys. B 924, 508 (2017)]. We extend this argument to the self-conjugate ir ...

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

Matching fields and lattice points of simplices

Georg Peter Loho

We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on l ...

2020

Spinner: Scalable Graph Partitioning in the Cloud

Andreas Loukas

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

Overlooked persistent and bioaccumulative pollutants in Lake Geneva : their measurement, occurrence, and concentration distribution in the water column and sediments

Saer Samanipour

Persistent and bioaccumulative pollutants (PBPs) are continually introduced into the environment as a part of the massive ongoing chemical production that began several decades ago. The PBPs include several chemical families such as: industrial compounds, ...

EPFL2015

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

Polychromatic colorings of arbitrary rectangular partitions

Doemoetoer Palvoelgyi, Balázs Keszegh

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

Material-Based Object Segmentation Using Near-Infrared Information

Sabine Süsstrunk, Neda Salamati

We present a framework to incorporate near-infrared (NIR) information into algorithms to better segment objects by isolating material boundaries from color and shadow edges. Most segmentation algorithms assign individual regions to parts of the object that ...

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