We introduce robust principal component analysis from a data matrix in which the entries of its columns have been corrupted by permutations, termed Unlabeled Principal Component Analysis (UPCA). Using algebraic geometry, we establish that UPCA is a well-de ...
In this thesis, we apply cochain complexes as an algebraic model of space in a diverse range of mathematical and scientific settings. We begin with an algebraic-discrete Morse theory model of auto-encoding cochain data, connecting the homotopy theory of d ...
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 ...
The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently in ...
Let h be a connective homology theory. We construct a functorial relative plus construction as a Bousfield localization functor in the category of maps of spaces. It allows us to associate to a pair (X,H), consisting of a connected space X and an hperfect ...
Endogenous and exogenous uncertainties exert significant influences on energy planning. In this study, we propose a systematic methodology to excavate the uncertainty space, by combining mix-integer linear programming (MILP), Monte Carlo simulation, and ma ...
Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP, as long as one is willing to make a suitable physical assu ...
In this thesis, we give a modern treatment of Dwyer's tame homotopy theory using the language of ∞-categories.
We introduce the notion of tame spectra and show it has a concrete algebraic description.
We then carry out a study of ∞-operads an ...
We define a generalization of the Mullineux involution on multipartitions using the theory of crystals for higher-level Fock spaces. Our generalized Mullineux involution turns up in representation theory via two important derived functors on cyclotomic Che ...
Let k be a field of positive characteristic. Building on the work of the second named author, we define a new class of k-algebras, called diagonally F-regular algebras, for which the so-called Uniform. Symbolic Topology Property (USTP) holds effectively. W ...
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 ...
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 ...
Factorization of matrices where the rank of the two factors diverges linearly with their sizes has many applications in diverse areas such as unsupervised representation learning, dictionary learning or sparse coding. We consider a setting where the two fa ...
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 powerful ...
Discrete sizing and topology optimization of truss structures subject to stress and displacement constraints has been formulated as a Mixed-Integer Linear Programming (MILP) problem. The computation time to solve a MILP problem to global optimality via a b ...
We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...
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 thesis explores the application of semiclassical methods in the study of states with large quantum numbers for theories invariant under internal symmetries.
In the first part of the thesis, we study zero-temperature superfluids. These provide a gener ...
We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...
