Concept

Homomorphism

Publications associées (21)

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes

We present polynomial families complete for the well-studied algebraic complexity classes VF, VBP, VP, and VNP. The polynomial families are based on the homomorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. (2018). ...

ASSOC COMPUTING MACHINERY2021

Characteristic classes as complete obstructions

Martina Rovelli

In the first part of this paper, we propose a uniform interpretation of characteristic classes as obstructions to the reduction of the structure group and to the existence of an equivariant extension of a certain homomorphism defined a priori only on a sin ...

SPRINGER HEIDELBERG2019

Combinatorial presentation of multidimensional persistent homology

Martina Scolamiero

A multifiltration is a functor indexed by Nr that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural Nr-graded R[x(1),...x(r)]-module structure on the homology of a multifiltration of ...

Elsevier2017

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Laser-assisted morphing of complex three dimensional objects

Yves Bellouard, Jakub Drs

Morphing commonly refers to the smooth transition from a specific shape into another one, in which the initial and final shapes can be significantly different. In this study, we show that the concept of morphing applied to laser micro-manufacturing offers ...

Spie-Int Soc Optical Engineering2016

A Dichotomy for Real Weighted Holant Problems

Sangxia Huang

Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as the counting constraint satisfaction problem (#CSP) and graph homomorphism. An effective dichotomy for such frameworks can ...

Springer Basel Ag2016

Left-induced model structures and diagram categories

Kathryn Hess Bellwald, Varvara Karpova, Magdalena Kedziorek

We prove existence results à la Jeff Smith for left-induced model category structures, of which the injective model structure on a diagram category is an important example. We further develop the notions of fibrant generation and Postnikov presentation fro ...

2015

Left-Induced Model Structures and Diagram Categories

Kathryn Hess Bellwald, Varvara Karpova, Magdalena Kedziorek

We prove existence results a la Jeff Smith for left-induced model category structures, of which the injective model structure on a diagram category is an important example. We further develop the notions of fibrant generation and Postnikov presentation fro ...

Amer Mathematical Soc2015

Hermitian Categories, Extension Of Scalars And Systems Of Sesquilinear Forms

Eva Bayer Fluckiger, Daniel Arnold Moldovan

We prove that the category of systems of sesquilinear forms over a given hermitian category is equivalent to the category of unimodular 1-hermitian forms over another hermitian category. The sesquilinear forms are not required to be unimodular or defined o ...

Pacific Journal Mathematics2014

Short Undeniable Signatures Based on Group Homomorphisms

Serge Vaudenay, Jean Monnerat

This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully scalable size depending on the security level. To this end, we develop a gene ...

Springer Verlag2011

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