/explore
|
You are here 
|
mattbaker.blog | ||
| | | | |
rot256.dev
Introduction This series of posts aims to be a comprehensive collection of facts, protocols, and theorems related to the information-theoretic foundations of multilinear proof systems. By "multilinear proof system" we refer to a system with multilinear polynomials as the underlying "arithmetization" of the proof system: where satisfiability of the computation, a (RAM) machine or circuit, is expressed as randomized relations between multilinear polynomials and the witness is the evaluation of multilinear polynomials over some tensor product. |
|
| | | | | ||
| | | | |
www.jeremykun.com
Last time we defined and gave some examples of rings. Recapping, a ring is a special kind of group with an additional multiplication operation that "plays nicely" with addition. The important thing to remember is that a ring is intended to remind us arithmetic with integers (though not too much: multiplication in a ring need not be commutative). We proved some basic properties, like zero being unique and negation being well-behaved. |
|
| | | | | ||
| | | | |
alanrendall.wordpress.com
The theorem of the title is about dividing smooth functions by other smooth functions or, in other words, representing a given smooth function in terms of products of other smooth functions. A large part of the account which follows is based on that in the book 'Normal Forms and Unfoldings for Local Dynamical Systems' by... |
|
| | | | | ||
| | | | |
drorspei.com
In signal processing it is often that we need to compare two finite impulse responses (FIR). It is also often that we don't care to know the difference between two FIRs outside a specific frequency band, and only care about the difference within that band. Given the difference FIR $latex p$, given as $latex n+1$... |
|
| | | |||
