Exponential Kleisli Monoids as Eilenberg-Moore Algebras

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.

Let K be an algebraically closed field of characteristic zero, and let G be a connected reductive algebraic group over K. We address the problem of classifying triples (G, H, V ), where H is a proper connected subgroup of G, and V is a finitedimensional ir ...

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 ...

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 ...

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 ...

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 ...

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Threshold Implementations have become a popular generic technique to construct circuits resilient against power analysis attacks.In this paper, we look to devise efficient threshold circuits for the lightweight block cipher family SKINNY. The only threshol ...

Extended tonality is a central system that characterizes the music from the 19th up to the 21st century, including styles like popular music, film music or Jazz. Developing from classical major-minor tonality, the harmonic language of extended tonality for ...

In this thesis, we study the homotopical relations of 2-categories, double categories, and their infinity-analogues. For this, we construct homotopy theories for the objects of interest, and show that there are homotopically full embeddings of 2-categories ...

Background: Functional connectomes (FCs) have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders. Thus, developing accurate ways to compare FCs is essential ...

As part of the study of correspondence functors, the present paper investigates their tensor product and proves some of its main properties. In particular, the correspondence functor associated to a finite lattice has the structure of a commutative algebra ...

In this paper, we carry out a systematic comparison between the theoretical properties of Spectral Element Methods and NURBS-based Isogeometric Analysis in its basic form, that is in the framework of the Galerkin method, for the approximation of the Poisso ...

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

Pitch-class distributions are of central relevance in music information retrieval, computational musicology and various other fields, such as music perception and cognition. However, despite their structure being closely related to the cognitively and musi ...

We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms ...

A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...

In this paper, we propose kinetic Euclidean distance matrices (KEDMs) a new algebraic tool for localization of moving points from spatio temporal distance measurements. KEDMs are inspired by the well-known Euclidean distance matrices (EDM) which model stat ...

We consider sample path properties of the solution to the stochastic heat equation, in Rd or bounded domains of Rd, driven by a Levy space-time white noise. When viewed as a stochastic process in time with values in an infinite-dimensional space, the solut ...

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

We study the system of linear partial differential equations given by dw + a Lambda w = f, on open subsets of R-n, together with the algebraic equation da Lambda u = beta, where a is a given 1-form, f is a given (k + 1)-form, beta is a given k + 2-form, w ...

Exponential Kleisli Monoids as Eilenberg-Moore Algebras

Chattez avec Graph Search

Multiplicity-free Representations of Algebraic Groups

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

Conditional Flatness, Fiberwise Localizations, And Admissible Reflections

A Shadow Perspective on Equivariant Hochschild Homologies

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

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Improving First-Order Threshold Implementations of SKINNY

A Formal Model of Extended Tonal Harmony

Homotopical relations between 2-dimensional categories and their infinity-analogues

Geodesic Distance on Optimally Regularized Functional Connectomes Uncovers Individual Fingerprints

Tensor product of correspondence functors

A Computational Comparison Between Isogeometric Analysis and Spectral Element Methods: Accuracy and Spectral Properties

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

The Tonal Diffusion Model

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Unique decomposition of homogeneous languages and application to isothetic regions

On The Move: Localization With Kinetic Euclidean Distance Matrices

Path properties of the solution to the stochastic heat equation with Levy noise

Arithmetic and geometric structures in cryptography

On a generalization of the Poincaré Lemma to equations of the type dw + a ∧ w = f