Publication

Incidences between points and generalized spheres over finite fields and related problems

Publications associées (48)

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

On the boundedness of n-folds with κ(X) = n - 1

Stefano Filipazzi

In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...

European Mathematical Soc-Ems2024

A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

Thomas Mountford, Michael Cranston

In this paper we use the Riemann zeta distribution to give a new proof of the Erdos-Kac Central Limit Theorem. That is, if zeta(s) = Sigma(n >= 1) (1)(s)(n) , s > 1, then we consider the random variable X-s with P(X-s = n) = (1) (zeta) ( ...

Providence2023

ALGEBRAIC TWISTS OF GL3 x GL2 L-FUNCTIONS

Philippe Michel, Yongxiao Lin

We prove that the coefficients of a GL3 x GL2 Rankin-Selberg L-function do not correlate with a wide class of trace functions of small conductor modulo primes, generalizing the corresponding result of Fouvry, Kowalski, and Michel for GL2 and of Kowalski, L ...

Baltimore2023

Model order reduction of flow based on a modular geometrical approximation of blood vessels

Simone Deparis, Luca Pegolotti

We are interested in a reduced order method for the efficient simulation of blood flow in arteries. The blood dynamics is modeled by means of the incompressible Navier–Stokes equations. Our algorithm is based on an approximated domain-decomposition of the ...

2021

On arithmetic progressions in symmetric sets in finite field model

Jan Hazla

We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. First, we show that a symmetric set S subset of Z(q)(n) containing vertical bar S vertical bar = mu . q(n) elements must contain at leas ...

ELECTRONIC JOURNAL OF COMBINATORICS2020

A proof of a sumset conjecture of Erdős

Florian Karl Richter

In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...

2019

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

EPFL Library Research Data Management Fastguides

Francesco Varrato, Antoine Louis Claude Masson, Eliane Ninfa Blumer, Sitthida Samath, Fantin Reichler, Jérôme Julien Chaptinel

This is a set of 11 1-sheet guides, providing abridged notions, advice and references for quick and practical research data management: #01 Research Data: the basics #02 FAIR Data Principles #03 Cost of Research Data Management #04 File Formats #05 Metadat ...

2019

Bretherton's buoyant bubble

John Martin Kolinski, Wassim Dhaouadi

When a buoyant bubble is inserted into a closed capillary that is slightly smaller than the capillary length, it appears stuck; exactly why this is so is a puzzle that has remained unanswered over the past 50 years. Recent calculations suggest that the bub ...

2019

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

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