Related papers: A Logspace Constructive Proof of L=SL
In a 2013 paper, the author showed that the convolution of a compactly supported measure on the real line with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). In a 2014 paper, the author gave bounds for the optimal…
The main result of this work is a new proof and generalization of Lazard's comparison theorem of locally analytic group cohomology with Lie algebra cohomology for K-Lie groups, where K is a finite extension of the p-adic numbers. We show…
Motivated by logarithmic conformal field theory and Gromov-Witten theory, we introduce a notion of a twisted module of a vertex algebra under an arbitrary (not necessarily semisimple) automorphism. Its main feature is that the twisted…
We give a new proof of a slightly modified version of a result of Queffelec--Rose, by constructing a linear basis for the $\mathrm{SL}(n)$ skein algebra of the twice punctured sphere for any non-zero complex number $q$, excluding finitely…
Kotlarski's theorem (see H. Kotlarski. Bounded Induction and Satisfaction Classes. Mathematical Logic Quarterly, vol. 32, 31-34, 1986, P. 531--544.) formalized in $WKL_0$.
This note contains another proof of Grothendieck`s theorem on the splitting of vector bundles on the projective line over a field $k$. Actually the proof is formulated entirely in the classical terms of a lattice $\Lambda \cong k[T]^d$,…
We establish the Strassen's law of the iterated logarithm for independent and identically distributed random variables with $\hat{\mathbb{E}}[X_1]=\hat{\mathcal{E}}[X_1]=0$ and $C_{\mathbb{V}}[X_1^2]<\infty$ under sub-linear expectation…
We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…
We prove Sklar's theorem in infinite dimensions via a topological argument and the notion of inverse systems.
If R, S, T are irreducible SL_3-representations, we give an easy and explicit description of a basis of the space of equivariant maps from R tensor S to T. We apply this method to the rationality problem for invariant function fields. In…
This is a research monograph on symplectic cohomology (disguised as an advanced graduate textbook), which provides a construction of this version of Hamiltonian Floer cohomology for cotangent bundles of closed manifolds. The focus is on the…
We generalize the feasible interpolation theorem for semantic derivations from K.(1997) by allowing randomized protocols (protocols in the sense of K.(1997). We also introduce an extension of the monotone circuit model, monotone circuits…
The algebra of monodromy matrices for sl(n) trigonometric R-matrices is studied. It is shown that a generic finite-dimensional polynomial irreducible representation of this algebra is equivalent to a tensor product of L-operators.…
The semantic foundations for logic programming are usually separated into two different approaches. The operational semantics, which uses SLD-resolution, the proof method that computes answers in logic programming, and the declarative…
A novel formulation of statics in terms of the exterior algebra of an affine space is shown to be the underlying mathematical structure of Vlasov's thin-walled beam theory in structural mechanics.
In this paper, we introduce a proof system $\mathsf{NQGL}$ for a Kripke complete predicate extension of the logic $\mathbf{GL}$, that is, the logic of provability, which is defned by $\mathbf{K}$ and the L\"{o}b formula $\Box(\Box p\supset…
Let G be a subgroup of GL(V), where V is a finite dimensional vector space over a finite field of characteristic p >0. If det(g-1) = 0 for all g \in G then we call G a fixed-point subgroup of GL(V). Motivated in parallel by questions in…
We prove several results of the following type: given finite dimensional normed space V possessing certain geometric property there exists another space X having the same property and such that (1) log (dim X) = O(log (dim V)) and (2) every…
We introduce negation under the stable model semantics in DatalogMTL - a temporal extension of Datalog with metric temporal operators. As a result, we obtain a rule language which combines the power of answer set programming with the…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…