Publications related to Irregular primes and Cyclotomic Invariants to Twelve Million

Polynomial Escape-Time From Saddle Points In Distributed Non-Convex Optimization

The diffusion strategy for distributed learning from streaming data employs local stochastic gradient updates along with exchange of iterates over neighborhoods. In this work we establish that agents cluster around a network centroid in the mean-fourth sen ...

IEEE2019

Four-Variable Expanders Over The Prime Fields

Adrian Claudiu Valculescu, Van Thang Pham

Let F-p be a prime field of order p > 2, and let A be a set in F-p with very small size in terms of p. In this note, we show that the number of distinct cubic distances determined by points in A x A satisfies vertical bar(A - A)(3) + (A - A)(3 vertical bar ...

AMER MATHEMATICAL SOC2018

Arithmetic and metric aspects of open de Rham spaces

Dimitri Stelio Wyss, Tamás Hausel, Michael Lennox Wong

In this paper we determine the motivic class---in particular, the weight polynomial and conjecturally the Poincar'e polynomial---of the open de Rham space, defined and studied by Boalch, of certain moduli of irregular meromorphic connections on the trivia ...

2018

Sampling at unknown locations, with an application in surface retrieval

Martin Vetterli, Benjamin Bejar Haro, Adam James Scholefield, Michalina Wanda Pacholska

We consider the problem of sampling at unknown locations. We prove that, in this setting, if we take arbitrarily many samples of a polynomial or real bandlimited signal, it is possible to find another function in the same class, arbitrarily far away from t ...

2017

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Martin Vetterli, Arash Amini, Mitra Fatemi

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of

\mathds{1}_{\{p\leq0\}}

to the image plane, where

\mathds{1}

denotes the indicator function and

p

is some r ...

2016

Computational Aspects of Jacobians of Hyperelliptic Curves

Alina Dudeanu

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

The Interface Control Domain Decomposition Method For Stokes-Darcy Coupling

Alfio Quarteroni, Marco Discacciati

The interface control domain decomposition (ICDD) method of Discacciati, Gervasio, and Quarteroni [SIAM J. Control Optim., 51 (2013), pp. 3434-3458, doi:10.1137/120890764; J. Coupled Syst. Multiscale Dyn., 1 (2013), pp. 372-392, doi:10.1166/jcsmd.2013.1026 ...

Siam Publications2016

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Robert Granger

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method

Pierre Vandergheynst, Daniel Kressner, Nathanaël Perraudin, Ana Susnjara

Sinal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames con-structed from graphs, like wavelets on graphs, has substantially increased. To attain scalabili ...

MATHICSE2015

Reduced Basis Techniques For Nonlinear Conservation Laws

Alfio Quarteroni

In this paper we present a new reduced basis technique for parametrized nonlinear scalar conservation laws in presence of shocks. The essential ingredients are an efficient algorithm to approximate the shock curve, a procedure to detect the smooth componen ...

EDP Sciences2015

Irregular primes and Cyclotomic Invariants to Twelve Million

Graph Chatbot

Chat with Graph Search

Polynomial Escape-Time From Saddle Points In Distributed Non-Convex Optimization

Four-Variable Expanders Over The Prime Fields

Arithmetic and metric aspects of open de Rham spaces

Sampling at unknown locations, with an application in surface retrieval

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Computational Aspects of Jacobians of Hyperelliptic Curves

The Interface Control Domain Decomposition Method For Stokes-Darcy Coupling

Faster ECC over $\mathbb{F}_{2^{521}-1}$

MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method

Reduced Basis Techniques For Nonlinear Conservation Laws

Sampling at unknown locations, with an application in surface retrieval

MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Polynomial Escape-Time From Saddle Points In Distributed Non-Convex Optimization

Four-Variable Expanders Over The Prime Fields

Arithmetic and metric aspects of open de Rham spaces

Computational Aspects of Jacobians of Hyperelliptic Curves

The Interface Control Domain Decomposition Method For Stokes-Darcy Coupling

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Reduced Basis Techniques For Nonlinear Conservation Laws