Related publications (40)

Hopf algebras and Hopf-Galois extensions in infinity-categories

Aras Ergus

In this thesis, we study interactions between algebraic and coalgebraic structures in infinity-categories (more precisely, in the quasicategorical model of (infinity, 1)-categories). We define a notion of a Hopf algebra H in an E-2-monoidal infinity-catego ...
EPFL2022

Homotopical relations between 2-dimensional categories and their infinity-analogues

Lyne Moser

In this thesis, we study the homotopical relations of 2-categories, double categories, and their infinity-analogues. For this, we construct homotopy theories for the objects of interest, and show that there are homotopically full embeddings of 2-categories ...
EPFL2021

The cotangent complex and Thom spectra

Nima Rasekh

The cotangent complex of a map of commutative rings is a central object in deformation theory. Since the 1990s, it has been generalized to the homotopical setting of E-infinity-ring spectra in various ways. In this work we first establish, in the context o ...
2021

Non-Wilson-Fisher kinks of O(N) numerical bootstrap: From the deconfined phase transition to a putative new family of CFTs

Ning Su

It is well established that the O(N) Wilson-Fisher (WF) CFT sits at a kink of the numerical bounds from bootstrapping four point function of O(N) vector. Moving away from the WF kinks, there indeed exists another family of kinks (dubbed non-WF kinks) on th ...
SCIPOST FOUNDATION2021

Extremal Eigenvalues Of The Dirichlet Biharmonic Operator On Rectangles

We study the behaviour of extremal eigenvalues of the Dirichlet biharmonic operator over rectangles with a given fixed area. We begin by proving that the principal eigenvalue is minimal for a rectangle for which the ratio between the longest and the shorte ...
2020

On the asymptotic behavior of the solutions to parabolic variational inequalities

Maria Colombo

We consider various versions of the obstacle and thin-obstacle problems, we interpret them as variational inequalities, with non-smooth constraint, and prove that they satisfy a new constrained Lojasiewicz inequality. The difficulty lies in the fact that, ...
2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2020

A spectral refinement of the Bergelson–Host–Kra decomposition and new multiple ergodic theorems

Florian Karl Richter

We investigate how spectral properties of a measure-preserving system (X, B, mu, T) are reflected in the multiple ergodic averages arising from that system. For certain sequences a :N -> N, we provide natural conditions on the spectrum sigma (T) such that, ...
2019

A data-driven approach to model-reference control with applications to particle accelerator power converters

Alireza Karimi, Achille Nicoletti, Michele Martino

A new model-reference data-driven approach is presented which uses the frequency response data of a system in order to avoid the problem of unmodeled dynamics associated with low-order parametric models. It is shown that a convex optimization problem can b ...
PERGAMON-ELSEVIER SCIENCE LTD2019

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2018

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.