Concept

Homomorphism

Related publications (26)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Image Reconstruction in K-Space from MR Data Encoded with Ambiguous Gradient Fields

Daniel Gallichan

PurposeIn this work, the limits of image reconstruction in k-space are explored when non-bijective gradient fields are used for spatial encoding. TheoryThe image space analogy between parallel imaging and imaging with non-bijective encoding fields is parti ...

Wiley-Blackwell2015

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

Injective Classes of Modules

Jérôme Scherer

We study classes of modules over a commutative ring which allow to do homological algebra relative to such a class. We classify those classes consisting of injective modules by certain subsets of ideals. When the ring is Noetherian the subsets are precisel ...

2013

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

Decision Procedures for Algebraic Data Types with Abstractions

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functions. Our abstraction functions are catamorphisms (term a ...

2010

Unitary descent properties

Eva Bayer Fluckiger

Let k be a field of characteristic /=2 and let W(k) be the Witt ring of k and L a finite extension of k. If L/k is a Galois extension, then the image of rL/k is contained in W(L)Gal(L/k) where rL/k:W(k)→W(L) is the canonical ring homomorphism. Rosenberg an ...

2009

Method to generate, verify and deny an undeniable signature

Serge Vaudenay, Jean Monnerat

The aim of the invention is to propose the generation, verification and denial of an undeniable signature which has a size smaller than the currently available undeniable signatures, i.e. less than 80 bits. This aim is achieved by the method to generate an ...

2008