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.
Let G be a simply connected simple linear algebraic group of exceptional Lie type over an algebraically closed field F of characteristic p >= 0, and let u is an element of G be a non-identity unipotent element. Let phi be a non-trivial irreducible represen ...
We present a more concise formulation of the transformation based synthesis approach for reversible logic synthesis, which is one of the most prominent explicit ancilla-free synthesis approaches. Based on this formulation we devise a symbolic variant of th ...
The book contains extended versions of seven short lecture courses given during a semester programme on Local Representation Theory and Simple Groups, held at the Centre Interfacultaire Bernoulli of the EPF Lausanne. These courses focused on modular repres ...
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 ...
This thesis is in the context of representation theory of finite groups. More specifically, it studies biset functors. In this thesis, I focus on two biset functors: the Burnside functor and the functor of p-permutation modules. For the Burnside functor we ...
A natural extension of the makespan minimization problem on unrelated machines is to allow jobs to be partially processed by different machines while incurring an arbitrary setup time. In this paper we present increasingly stronger LP-relaxations for this ...
Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...
Building on advanced results on permutations, we show that it is possible to construct, for each irreducible representation of SU(N), an orthonormal basis labeled by the set of standard Young tableaux in which the matrix of the Heisenberg SU(N) model (the ...
Let W be a vector space over an algebraically closed field k. Let H be a quasisimple group of Lie type of characteristic p not equal char(k) acting irreducibly on W. Suppose also that G is a classical group with natural module W, chosen minimally with resp ...
Motivated by recent experimental progress in the context of ultracold multicolor fermionic atoms in optical lattices, we have developed a method to exactly diagonalize the Heisenberg SU(N) Hamiltonian with several particles per site living in a fully symme ...
