Concept

Point d'accumulation (mathématiques)

Publications associées (53)

From SU(2)5 to SU(2)3 Wess-Zumino-Witten transitions in a frustrated spin-52 chain

We investigate the properties of a frustrated spin-5/2 chain with next-nearest-neighbor two- and three-site interactions, with two questions in mind: the nature of the transition into the dimerized phase induced by the three-site interaction, and the possi ...

AMER PHYSICAL SOC2022

Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy

Nicolas Boumal

We consider the problem of provably finding a stationary point of a smooth function to be minimized on the variety of bounded-rank matrices. This turns out to be unexpectedly delicate. We trace the difficulty back to a geometric obstacle: On a nonsmooth se ...

SPRINGER HEIDELBERG2022

A Global Building Occupant Behavior Database

Andrew James Sonta, Zhe Wang, Sanjay Kumar, Xin Zhou, Yanchen Liu

This paper introduces a database of 34 field-measured building occupant behavior datasets collected from 15 countries and 39 institutions across 10 climatic zones covering various building types in both commercial and residential sectors. This is a compreh ...

2022

A novel control strategy with an anode variable geometry ejector for a SOFC-GT hybrid system

Jinzhi Lu, Jinwei Chen

A novel control strategy was developed with an anode variable geometry ejector for a solid oxide fuel cell-gas turbine (SOFC-GT) system. The anode inlet temperature was controlled by combining two modes to achieve a greater controllable range: anode variab ...

PERGAMON-ELSEVIER SCIENCE LTD2022

Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariances

Wulfram Gerstner, Clément Hongler, Johanni Michael Brea, Francesco Spadaro, Berfin Simsek, Arthur Jacot

We study how permutation symmetries in overparameterized multi-layer neural networks generate `symmetry-induced' critical points. Assuming a network with

L

layers of minimal widths

r_1^*, \ldots, r_{L-1}^*

reaches a zero-loss minimum at $ r_1^*! \c ...

2021

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

Dubrovin'S Superpotential As A Global Spectral Curve

Nicolas Gerson Orantin

We apply the spectral curve topological recursion to Dubrovin's universal Landau-Ginzburg superpotential associated to a semi-simple point of any conformal Frobenius manifold. We show that under some conditions the expansion of the correlation differential ...

CAMBRIDGE UNIV PRESS2019

A note on discrete lattice-periodic sets with an application to Archimedean tilings

Matthias Schymura

Cao and Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that the vertex set of every Archimedean tiling is the union of translates of a fixed lattice, we take a more general v ...

SPRINGER HEIDELBERG2019

On the existence of ordinary triangles

Sebastian Urban Stich, Radoslav Fulek, Márton Naszódi

Let P be a finite point set in the plane. A \emph{c-ordinary triangle} in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P. Motivated by a question o ...

Elsevier2017

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search