相关论文: Fortifying the Yomdin-Gromov Algebraic Lemma
It turns out that a parametrization of degenerate density matrices requires a parametrization of $\mathfrak{F}=U(n)/({U(k_1)\times U(k_2)\times \cdots \times U(k_m)})\quad n=k_1 +\cdots + k_m $ where $U(k)$ denotes the set of all unitary…
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…
We extend the deformation theory algorithm of matrix factorizations to systems with more than one D-brane. The obstructions to the deformations are F-term equations which can be integrated to an effective superpotential. We demonstrate the…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…
A Lie-Yamaguti algebra is a non-associative algebraic structure that generalizes both Lie algebras and Lie triple systems. We first consider the factorization problem for Lie-Yamaguti algebras that essentially related to the bicrossed…
This is the first of a series of papers about \emph{quantization} in the context of \emph{derived algebraic geometry}. In this first part, we introduce the notion of \emph{$n$-shifted symplectic structures}, a generalization of the notion…
We prove several structural results on definably compact groups G in o-minimal expansions of real closed fields, such as (i) G is definably an almost direct product of a semisimple group and a commutative group, and (ii) the group (G, .) is…
The overarching goal of this thesis was to develop categorical methods that connect enumerative geometry, as studied in mirror symmetry, with large $N$ gauge theories. In the first part, we established a relation between graph complexes,…
We give a proof of the Gromov compactness theorem using the language of stable curves (i.e. cusp-curve of Gromov, or stable maps of Kontsevich and Manin) in general setting: An almost complex structure on a target manifold is only…
We here extend the well known Positive Real Lemma (also known as the Kalman-Yakubovich-Popov Lemma) to complex matrix-valued generalized positive rational function, when non-minimal realizations are considered. We then exploit this result…
Given a holomorphic submersion of reduced complex spaces, we prove that the basic Oka property of the submersion implies the parametric Oka property. This generalizes the corresponding result for complex manifolds (F. Forstneric, Oka…
We investigate the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on weakly o-minimal structures $\mathcal M$ admitting strong cell decomposition.
Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising…
Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…
With a view towards applications for de Sitter, we construct the multi-parametric $q$-deformation of the $so(5,\IC)$ algebra using the Faddeev-Reshetikhin-Takhtadzhyan (FRT) formalism.
A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…