Concept
Problème de Bâle
Publications associées (13)
A DONALDSON-THOMAS CREPANT RESOLUTION CONJECTURE ON CALABI-YAU 4-FOLDS
Let G be a finite subgroup of SU(4) such that its elements have age at most one. In the first part of this paper, we define K-theoretic stable pair invariants on a crepant resolution of the affine quotient C4/G, and conjecture a closed formula for their ge ...
Providence2023Conditional expanding bounds for two-variable functions over finite valuation rings
In this paper, we use methods from spectral graph theory to obtain some results on the sum-product problem over finite valuation rings R of order q(r) which generalize recent results given by Hegyvari and Hennecart (2013). More precisely, we prove that, fo ...
Academic Press Ltd- Elsevier Science Ltd2017A Szemeredi-Trotter type theorem, sum-product estimates in finite quasifields, and related results
We prove a Szemeredi-Trotter type theorem and a sum product estimate in the setting of finite quasifields. These estimates generalize results of the fourth author, of Garaev, and of Vu. We generalize results of Gyarmati and Sarkozy on the solvability of th ...
Academic Press Inc Elsevier Science2017On the Density of Coprime Tuples of the Form (n, ⌊f1(n)⌋, …, ⌊fk(n)⌋), Where f_1, …, f_k Are Functions from a Hardy Field
Let k∈Nk∈Nk \in \mathbb{N} and let f1, …, f k belong to a Hardy field. We prove that under some natural conditions on the k-tuple ( f1, …, f k ) the density of the set {n∈N:gcd(n,⌊f1(n)⌋,…,⌊fk(n)⌋)=1}{n∈N:gcd(n,⌊f1(n)⌋,…,⌊fk(n)⌋)=1}\displaystyle{\big{n \i ...
Springer International Publishing2017Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
In this note we estimate the asymptotic rates for the L-2-error decay and the storage cost when approximating 2 pi-periodic, d-variate functions from isotropic and mixed Sobolev classes by the recent hierarchical tensor format as introduced by Hackbusch an ...
Academic Press Inc Elsevier Science2014Cryptographic Hash Functions in Groups and Provable Properties
We consider several "provably secure" hash functions that compute simple sums in a well chosen group (G,*). Security properties of such functions provably translate in a natural way to computational problems in G that are simple to define and possibly also ...
EPFL2011Joint registration and super-resolution with omnidirectional images
This paper addresses the reconstruction of high resolution omnidirectional images from multiple low resolution images with inexact registration. When omnidirectional images from low resolution vision sensors can be uniquely mapped on the 2-sphere, such a r ...
2009