Concept

Linear system of divisors

Publications associées (28)

Rational Points in the Noether-Lefschetz Locus of Moduli Spaces of K3 Surfaces

We give a characterization of rational points lying on the Noether-Lefschetz locus of moduli spaces of K3 surfaces by studying their lifting properties under some natural coverings of the ambient space. We then prove that the Bombieri-Lang conjecture impli ...

Oxford Univ Press2024

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

2023

Singularities of general fibers and the LMMP

Zsolt Patakfalvi, Joseph Allen Waldron

We use the theory of foliations to study the relative canonical divisor of a normalized inseparable base-change. Our main technical theorem states that it is linearly equivalent to a divisor with positive integer coefficients divisible by p - 1. We deduce ...

JOHNS HOPKINS UNIV PRESS2022

Unified theory of atom-centered representations and message-passing machine-learning schemes

Michele Ceriotti, Guillaume André Jean Fraux, Sergey Pozdnyakov, Jigyasa Nigam

Data-driven schemes that associate molecular and crystal structures with their microscopic properties share the need for a concise, effective description of the arrangement of their atomic constituents. Many types of models rely on descriptions of atom-cen ...

AIP Publishing2022

Vanishing theorems in positive characteristic

Emelie Kerstin Arvidsson

The topic of this thesis is vanishing theorems in positive characteristic. In particular, we use "the covering trick of Ekedahl" to investigate the vanishing of

H^1(X, \mathcal{O}_X(-D))

for a big and nef Weil divisor

D

on a normal projective variety w ...

EPFL2021

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Logic resynthesis is the problem of finding a dependency function to re-express a given Boolean function in terms of a given set of divisor functions. In this paper, we study logic resynthesis of majority-based circuits, which is motivated by the increasin ...

IEEE2021

THE LMMP FOR LOG CANONICAL 3-FOLDS IN CHARACTERISTIC p > 5

Joseph Allen Waldron

We prove that one can run the log minimal model program for log canonical 3-fold pairs in characteristic p > 5. In particular, we prove the cone theorem, contraction theorem, the existence of flips and the existence of log minimal models for pairs with log ...

2018

Multi space reduced basis preconditioners for parametrized partial differential equations

Niccolò Dal Santo

The multiquery solution of parametric partial differential equations (PDEs), that is, PDEs depending on a vector of parameters, is computationally challenging and appears in several engineering contexts, such as PDE-constrained optimization, uncertainty qu ...

EPFL2018

The Shifted Convolution of Generalized Divisor Functions

Berke Topacogullari

We prove an asymptotic formula for the shifted convolution of the divisor functions d(k)(n) and d(n) with k >= 4, which is uniform in the shift parameter and which has a power saving error term, improving results obtained previously by Fouvry and Tenenbaum ...

OXFORD UNIV PRESS2018

Algebraic and topological methods in combinatorics

Adrian Claudiu Valculescu

The present thesis deals with problems arising from discrete mathematics, whose proofs make use of tools from algebraic geometry and topology. The thesis is based on four papers that I have co-authored, three of which have been published in journals, and o ...

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