Publications related to Factorization of polynomials by transcendental evaluation

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

We obtain new results pertaining to convergence and recurrence of multiple ergodic averages along functions from a Hardy field. Among other things, we confirm some of the conjectures posed by Frantzikinakis in [Fra10; Fra16] and obtain combinatorial applic ...

2020

Single and multiple recurrence along non-polynomial sequences

Florian Karl Richter

We establish new recurrence and multiple recurrence results for a rather large family of non-polynomial functions which contains tempered functions and (non-polynomial) functions from a Hardy field with polynomial growth. In particular, we show that, somew ...

2020

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

Felix Schürmann, Francesco Cremonesi, Timothée Ewart

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

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

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

Interpolatory Rational Model Order Reduction of Parametric Problems Lacking Uniform Inf-Sup Stability

Davide Pradovera

We present a technique for the approximation of a class of Hilbert space--valued maps which arise within the framework of model order reduction (MOR) for parametric partial differential equations, whose solution map has a meromorphic structure. Our MOR str ...

2020

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

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

A generalization of Kátai's orthogonality criterion with applications

Florian Karl Richter

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of Kátai's orthogonality cri ...

2019

MATHICSE Technical Report: Interpolatory rational model order reduction of parametric problems lacking uniform inf-sup stability

Davide Pradovera

We present a technique for the approximation of a class of Hilbert space-valued maps which arise within the framework of Model Order Reduction for parametric partial differential equations, whose solution map has a meromorphic structure. Our MOR stategy co ...

MATHICSE2019

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Damian Mateusz Straszak

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Factorization of polynomials by transcendental evaluation

Graph Chatbot

Chat with Graph Search

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

Single and multiple recurrence along non-polynomial sequences

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

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

Interpolatory Rational Model Order Reduction of Parametric Problems Lacking Uniform Inf-Sup Stability

New Graph Algorithms via Polyhedral Techniques

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

A generalization of Kátai's orthogonality criterion with applications

MATHICSE Technical Report: Interpolatory rational model order reduction of parametric problems lacking uniform inf-sup stability

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Single and multiple recurrence along non-polynomial sequences

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

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

Interpolatory Rational Model Order Reduction of Parametric Problems Lacking Uniform Inf-Sup Stability

New Graph Algorithms via Polyhedral Techniques

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

MATHICSE Technical Report: Interpolatory rational model order reduction of parametric problems lacking uniform inf-sup stability

A generalization of Kátai's orthogonality criterion with applications

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

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