Concept

Polynôme de Tchebychev

Publications associées (26)

K3 surfaces, cyclotomic polynomials and orthogonal groups

Let X be a complex projective K3 surface and let T-X be its transcendental lattice; the characteristic polynomials of isometries of T-X induced by automorphisms of X are powers of cyclotomic polynomials. Which powers of cyclotomic polynomials occur? The ai ...

Springer Int Publ Ag2024

Unlabeled Principal Component Analysis and Matrix Completion

Yunzhen Yao, Liangzu Peng

We introduce robust principal component analysis from a data matrix in which the entries of its columns have been corrupted by permutations, termed Unlabeled Principal Component Analysis (UPCA). Using algebraic geometry, we establish that UPCA is a well-de ...

Microtome Publishing2024

Interpolation and Quantifiers in Ortholattices

Viktor Kuncak, Simon Guilloud, Sankalp Gambhir

We study quantifiers and interpolation properties in orthologic, a non-distributive weakening of classical logic that is sound for formula validity with respect to classical logic, yet has a quadratic-time decision procedure. We present a sequent-based pro ...

Springer International Publishing Ag2024

Interpolation and Quantifiers in Ortholattices

Viktor Kuncak, Simon Guilloud, Sankalp Gambhir

We study quantifiers and interpolation properties in ortho- logic, a non-distributive weakening of classical logic that is sound for formula validity with respect to classical logic, yet has a quadratic-time decision procedure. We present a sequent-based p ...

2024

Nonlinear simulation of plasma turbulence using a gyrokinetic moment-based approach

Antoine Cyril David Hoffmann

Plasma turbulence plays a fundamental role in determining the performances of magnetic confinement fusion devices, such as tokamaks. Advances in computer science, combined with the development of efficient physical models, have significantly improved our u ...

EPFL2024

Filter-Informed Spectral Graph Wavelet Networks for Multiscale Feature Extraction and Intelligent Fault Diagnosis

Olga Fink, Tianfu Li

Intelligent fault diagnosis has been increasingly improved with the evolution of deep learning (DL) approaches. Recently, the emerging graph neural networks (GNNs) have also been introduced in the field of fault diagnosis with the goal to make better use o ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

The multivariate Serre conjecture ring

Luc Guyot

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Academic Press Inc Elsevier Science2023

Linear Complexity Self-Attention With 3rd Order Polynomials

Grigorios Chrysos, Filippos Kokkinos

Self-attention mechanisms and non-local blocks have become crucial building blocks for state-of-the-art neural architectures thanks to their unparalleled ability in capturing long-range dependencies in the input. However their cost is quadratic with the nu ...

Ieee Computer Soc2023

Gyrokinetic moment-based simulations of the Dimits shift

Paolo Ricci, Baptiste Jimmy Frei, Antoine Cyril David Hoffmann

We present a convergence study of the gyromoment (GM) approach, which is based on projecting the gyrokinetic distribution function onto a Hermite–Laguerre polynomial basis, focused on the cyclone base case (CBC) (Lin et al., Phys. Rev. Lett., vol. 83, no. ...

Cambridge University Press2023

Regularization of polynomial networks for image recognition

Volkan Cevher, Grigorios Chrysos, Bohan Wang

Deep Neural Networks (DNNs) have obtained impressive performance across tasks, however they still remain as black boxes, e.g., hard to theoretically analyze. At the same time, Polynomial Networks (PNs) have emerged as an alternative method with a promising ...

Ieee Computer Soc2023

Regularization of polynomial networks for image recognition

Volkan Cevher, Grigorios Chrysos, Bohan Wang

2023

Finite free convolutions of polynomials

Adam Wade Marcus

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric addi ...

SPRINGER HEIDELBERG2022

Sound and Complete Verification of Polynomial Networks

Volkan Cevher, Grigorios Chrysos, Fanghui Liu, Mehmet Fatih Sahin, Elias Abad Rocamora

Polynomial Networks (PNs) have demonstrated promising performance on face and image recognition recently. However, robustness of PNs is unclear and thus obtaining certificates becomes imperative for enabling their adoption in real-world applications. Exist ...

2022

The spectral bias of polynomial neural networks

Volkan Cevher, Grigorios Chrysos, Leello Tadesse Dadi, Moulik Choraria

Polynomial neural networks (PNNs) have been recently shown to be particularly effective at image generation and face recognition, where high-frequency information is critical. Previous studies have revealed that neural networks demonstrate a spectral bias ...

2022

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Fourier Collocation and Reduced Basis Methods for Fast Modeling of Compressible Flows

Jan Sickmann Hesthaven, Deep Ray

A projection-based reduced order model (ROM) based on the Fourier collocation method is proposed for compressible flows. The incorporation of localized artificial viscosity model and filtering is pursued to enhance the robustness and accuracy of the ROM fo ...

GLOBAL SCIENCE PRESS2022

Functional Tucker Approximation Using Chebyshev Interpolation

Daniel Kressner, Christoph Max Strössner

This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function approximations tha ...

SIAM PUBLICATIONS2021

Interlacing families III: Sharper restricted invertibility estimates

Adam Wade Marcus

We use the method of interlacing families of polynomials to derive a simple proof of Bourgain and Tzafriri's Restricted Invertibility Principle, and then to sharpen the result in two ways. We show that the stable rank can be replaced by the Schatten 4-norm ...

HEBREW UNIV MAGNES PRESS2022

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

ON WAVEFRONT ABERRATIONS IN ASYMMETRIC AND MULTIPLE APERTURE OPTICAL SYSTEMS

Alessandro Grosso

The present work deals with monochromatic wavefront aberrations in optical systems without symmetries. The treatment begins with a class of systems characterized by misaligned spherical surfaces whose behavior is analyzed using the wavefront aberration exp ...

EPFL2021