Concept

Cardinality of the continuum

Related publications (8)

HyperLogLog: Exponentially Bad in Adversarial Settings

Computing the count of distinct elements in large data sets is a common task but naive approaches are memory-expensive. The HyperLogLog (HLL) algorithm (Flajolet et al., 2007) estimates a data set's cardinality while using significantly less memory than a ...

IEEE COMPUTER SOC2022

Influence of static correlation on the magnon dynamics of an itinerant ferromagnet with competing exchange interactions: First-principles study of MnBi

Henrik Moodysson Rønnow, Thorbjørn Skovhus

We present first-principles calculations of the dynamic susceptibility in strained and doped ferromagnetic MnBi using time-dependent density functional theory. In spite of being a metal, MnBi exhibits signatures of strong correlation and a proper descripti ...

AMER PHYSICAL SOC2022

Emergence of Concentration Effects in the Variational Analysis of the N-Clock Model

Matthias Ruf, Matthias Benjamin Ruf

We investigate the relationship between the N-clock model (also known as planar Potts model or DOUBLE-STRUCK CAPITAL ZN-model) and the XY model (at zero temperature) through a Gamma-convergence analysis of a suitable rescaling of the energy as both the num ...

WILEY2022

Structural Properties Of Dendrite Groups

Nicolas Monod

Let G be the homeomorphism group of a dendrite. We study the normal subgroups of G. For instance, there are uncountably many nonisomorphic such groups G that are simple groups. Moreover, these groups can be chosen so that any isometric G-action on any metr ...

AMER MATHEMATICAL SOC2019

Small subset sums

Gergely Ambrus

Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0

Elsevier Science Inc2016

Strong LP formulations for scheduling splittable jobs on unrelated machines

Ola Nils Anders Svensson

A natural extension of the makespan minimization problem on unrelated machines is to allow jobs to be partially processed by different machines while incurring an arbitrary setup time. In this paper we present increasingly stronger LP-relaxations for this ...

Springer Heidelberg2015

Minimum d-blockers and d-transversals in graphs

Dominique de Werra

We consider a set V of elements and an optimization problem on V: the search for a maximum (or minimum) cardinality subset of V verifying a given property a"similar to. A d-transversal is a subset of V which intersects any optimum solution in at least d el ...

2011

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010