Related papers: Notes on trace equivalence
We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…
We define the notion $\phi(x,y)$ has $NIP$ in $A$, where $A$ is a subset of a model, and give some equivalences by translating results from [1]. Using additional material from [11] we discuss the number of coheirs when $A$ is not…
Weak structures abound in higher category theory, but are often suitably equivalent to stricter structures that are easier to understand. We extend strictification for tricategories and trihomomorphisms to trinatural transformations,…
A mathematical interpretation of the usual definition of entropy (for a discrete probability distribution or a trace 1 positive operator) is given. This formulation makes some properties of entropy immediate.
Many important cryptographic primitives offer probabilistic guarantees of security that can be specified as quantitative hyperproperties; these are specifications that stipulate the existence of a certain number of traces in the system…
We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions $\phi\colon (0,\infty)\to(0,\infty)$. Two separated nets are called $\phi$-displacement…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
We introduce the notion of weak commensurabilty of arithmetic subgroups and relate it to the length equivalence and isospectrality of locally symmetric spaces. We prove many strong consequences of weak commensurabilty and derive from these…
In the paper "Does the weak trace show the past of a quantum particle?" [arXiv:2109.14060v2], it is argued that null weak values of the spatial projectors are inadequate to infer the presence of a quantum particle at an intermediate time…
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
To address a looming crisis of unreproducible evaluation for named entity recognition, we propose guidelines and introduce SeqScore, a software package to improve reproducibility. The guidelines we propose are extremely simple and center…
In this work, new equivalences of topological statements and weaker axioms than ${\bf AC}$ are proven. This equivalences include the use of anti-properties. All this equivalences have been checked with a computer using the theorem proving…
The asymmetry of a quantum state relative to a translational group is a central concept in many areas of quantum science and technology. An important and geometrically intuitive measure of translational asymmetry of a state is given by the…
Following on from the notion of (first-order) causality, which generalises the notion of being tracepreserving from CP-maps to abstract processes, we give a characterization for the most general kind of map which sends causal processes to…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
A scalar theory with a preferred reference frame is summarized. To test that theory in celestial mechanics, an "asymptotic" post-Newtonian (PN) scheme has been developed. This associates a conceptual family of self-gravitating systems with…
Gopal Prasad and A. S. Rapinchuk defined a notion of weakly commensurable lattices in a semisimple group, and gave a classification of weakly commensurable Zariski dense subgroups. A motivation was to classify pairs of locally symmetric…
We prove trace theorems for weighted mixed norm Sobolev spaces in the upper-half space where the weight is a power function of the vertical variable. The results show the differentiability order of the trace functions depends only on the…
Previous research on relation classification has verified the effectiveness of using dependency shortest paths or subtrees. In this paper, we further explore how to make full use of the combination of these dependency information. We first…