Home

Publication

Polynomials Vanishing On Cartesian Products: The Elekes-Szabo Theorem Revisited

Related publications (28)

About
Privacy
Disclaimer

Graph Chatbot

Deterministic error bounds for kernel-based learning techniques under bounded noise

Colin Neil Jones, Paul Scharnhorst, Emilio Maddalena

We consider the problem of reconstructing a function from a finite set of noise-corrupted samples. Two kernel algorithms are analyzed, namely kernel ridge regression and epsilon-support vector regression. By assuming the ground-truth function belongs to th ...

2021

Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e(x)

Felix Schürmann, Francesco Cremonesi, Timothée Ewart, Fabien Jonathan Delalondre

The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented. In this article, we evaluate existing methods for polynomial evaluation on superscalar architecture. ...

2020

Markov cubature rules for polynomial processes

Damir Filipovic, Martin Larsson, Sergio Andres Pulido Nino

We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rul ...

ELSEVIER2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Automorphisms of even unimodular lattices and equivariant Witt groups

Eva Bayer Fluckiger

We characterize the irreducible polynomials that occur as the characteristic polynomial of an automorphism of an even unimodular lattice of a given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general criterion i ...

EUROPEAN MATHEMATICAL SOC2020

Simple Realizability of Complete Abstract Topological Graphs Simplified

Jan Kyncl

An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...

SPRINGER2020

A p-weighted limiter for the discontinuous Galerkin method on one-dimensional and two-dimensional triangular grids

Qian Wang, Qian Wang

This paper presents an accuracy-preserving p-weighted limiter for discontinuous Galerkin methods on one-dimensional and two-dimensional triangular grids. The p-weighted limiter is the extension of the second-order WENO limiter by Li et al. [W. Li, J. Pan a ...

2020

Polynomial Jump-Diffusion Models

Damir Filipovic, Martin Larsson

We develop a comprehensive mathematical framework for polynomial jump-diffusions in a semimartingale context, which nest affine jump-diffusions and have broad applications in finance. We show that the polynomial property is preserved under polynomial trans ...

2020

A Hybrid High-Order Method for Highly Oscillatory Elliptic Problems

Simon Clément Damien Lemaire

We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh; those attached to ...

WALTER DE GRUYTER GMBH2019

Coupling non-conforming discretizations of PDEs by spectral approximation of the Lagrange multiplier space

Simone Deparis, Luca Pegolotti, Antonio Iubatti

This work focuses on the development of a non-conforming method for the coupling of PDEs based on weakly imposed transmission conditions: the continuity of the global solution is enforced by a finite number of Lagrange multipliers defined over the interfac ...

2019

Page 2 of 3

Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e(x)

Felix Schürmann, Francesco Cremonesi, Timothée Ewart, Fabien Jonathan Delalondre

2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020