Concept

Structure constants

Publications associées (31)

Double Quasi-Poisson Algebras are Pre-Calabi-Yau

In this article, we prove that double quasi-Poisson algebras, which are noncommutative analogues of quasi-Poisson manifolds, naturally give rise to pre-Calabi-Yau algebras. This extends one of the main results in [11], where a correspondence between certai ...

2022

Kinetic Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Puoya Tabaghi

Euclidean distance matrices (EDMs) are a major tool for localization from distances, with applications ranging from protein structure determination to global positioning and manifold learning. They are, however, static objects which serve to localize point ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Optical conductivity of the type-II Weyl semimetal TaIrTe4

Ana Akrap, Konstantin Semeniuk

TaIrTe4 is an example of a candidate Weyl type-II semimetal with a minimal possible number of Weyl nodes. Four nodes are reported to exist in a single plane in k space. The existence of a conical dispersion linked toWeyl nodes has yet to be shown experimen ...

AMER PHYSICAL SOC2020

Applications of one-point extensions to compute the A∞-(co)module structure of several Ext (resp., Tor) groups

Let A be a nonnegatively graded connected algebra over a noncommutative separable k-algebra K, and let M be a bounded below graded right A-module. If we denote by T the -coalgebra , we know that there exists an -comodule structure on over T. The structure ...

2019

MATHICSE Technical Report : Fast solvers for 2D fractional differential equations using rank structured matrices

Marco Mazza, Stefano Massei

We consider the discretization of time-space diffusion equations with fractional derivatives in space and either 1D or 2D spatial domains. The use of implicit Euler scheme in time and finite differences or finite elements in space, leads to a sequence of d ...

MATHICSE2018

Using torsion theory to compute the algebraic structure of Hochschild (co)homology

The aim of this article is to provide explicit formulas for the cup product on the Hochschild cohomology of any nonnegatively graded connected algebra and for the cap products on the Hochschild homology of with coefficients in any graded bimodule at the le ...

2018

Long-Term Time-Sensitive Costs for CRF-Based Tracking by Detection

Jean-Marc Odobez, Alexandre Heili

We present a Conditional Random Field (CRF) approach to tracking-by-detection in which we model pairwise factors linking pairs of detections and their hidden labels, as well as higher order potentials defined in terms of label costs. Our method considers l ...

Springer Int Publishing Ag2016

Effects of hydropeaking waves offsets on growth performances of juvenile Salix species

Alexandre Buttler, Paolo Perona, Pascal Turberg, Constant Signarbieux, Lorenzo Gorla

Hydropower production and other human activities change the natural flow regime of rivers (e.g., hydropeaking effects), in turn, impacting the riparian environment. Here we present an experiment conceived to investigate the response of forced offsets in wa ...

Elsevier2015

On the multi-Koszul property for connected algebras.

In this article we introduce the notion of emphmulti-Koszul algebra for the case of a locally finite dimensional nonnegatively graded connected algebra, as a generalization of the notion of (generalized) Koszul algebras defined by R. Berger for homogeneous ...

2013

Stiffness tomography exploration of living and fixed macrophages

Giovanni Dietler, Sandor Kasas, Giovanni Longo, Charles Roduit, Bhaskar Saha, Andrea Volterra

Stiffness tomography is a new atomic force microscopy imaging technique that allows highlighting structures located underneath the surface of the sample. In this imaging mode, such structures are identified by investigating their mechanical properties. We ...

Wiley-Blackwell2012

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