Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Semigroup

Related publications (16)

Data-driven 1D wave propagation for site response analysis

Jean-François Molinari, Antonio Joaquin Garcia Suarez, Sacha Zenon Wattel

Prediction of ground motion triggered by earthquakes is a prime concern for both the seismology community and geotechnical earthquake engineering one. The subfield occupied with such a problem is termed site response analysis (SRA), its one-dimensional fla ...

WILEY2023

Data-driven numerical site response

Jean-François Molinari, Antonio Joaquin Garcia Suarez, Sacha Zenon Wattel

2022

Microscopic field theory for structure formation in systems of self-propelled particles with generic torques

Ignacio Pagonabarraga Mora, Elena Sesé Sansa

We derive a dynamical field theory for self-propelled particles subjected to generic torques and forces by explicitly coarse-graining their microscopic dynamics, described by a many-body Fokker-Planck equation. The model includes both intrinsic torques ind ...

AIP Publishing2022

Stability of standing waves for a nonlinear Klein-Gordon equation with delta potentials

François Samer Genoud

In this paper, we study local well-posedness and orbital stability of standing waves for a singularly perturbed one-dimensional nonlinear Klein-Gordon equation. We first establish local well-posedness of the Cauchy problem by a fixed point argument. Unlike ...

2019

Beyond Wiener's Lemma: Nuclear Convolution Algebras and the Inversion of Digital Filters

Michaël Unser, Julien René Fageot, John Paul Ward

A convolution algebra is a topological vector space X that is closed under the convolution operation. It is said to be inverse-closed if each element of X whose spectrum is bounded away from zero has a convolution inverse that is also part of the algebra. ...

SPRINGER BIRKHAUSER2019

Elliptic curves over a finite field and the trace formula

Ian Nicholas Petrow

We prove formulas for power moments for point counts of elliptic curves over a finite field k such that the groups of k-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke operators for certain con ...

Wiley2017

An improvement on the number of simplices in F-q(d)

Van Thang Pham

Let epsilon be a set of points in F-q(d). Bennett et al. (2016) proved that if \epsilon\ >> [GRAHICS] then epsilon determines a positive proportion of all k-simplices. In this paper, we give an improvement of this result in the case when epsilon is the Car ...

Elsevier Science Bv2017

Polarization and Channel Ordering: Characterizations and Topological Structures

Rajai Nasser

Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...

EPFL2017

Deciding Conditional Termination

We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exis ...

Tech Univ Braunschweig2014

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

Ramsey-Type Results For Semi-Algebraic Relations

János Pach

A k-ary semi-algebraic relation E on R-d is a subset of R-kd, the set of k-tuples of points in R-d, which is determined by a finite number of polynomial inequalities in kd real variables. The description complexity of such a relation is at most t if d, k < ...

Amer Mathematical Soc2014

Homogeneous number of free generators

We address two questions of Simon Thomas. First, we show that for any n >= 3 one can find a four-generated free subgroup of SLn (Z) which is profinitely dense. More generally, we show that an arithmetic group Gamma that admits the congruence subgroup prope ...

Walter De Gruyter Gmbh2014

A Dirichlet Analogue Of The Free Monogenic Inverse Semigroup Via Mobius Inversion

George Stoianov

The Mobius inversion formula of the free monogenic inverse semigroup is represented by the Mobius function for Cauchy product. In this short note we describe a Dirichlet analogue of this inverse semigroup. ...

Rocky Mountain Mathematics Consortium2011

A mealy machine with polynomial growth of irrational degree

We consider a very simple Mealy machine ( two nontrivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behave ...

2008

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reas ...

Springer, Springer-Verlag2007

What Can Be Implemented Anonymously?

Rachid Guerraoui

2005

Related publications (16)