Concept

Morphism of schemes

Related publications (34)

Cyclic $A_\infty$-algebras and cyclic homology

We provide a new description of the complex computing the Hochschild homology of an -unitary -algebra as a derived tensor product such that: (1) there is a canonical morphism from it to the complex computing the cyclic homology of that was introduced by Ko ...

2023

FIBERED TORIC VARIETIES

Leonid Monin

A toric variety is called fibered if it can be represented as a total space of fibre bundle over toric base and with toric fiber. Fibered toric varieties form a special case of toric variety bundles. In this note we first give an introduction to the class ...

Moscow2023

Conditional Flatness, Fiberwise Localizations, And Admissible Reflections

Jérôme Scherer

We extend the group-theoretic notion of conditional flatness for a localization functor to any pointed category, and investigate it in the context of homological categories and of semi-abelian categories. In the presence of functorial fiberwise localizatio ...

CAMBRIDGE UNIV PRESS2023

Are GAN-based Morphs Threatening Face Recognition?

Sébastien Marcel, Eklavya Sarkar, Laurent Colbois

Morphing attacks are a threat to biometric systems where the biometric reference in an identity document can be altered. This form of attack presents an important issue in applications relying on identity documents such as border security or access control ...

IEEE2022

Orders That Are Etale-Locally Isomorphic

Eva Bayer Fluckiger

Let R be a semilocal Dedekind domain with fraction field F. It is shown that two hereditary R-orders in central simple F-algebras that become isomorphic after tensoring with F and with some faithfully flat etale R-algebra are isomorphic. On the other hand, ...

AMER MATHEMATICAL SOC2020

Orders that are étale-locally isomorphic

Eva Bayer Fluckiger, Mathieu Huruguen

Let R be a semilocal Dedekind domain with fraction field F. It is shown that two hereditary R-orders in central simple F-algebras that become isomorphic after tensoring with F and with some faithfully flat étale R-algebra are isomorphic. On the other hand, ...

2019

Consolidation of database check constraints

Nikola Obrenovic

Independent modeling of various modules of an information system (IS), and consequently database subschemas, may result in formal or semantic conflicts between the modules being modeled. Such conflicts may cause collisions between the integrated database s ...

2019

Sparsified SGD with Memory

Martin Jaggi, Sebastian Urban Stich, Jean-Baptiste Francis Marie Juliette Cordonnier

Huge scale machine learning problems are nowadays tackled by distributed optimization algorithms, i.e. algorithms that leverage the compute power of many devices for training. The communication overhead is a key bottleneck that hinders perfect scalability. ...

2018

On subadditivity of Kodaira dimension in positive characteristic over a general type base

Zsolt Patakfalvi

We show that for a surjective, separable morphism f of smooth projective varieties over a field of positive characteristic such that f(*) OX congruent to O-Y subadditivity of Kodaira dimension holds, provided the base is of general type and the Hasse-Witt ...

2018

Exact diagonalization of SU( N ) Heisenberg and Affleck-Kennedy-Lieb-Tasaki chains using the full SU( N ) symmetry

Frédéric Mila, Pierre Marcel Nataf, Kianna Wan

We present a method for the exact diagonalization of the SU(N) Heisenberg interaction Hamiltonian using Young tableaus to work directly in each irreducible representation of the global SU(N) group. This generalized scheme is applicable to chains consisting ...

2017

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.