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 ...
Description (through texts, images, models or samples) played a central role in the patent regimes that emerged in the eighteenth century, first in England, later in the United States and in France. Description ensured that the contract—protection in excha ...
We generalize the fixed-point property for discrete groups acting on convex cones given by Monod in [23] to topological groups. At first, we focus on describing this fixed-point property from a functional point of view, and then we look at the class of gro ...
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 ...
The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...
Let k be an algebraically closed field of arbitrary characteristic, let G be a simple simply connected linear algebraic group and let V be a rational irreducible tensor-indecomposable finite-dimensional kG-module. For an element g of G we denote by $V_{g}( ...
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 invol ...
This paper proposes a representational model for image pairs such as consecutive video frames that are related by local pixel displacements, in the hope that the model may shed light on motion perception in primary visual cortex (V1). The model couples the ...
In several machine learning settings, the data of interest are well described by graphs. Examples include data pertaining to transportation networks or social networks. Further, biological data, such as proteins or molecules, lend themselves well to graph- ...
We prove an identity relating the permanent of a rank 2 matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the possibility that t ...
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 study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and φ : G → GL(V ) is a non-trivial irreducible repres ...
We present an open-source program irvsp, to compute irreducible representations of electronic states for all 230 space groups with an interface to the Vienna ab-initio Simulation Package. This code is fed with plane-wave-based wavefunctions (e.g. WAVECAR) ...
Background: The increasingly common applications of machine-learning schemes to atomic-scale simulations have triggered efforts to better understand the mathematical properties of the mapping between the Cartesian coordinates of the atoms and the variety o ...
The measurement and classification of light is essential across many scientific disciplines. Devices used to measure light range from the highly precise scanning spectroradiometers to the more practical compact multichannel filter-array type imaging sensor ...
In recent years, the idea that the prediction of sensory input is one of the major computational goals of the nervous system led to the development of several large-scale theories of brain functioning, such as different versions of the Bayesian approach to ...
The present work deals with monochromatic wavefront aberrations in optical systems without symmetries. The treatment begins with a class of systems characterized by misaligned spherical surfaces whose behavior is analyzed using the wavefront aberration exp ...
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 ...
Principal component analysis (PCA) finds the best linear representation of data and is an indispensable tool in many learning and inference tasks. Classically, principal components of a dataset are interpreted as the directions that preserve most of its "e ...