Related papers: A constructive proof of the phase-type characteriz…
We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…
In this paper we prove an equivalence theorem originally observed by Robert MacPherson. On one side of the equivalence is the category of cosheaves that are constructible with respect to a locally cone-like stratification. Our…
The theory of character sheaves on a reductive group is extended to a class of varieties which includes the strata of the De Concini-Procesi completion of an adjoint group.
An overview of the accomplishments of constructive quantum field theory is provided.
We present a new phase-field model of solidification which allows efficient computations in the regime when interface kinetic effects dominate over capillary effects. The asymptotic analysis required to relate the parameters in the…
This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a generalization. We review the notation of trace diagrams and…
This is a status report on a companion subject to extremal combinatorics, obtained by replacing extremality properties with emergent structure, `phases'. We discuss phases, and phase transitions, in large graphs and large permutations,…
We construct new invariants and give several theorems which determine in general (i) the number of physically meaningful phases in quark mass matrices and (ii) which elements of these matrices can be rendered real by rephasings. We…
The purpose of this paper is to find the characterization of the Sheffer polynomial sets satisfying the d-orthogonality conditions. The generating function form of these polynomial sets is given in Theorem 2.2. As applications of the…
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…
Let M be a II_1 factor, A a masa in M and E the unique conditional expectation on A. Under some technical assumptions on the inclusion of A in M, which hold true for any semiregular masa of a separable factor, we show that for every…
The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.
We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency proof does not rely on the representation of consistency as…
We introduce the notion of a logical model category which is a Quillen model category satisfying some additional conditions. Those conditions provide enough expressive power that one can soundly interpret dependent products and sums in it.…
A constructive version of the celebrated Boyle-Handelman theorem on the non-zero spectra of nonnegative matrices is presented.
The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
We extend Homotopy Type Theory with a novel modality that is simultaneously a monad and a comonad. Because this modality induces a non-trivial endomap on every type, it requires a more intricate judgemental structure than previous modal…