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.
In an article of 2003, Kulshammer, Olsson, and Robinson defined l-blocks for the symmetric groups, where l is an arbitrary integer, and proved that they satisfy an analogue of the Nakayama Conjecture. Inspired by this work and the definitions of generalize ...
Following the work of B. Kulshammer, J. B. Olsson and G. R. Robinson on generalized blocks of the symmetric groups, we give a definition for the l-defect of characters of the symmetric group G(n), where l > 1 is an arbitrary integer. We prove that the l-de ...
In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism test between different configurations and the graph edit-distance is a similari ...
The sensitivity of a multiple eigenvalue of a matrix under perturbations can be measured by its Hölder condition number. Various extensions of this concept are considered. A meaningful notion of structured Hölder condition numbers is introduced, and it is ...
Society for Industrial and Applied Mathematics2009
In a paper of 2003, Kulshammer, Olsson and Robinson defined l-blocks for the symmetric groups, where l > 1 is an arbitrary integer. In this paper, we give a definition for the defect group of the principal l-block. We then check that, in the Abelian case, ...
We formulate and derive a generalization of an orthogonal rational-function basis for spectral expansions over the infinite or semi-infinite interval. The original functions, first presented by Wiener, are a mapping and weighting of the Fourier basis to th ...
The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...
The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...
The fundamental group of the Quillen complex of the symmetric group is studied and the cases where the complex is simply-connected are determined. Other results concerning the homology groups are also proved. ...
We propose a design oriented charge-based model for undoped DG MOSFETs under symmetrical operation that aims at giving a comprehensive understanding of the device from the design strategy. In particular, we introduce useful normalizations for current and c ...