We study p-adic families of cohomological automorphic forms for GL(2) over imaginary quadratic fields and prove that families interpolating a Zariski-dense set of classical cuspidal automorphic forms only occur under very restrictive conditions. We show ho ...
We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...
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 ...
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}( ...
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 ...
The cotangent complex of a map of commutative rings is a central object in deformation theory. Since the 1990s, it has been generalized to the homotopical setting of E-infinity-ring spectra in various ways. In this work we first establish, in the context o ...
The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous difficulties, wher ...
We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...
We discuss some properties of generative models for word embeddings. Namely, (Arora et al., 2016) proposed a latent discourse model implying the concentration of the partition function of the word vectors. This concentration phenomenon led to an asymptotic ...
Threshold Implementations have become a popular generic technique to construct circuits resilient against power analysis attacks.In this paper, we look to devise efficient threshold circuits for the lightweight block cipher family SKINNY. The only threshol ...