On defect groups for generalized blocks of the symmetric group
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.
Recently, SU(3) chains in the symmetric and self-conjugate representations have been studied using field theory techniques. For certain representations, namely rank-psymmetric ones with pnot a multiple of 3, it was argued that the ground state exhibits gap ...
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general position, based ...
Methods of topological data analysis have been successfully applied in a wide range of fields to provide useful summaries of the structure of complex data sets in terms of topological descriptors, such as persistence diagrams. While there are many powerfu ...
We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. First, we show that a symmetric set S subset of Z(q)(n) containing vertical bar S vertical bar = mu . q(n) elements must contain at leas ...
ELECTRONIC JOURNAL OF COMBINATORICS2020
, ,
Motivated by the recent generalization of the Haldane conjecture to SU(3) chains [Lajko et al., Nucl. Phys. B924, 508 (2017)] according to which a Haldane gap should be present for symmetric representations if the number of boxes in the Young diagram is a ...
AMER PHYSICAL SOC2020
In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view.Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B involve ...
EPFL2022
This dissertation investigates the amenability of topological full groups using a property of group actions called extensive amenability. Extensive amenability is a core concept of several amenability results for groups of dynamical origin. We study its pr ...
We study actions of groups by orientation preserving homeomorphisms on R (or an interval) that are minimal, have solvable germs at +/-infinity and contain a pair of elements of a certain dynamical type. We call such actions coherent. We establish that such ...
The input of almost every machine learning algorithm targeting the properties of matter at the atomic scale involves a transformation of the list of Cartesian atomic coordinates into a more symmetric representation. Many of the most popular representations ...
We develop an elementary algebraic method to compute the center of the principal block of a small quantum group associated with a complex semisimple Lie algebra at a root of unity. The cases of sl(3) and sl(4) are computed explicitly. This allows us to for ...
