Concept

Demi-anneau

Publications associées (25)

Idempotents in the endomorphism algebra of a finite lattice

We give a direct construction of a specific central idempotent in the endomorphism algebra of a finite lattice T. This idempotent is associated with all possible sublattices of T which are totally ordered. A generalization is considered in a conjectural fa ...

2021

The algebra of Boolean matrices, correspondence functors, and simplicity

Jacques Thévenaz, Serge Bouc

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...

2020

Positivity of the CM line bundle for families of K-stable klt Fano varieties

Zsolt Patakfalvi, Giulio Codogni

The Chow-Mumford (CM) line bundle is a functorial line bundle on the base of any family of klt Fano varieties. It is conjectured that it yields a polarization on the moduli space of K-poly-stable klt Fano varieties. Proving ampleness of the CM line bundle ...

SPRINGER HEIDELBERG2020

Unique decomposition of homogeneous languages and application to isothetic regions

Nicolas René Jean Ninin

A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...

2019

Cellular Covers of Local Groups

Jérôme Scherer

We prove that, in the category of groups, the composition of a cellularization and a localization functor need not be idempotent. This provides a negative answer to a question of Emmanuel Dror Farjoun. ...

SPRINGER BASEL AG2018

On quadratic matrix equations with infinite size coefficients encountered in QBD stochastic processes

Stefano Massei

Matrix equations of the kind A(1)X(2)+A(0)X+A(-1)=X, where both the matrix coefficients and the unknown are semi-infinite matrices belonging to a Banach algebra, are considered. These equations, where coefficients are quasi-Toeplitz matrices, are encounter ...

WILEY2018

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Design and implementation of an optimizing type-centric compiler for a high-level language

Dmytro Petrashko

Production compilers for programming languages face multiple requirements. They should be correct, as we rely on them to produce code. They should be fast, in order to provide a good developer experience. They should also be easy to maintain and evolve. Th ...

EPFL2017

Quasi-hereditary property of double Burnside algebras

Baptiste Thierry Pierre Rognerud

In this short note, we investigate some consequences of the vanishing of simple biset functors. As a corollary, if there is no non-trivial vanishing of simple biset functors (e.g., if the group G is commutative), then we show that kB(G,G) is a quasi-heredi ...

Elsevier2015

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

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search