Publications associées à Topologie algébrique

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.

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

2023

Discovering Influencers in Opinion Formation Over Social Graphs

Ali H. Sayed, Mert Kayaalp, Valentina Shumovskaia, Mert Cemri

The adaptive social learning paradigm helps model how networked agents are able to form opinions on a state of nature and track its drifts in a changing environment. In this framework, the agents repeatedly update their beliefs based on private observation ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Landau levels of the Euler class topology

Oleg Yazyev, Yifei Guan

Two-dimensional systems with C2T (PT) symmetry exhibit the Euler class topology E is an element of Z in each two-band subspace realizing a fragile topology beyond the symmetry indicators. By systematically studying the energy levels of Euler insulating pha ...

AMER PHYSICAL SOC2022

Coxeter Combinatorics For Sum Formulas In The Representation Theory Of Algebraic Groups

Jonathan Gruber

Let G be a simple algebraic group over an algebraically closed field F of characteristic p >= h, the Coxeter number of G. We observe an easy 'recursion formula' for computing the Jantzen sum formula of a Weyl module with p-regular highest weight. We also d ...

AMER MATHEMATICAL SOC2022

A Shadow Perspective on Equivariant Hochschild Homologies

Kathryn Hess Bellwald, Inbar Klang

Shadows for bicategories, defined by Ponto, provide a useful framework that generalizes classical and topological Hochschild homology. In this paper, we define Hochschild-type invariants for monoids in a symmetric monoidal, simplicial model category V, as ...

OXFORD UNIV PRESS2022

Figlearn: Filter And Graph Learning Using Optimal Transport

Pascal Frossard, Mireille El Gheche, Matthias Minder, Zahra Farsijani

In many applications, a dataset can be considered as a set of observed signals that live on an unknown underlying graph structure. Some of these signals may be seen as white noise that has been filtered on the graph topology by a graph filter. Hence, the k ...

IEEE2021

Algebraic Homotopy Interleaving Distance

Nicolas Michel Berkouk

The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous difficulties, wher ...

SPRINGER INTERNATIONAL PUBLISHING AG2021

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Multiscale Representation Learning of Graph Data With Node Affinity

Pascal Frossard, Chenglin Li, Xing Gao

Graph neural networks have emerged as a popular and powerful tool for learning hierarchical representation of graph data. In complement to graph convolution operators, graph pooling is crucial for extracting hierarchical representation of data in graph neu ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Topologie algébrique

Graph Chatbot

Chattez avec Graph Search

Cochains are all you need

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Discovering Influencers in Opinion Formation Over Social Graphs

Landau levels of the Euler class topology

Coxeter Combinatorics For Sum Formulas In The Representation Theory Of Algebraic Groups

A Shadow Perspective on Equivariant Hochschild Homologies

Figlearn: Filter And Graph Learning Using Optimal Transport

Algebraic Homotopy Interleaving Distance

A unifying framework for form-finding and topology-finding of tensegrity structures

Multiscale Representation Learning of Graph Data With Node Affinity

Cochains are all you need

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Coxeter Combinatorics For Sum Formulas In The Representation Theory Of Algebraic Groups

A Shadow Perspective on Equivariant Hochschild Homologies

Algebraic Homotopy Interleaving Distance

A unifying framework for form-finding and topology-finding of tensegrity structures

Multiscale Representation Learning of Graph Data With Node Affinity

Landau levels of the Euler class topology

Discovering Influencers in Opinion Formation Over Social Graphs

Figlearn: Filter And Graph Learning Using Optimal Transport