Výsledky vyhledávání

Report

Mixels: Fabricating Interfaces using Programmable Magnetic Pixels

Autor: Nisser, Martin, Makaram, Yashaswini, Covarrubias, Lucian, Bah, Amadou, Faruqi, Faraz, Suzuki, Ryo, Mueller, Stefanie

In this paper, we present Mixels, programmable magnetic pixels that can be rapidly fabricated using an electromagnetic printhead mounted on an off-the-shelve 3-axis CNC machine. The ability to program magnetic material pixel-wise with varying magneti

Externí odkaz: http://arxiv.org/abs/2208.03804

Zobrazit plný text záznamu

Report

Variation of the Swan conductor of an $\mathbb{F}_{\ell}$-sheaf on a rigid annulus

Autor: Bah, Amadou

Let $C=A(r, r')$ be a closed annulus of radii $r$ and $r'$ ($r < r' \in \mathbb{Q}_{\geq 0}$) over a complete discrete valuation field with algebraically closed residue field of characteristic $p>0$. To an \'etale sheaf of $\mathbb{F}_{\ell}$-modules

Externí odkaz: http://arxiv.org/abs/2201.12820

Zobrazit plný text záznamu

Report

Variation of the Swan conductor of an $\mathbb{F}_{\ell}$-sheaf on a rigid disc

Autor: Bah, Amadou

This article studies the variation of the Swan conductor of a lisse \'etale sheaf of $\mathbb{F}_{\ell}$-modules $\mathcal{F}$ on the rigid unit disc $D$ over a complete discrete valuation field $K$ with algebraically closed residue field of characte

Externí odkaz: http://arxiv.org/abs/2010.14843

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Report

Phase Transition in the One-bit Johnson-Lindenstrauss Lemma

Autor: Bah, Amadou, Kagy, Bryson, Smith, Emily

The Johnson-Lindenstrauss Lemma (J-L Lemma) is a cornerstone of dimension reduction techniques. We study it in the one-bit context, namely we consider the unit sphere $ \mathbb S ^{N-1}$, with normalized geodesic metric, and map a finite set $ \mathb

Externí odkaz: http://arxiv.org/abs/1903.02123

Zobrazit plný text záznamu

Report

A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs

Autor: Abascal, Jackson, Bah, Amadou, Banuelos, Mario, Uminsky, David, Vasquez, Olivia

We present a new $O(k^2 \binom{n}{k}^2)$ method for generating an orthogonal basis of eigenvectors for the Johnson graph $J(n,k)$. Unlike standard methods for computing a full eigenbasis of sparse symmetric matrices, the algorithm presented here is n

Externí odkaz: http://arxiv.org/abs/1812.04230

Zobrazit plný text záznamu