Incidences Between Planes Over Finite Fields

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.

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Incidences Between Planes Over Finite Fields

Chat with Graph Search

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

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

Detecting whether a stochastic process is finitely expressed in a basis

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

Randomized Low-Rank Approximation Of Monotone Matrix Functions

Iterative refinement of Schur decompositions

Koopman analysis of the periodic Korteweg-de Vries equation

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

GOT: An Optimal Transport framework for Graph comparison

Dynamic Fourier ptychography with deep spatiotemporal priors

New Graph Algorithms via Polyhedral Techniques

Space-Efficient Representations of Graphs

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

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

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

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

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

Isogeny graphs of ordinary abelian varieties

A Szemeredi-Trotter type theorem, sum-product estimates in finite quasifields, and related results

Extension complexity of stable set polytopes of bipartite graphs