Related papers: Topics in Boolean Representable Simplicial Complex…
We develop the theory of locally small spaces in a new simple language and apply this simplification to re-build the theory of locally definable spaces over structures with topologies.
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
We describe a family of twisted partition functions for the relativistic spinning particle models. For suitable choices of fugacities this computes a refined Euler characteristics that counts the dimension of the physical states for…
The robustness properties of bipartite entanglement in systems of N bosons distributed in M different modes are analyzed using a definition of separability based on commuting algebras of observables, a natural choice when dealing with…
These notes survey some aspects of discrete-time chaotic calculus and its applications, based on the chaos representation property for i.i.d. sequences of random variables. The topics covered include the Clark formula and predictable…
We consider the problem of minimizing a sparse nonconvex quadratic function over the unit hypercube. By developing an extension of the Reformulation-Linearization Technique (RLT) to continuous quadratic sets, we propose a novel second-order…
This survey discusses hyperbolicity properties of moduli stacks and generalisations of the Shafarevich Hyperbolicity Conjecture to higher dimensions. It concentrates on methods and results that relate moduli theory with recent progress in…
We develop a stochastic calculus that makes it easy to capture a variety of predictable transformations of semimartingales such as changes of variables, stochastic integrals, and their compositions. The framework offers a unified treatment…
We survey current term-wise techniques for quadratizing high-degree pseudo-Boolean functions and introduce a new one, which allows multiple splits of terms. We also introduce the first aggregative approach, which splits a collection of…
Promise Constraint Satisfaction Problems (PCSP) were proposed recently by Brakensiek and Guruswami arXiv:1704.01937 as a framework to study approximations for Constraint Satisfaction Problems (CSP). Informally a PCSP asks to distinguish…
Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context, especially for real-world cases. Designing an…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is…
A brief review is presented of the scaling of complex fluids, polymers and polyelectrolytes in solution and in confined geometry, in thermodynamical, structural and rheology properties using equilibrium and nonequilibrium dissipative…
This is a survey of the theory of complex projective (CP^1) structures on compact surfaces. After some preliminary discussion and definitions, we concentrate on three main topics: (1) Using the Schwarzian derivative to parameterize the…
The BRST structure of polynomial Poisson algebras is investigated. It is shown that Poisson algebras provide non trivial models where the full BRST recursive procedure is needed. Quadratic Poisson algebras may already be of arbitrarily high…
Schr\"odinger operator on half-line with complex potential and the corresponding evolution are studied within perturbation theoretic approach. The total number of eigenvalues and spectral singularities is effectively evaluated. Wave…
In this paper we present a comprehensive theoretical description of molecular spectral converters in the specific context of Luminescent Solar Concentrators (LSCs). The theoretical model is an extension to a three-level system interacting…
We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational…
Recently, much work has been carried out to study simplicial interpretations of modal logic. While notions of (distributed) knowledge have been well investigated in this context, it has been open how to model belief in simplicial models. We…