Related papers: Size matters in the modal $\mu$-calculus
In the social sciences we are often interested in comparing models specified by parametric equality or inequality constraints. For instance, when examining three group means $\{ \mu_1, \mu_2, \mu_3\}$ through an analysis of variance…
We introduce the notion of tubular dimension, and give a formula for it. As an application we show that every invariant measure of a $C^{1+\gamma}$ diffeomorphism of a closed Riemannian manifold admits an asymptotic local product structure…
Let $\pi:X\to Y$ be a factor map, where $(X,\sigma_X)$ and $(Y,\sigma_Y)$ are subshifts over finite alphabets. Assume that $X$ satisfies weak specification. Let $\ba=(a_1,a_2)\in \R^2$ with $a_1>0$ and $a_2\geq 0$. Let $f$ be a continuous…
Discovering discrete algebraic rules from data is a fundamental challenge in machine learning. We formalize this problem through Cayley-table completion -- an algebraic counterpart to classical matrix completion -- where the degree of…
The general construction of lattice (co)homology assigns to a lattice $\mathbb{Z}^r$ and a weight function $w:\mathbb{Z}^r \to \mathbb{Z}$ a bigraded $\mathbb{Z}[U]$-module $\mathbb{H}_*$. The weight function $w$ is often obtained from some…
Width parameterizations of SAT, such as tree-width and path-width, enable the study of computationally more tractable and practical SAT instances. We give two simple algorithms. One that runs simultaneously in time-space…
The notion of covariant-contravariant refinement (CC-refinement, for short) is a generalization of the notions of bisimulation, simulation and refinement. This paper introduces CC-refinement modal $\mu$-calculus (CCRML$^{\mu}$) obtained…
Calibration strengthens the trustworthiness of black-box models by producing better accurate confidence estimates on given examples. However, little is known about if model explanations can help confidence calibration. Intuitively, humans…
Complex metrics are a double-edged sword: they allow one to replace singular spacetimes, such as those containing a big bang, with regular metrics, yet they can also describe unphysical solutions in which quantum transitions may be more…
We propose a path integral formulation for scale invariant quantum field theories. We do it by modifying the functional integration measure in such a way that the partition function is always exactly scale invariant, at the cost of having…
Determining whether an algorithmic decision-making system discriminates against a specific demographic typically involves comparing a single point estimate of a fairness metric against a predefined threshold. This practice is statistically…
To most applied statisticians, a fitting procedure's degrees of freedom is synonymous with its model complexity, or its capacity for overfitting to data. In particular, it is often used to parameterize the bias-variance tradeoff in model…
In his 1985 survey of notions of exchangeability, Aldous introduced a form of exchangeability corresponding to the symmetries of the infinite discrete cube, and asked whether these exchangeable probability measures enjoy a representation…
This article includes a survey of the historical development and theoretical structure of the pre-modern theory of magnitudes and numbers. In Part 1, work, insights and controversies related to quantity calculus from Euler onward are…
Formulating a Schubert problem as the solutions to a system of equations in either Pl\"ucker space or in the local coordinates of a Schubert cell typically involves more equations than variables. We present a novel primal-dual formulation…
Higher-dimensional theories provide a promising framework for unified extensions of the supersymmetric standard model. Compactifications to four dimensions often lead to U(1) symmetries beyond the standard model gauge group, whose breaking…
Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…
Given a von Neumann algebra $M$ equipped with a faithful normal strictly semifinite weight $\varphi$, we develop a notion of Murray-von Neumann dimension over $(M,\varphi)$ that is defined for modules over the basic construction associated…
Closure conversion is a program transformation at work in compilers for functional languages to turn inner functions into global ones, by building closures pairing the transformed functions with the environment of their free variables.…
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of linear programming problems and obtain, for each of these…