Concept

Felix Hausdorff

Related publications (14)

Hausdorff dimension of fermions on a random lattice

Mattia Guerino Varrone

Geometric properties of lattice quantum gravity in two dimensions are studied numerically via Monte Carlo on Euclidean Dynamical Triangulations. A new computational method is proposed to simulate gravity coupled with fermions, which allows the study of int ...
Elsevier2024

The Hausdorff measure of the range and level sets of Gaussian random fields with sectorial local nondeterminism

Cheuk Yin Lee

We determine the exact Hausdorff measure functions for the range and level sets of a class of Gaussian random fields satisfying sectorial local nondeterminism and other assumptions. We also establish a Chung-type law of the iterated logarithm. The results ...
INT STATISTICAL INST2022

Three-dimensional Fermi surfaces from charge order in layered CsV3Sb5

Philip Johannes Walter Moll, Matthias Carsten Putzke, Yi-Chiang Sun, Chunyu Guo, Xiangwei Huang

The cascade of electronic phases in CsV3Sb5 raises the prospect to disentangle their mutual interactions in a clean, strongly interacting kagome lattice. When the kagome planes are stacked into a crystal, its electronic dimensionality encodes how much of t ...
AMER PHYSICAL SOC2022

Restriction of 3D arithmetic Laplace eigenfunctions to a plane

We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure ('length') of nodal intersections against a smooth 2-dimensional toral sub-manifold ('surface'). A prior result of ours pr ...
2020

The First Passage Sets of the 2D Gaussian Free Field: Convergence and Isomorphisms

Juhan Aru, Titus Lupu

In a previous article, we introduced the first passage set (FPS) of constant level -aof the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the bo ...
SPRINGER2020

The complexity of error metrics

Mathias Soeken

Approximate computing exploits the fact that many applications do not require the results to be exact but not to exceed a threshold in a given error metric. Algorithms in approximate computing require to compute the error of the approximation in order to m ...
ELSEVIER SCIENCE BV2018

Topological Structures on DMC spaces

Rajai Nasser

Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet X and output alphabet Y can be naturally endowed with the quotient of the Euclidean topology by the equivalence relation. We s ...
2017

Moduli spaces of toric manifolds

Tudor Ratiu

We construct a distance on the moduli space of symplectic toric manifolds of dimension four. Then we study some basic topological properties of this space, in particular, path-connectedness, compactness, and completeness. The construction of the distance i ...
Springer Verlag2014

Consistent Digital Line Segments

Doemoetoer Palvoelgyi

We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, we show how to derive such a system of digital segments from any total order o ...
2012

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.