Publications associées à Incidences Between Planes Over Finite Fields

Publications associées (48)

Some evaluations of the fractional p-Laplace operator on radial functions

We face a rigidity problem for the fractional p-Laplace operator to extend to this new framework some tools useful for the linear case. It is known that (-Delta)(s)(1 - vertical bar x vertical bar(2))(+)(s) and -Delta(p)(1 - vertical bar x vertical bar(p/p ...

AMER INST MATHEMATICAL SCIENCES-AIMS2023

On A Special Symmetry In The Dynamics Of Complex Systems In A Holographic-Type Perspective

Maria-Alexandra Paun

By operating with the Scale Relativity Theory in the dynamics of complex systems, we can achieve a description of these complex systems through a holographic-type perspective. Then, gauge invariances of a Riccati-type become functional in complex system dy ...

UNIV POLITEHNICA BUCHAREST, SCI BULL2023

Detecting whether a stochastic process is finitely expressed in a basis

Victor Panaretos, Neda Mohammadi Jouzdani

Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Beyond Spectral Gap: The Role of the Topology in Decentralized Learning

Martin Jaggi, Thijs Vogels, Hadrien Hendrikx

In data-parallel optimization of machine learning models, workers collaborate to improve their estimates of the model: more accurate gradients allow them to use larger learning rates and optimize faster. In the decentralized setting, in which workers commu ...

Microtome Publishing2023

Randomized Low-Rank Approximation Of Monotone Matrix Functions

Daniel Kressner, Ulf David Persson

This work is concerned with computing low-rank approximations of a matrix function f(A) for a large symmetric positive semidefinite matrix A, a task that arises in, e.g., statistical learning and inverse problems. The application of popular randomized meth ...

SIAM PUBLICATIONS2023

Iterative refinement of Schur decompositions

Daniel Kressner, Zvonimir Bujanovic

The Schur decomposition of a square matrix A is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Compute a (m ...

SPRINGER2023

Koopman analysis of the periodic Korteweg-de Vries equation

Jeremy Peter Parker

The eigenspectrum of the Koopman operator enables the decomposition of nonlinear dynamics into a sum of nonlinear functions of the state space with purely exponential and sinusoidal time dependence. For a limited number of dynamical systems, it is possible ...

American Institute of Physics2023

On the Applications of the Generalized Littlewood Theorem Concerning Integrals of the Logarithm of Analytical Functions to Elliptic Functions

Serguei Sekatski

Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to obtain new criteria equivalent to the Riemann hypothesis. Later, the same theorem was applied to calculate cer ...

MDPI2023

GOT: An Optimal Transport framework for Graph comparison

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic

We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

Dynamic Fourier ptychography with deep spatiotemporal priors

Michaël Unser, Pakshal Narendra Bohra

Fourier ptychography (FP) involves the acquisition of several low-resolution intensity images of a sample under varying illumination angles. They are then combined into a high-resolution complex-valued image by solving a phase-retrieval problem. The object ...

IOP Publishing Ltd2023

New Graph Algorithms via Polyhedral Techniques

Jakub Tarnawski

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

EPFL2019

Space-Efficient Representations of Graphs

Jakab Tardos

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

EPFL2022

Cutting Materials in Half: A Graph Theory Approach for Generating Crystal Surfaces and Its Prediction of 2D Zeolites

Berend Smit, Peter George Boyd, Senja Dominique Barthel

Scientific interest in two-dimensional (2D) materials, ranging from graphene and other single layer materials to atomically thin crystals, is quickly increasing for a large variety of technological applications. While in silico design approaches have made ...

2018

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

Akash Kumar

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

IEEE COMPUTER SOC2022

Conditional expanding bounds for two-variable functions over finite valuation rings

Van Thang Pham

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 Ltd2017

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

Andreas Loukas, Nathanaël Perraudin

We approach the graph generation problem from a spectral perspective by first generating the dominant parts of the graph Laplacian spectrum and then building a graph matching these eigenvalues and eigenvectors. Spectral conditioning allows for direct model ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Scalable Low-rank Matrix and Tensor Decomposition on Graphs

Nauman Shahid

In many signal processing, machine learning and computer vision applications, one often has to deal with high dimensional and big datasets such as images, videos, web content, etc. The data can come in various forms, such as univariate or multivariate time ...

EPFL2017

A proof of the instability of AdS for the Einstein-massless Vlasov system

Georgios Moschidis

In recent years, the conjecture on the instability of Anti-de Sitter spacetime, put forward by Dafermos-Holzegel (Dynamic instability of solitons in 4 + 1 dimesnional gravity with negative cosmological constant, 2006. https://www.dpmms.cam.ac.uk/similar to ...

SPRINGER HEIDELBERG2022

An Accelerated First-Order Method for Non-convex Optimization on Manifolds

Christopher Arnold Criscitiello, Nicolas Boumal

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...

SPRINGER2022

Isogeny graphs of ordinary abelian varieties

Dimitar Petkov Jetchev, Benjamin Pierre Charles Wesolowski, Ernest Hunter Brooks

Fix a prime number l. Graphs of isogenies of degree a power of l are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a finite field. We analyse gr ...

Springer Heidelberg2017