Related papers: Logical Characterizations of Weighted Complexity C…
We study 2-d $\phi F$ gauge theories with the objective to understand, also at the quantum level, the emergence of induced gravity. The wave functionals - representing the eigenstates of a vanishing flat potential - are obtained in the…
We develop a general response theory of gapless Fermi points with nontrivial topological charges for gauge and nonlinear sigma fields, which asserts that the topological character of the Fermi points is embodied as the terms with discrete…
We show that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata. To show this, we combine ideas from automata theory and communication complexity. However,…
This study of gauge field theories on kappa-deformed Minkowski spacetime extends previous work on field theories on this example of a noncommutative spacetime. We construct deformed gauge theories for arbitrary compact Lie groups using the…
According to Laumon, an affine Springer fiber is homeomorphic to the universal abelian covering of the compactified Jacobian of a spectral curve. We construct equivariant deformations $f_{n}:\overline{\mathcal{P}}_{n}\to \mathcal{B}_{n}$ of…
We extend Deligne's weight filtration to the integer cohomology of complex analytic spaces (endowed with an equivalence class of compactifications). In general, the weight filtration that we obtain is not part of a mixed Hodge structure.…
In many computer vision tasks, for example saliency prediction or semantic segmentation, the desired output is a foreground map that predicts pixels where some criteria is satisfied. Despite the inherently spatial nature of this task…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
We study formal languages which are capable of fully expressing quantitative probabilistic reasoning and do-calculus reasoning for causal effects, from a computational complexity perspective. We focus on satisfiability problems whose…
Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…
Reasoning on large and complex real-world models is a computationally difficult task, yet one that is required for effective use of many AI applications. A plethora of inference algorithms have been developed that work well on specific…
Modern logics of dependence and independence are based on team semantics, which means that formulae are evaluated not on a single assignment of values to variables, but on a set of such assignments, called a team. This leads to high…
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in the Blum-Shub-Smale (BSS) model on the other. Given a fixed…
We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
We study second order perturbation theory for embedded eigenvalues of an abstract class of self-adjoint operators. Using an extension of the Mourre theory, under assumptions on the regularity of bound states with respect to a conjugate…
We define typical forcings encompassing many informal forcing arguments in bounded arithmetic and give general conditions for such forcings to produce models of the universal variant of relativized $T^1_2$. We apply this result to study the…
We develop flexible methods of deriving variational inference for models with complex latent variable structure. By splitting the variables in these models into "global" parameters and "local" latent variables, we define a class of…
In this paper we expand the theory of weighted sheaves over posets, and use it to study the local homology of Artin groups. First, we use such theory to relate the homology of classical braid groups with the homology of certain independence…
This paper is dedicated to weighted composition semigroups on spaces of continuous functions and their subspaces. We consider semigroups induced by semiflows and semicocycles on Banach spaces $\mathcal{F}(\Omega)$ of continuous functions on…