Related papers: Strong density of definable types and closed order…
Density matrices are powerful mathematical tools for the description of closed and open quantum systems. Recently, methods for the direct computation of density matrix elements in scalar quantum field theory were developed based on thermo…
We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…
I summarize Density Functional Theory (DFT) in a language familiar to quantum field theorists, and introduce several apparently novel ideas for constructing {\it systematic} approximations for the density functional. I also note that, at…
Let $T$ be a complete, model complete o-minimal theory extending the theory RCF of real closed ordered fields in some appropriate language $L$. We study derivations $\delta$ on models $\mathcal{M}\models T$. We introduce the notion of a…
Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws,…
We prove that the electron density function of a real physical system can be uniquely determined by its values on any finite subsystem. This establishes the existence of a rigorous density-functional theory for any open electronic system.…
In the paper we construct and develop a fiber strong shape theory for arbitrary spaces over fixed metrizable space $\Bo$. Our approach is based on the method of Marde\v{s}i\'{c}-Lisica and instead of resolutions, introduced by…
To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…
Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…
In Tensor Field Theory (TFT), observables are defined through tensor field contractions that produce unitary invariants for complex-valued tensor fields. Traditionally, these observables are constructed using tensor fields of a fixed order…
We continue our earlier study of finite dimensional definable groups in models of the the model companion of an o-minimal L-theory T expanded by a generic derivation as in [F-K]. We generalize Buium's notion of an algebraic D-group to…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
The work is motivated by the papers [Ba1], [Ba2], [Ba7], [Ba11], [Be] and [Be-Tu]. In particular, the strong homology groups of continuous maps were defined and studied in [Be] and [Be-Tu]. To show that given groups are homology type…
For certain theories of existentially closed topological differential fields, we show that there is a strong relationship between $\mathcal L\cup\{D\}$-definable sets and their $\mathcal L$-reducts, where $\mathcal L$ is a relational…
Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.
We develop a categorical framework for reasoning about abstract properties of differentiation, based on the theory of fibrations. Our work encompasses the first-order fragments of several existing categorical structures for differentiation,…
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of…