Related papers: Size matters in the modal $\mu$-calculus
Boundedness properties of operators associated with non-degenerate symmetric $\alpha$-stable, $\alpha \in (1,2)$, probability measures on $\mathbb{R}^d$ are investigated on appropriate, Euclidean or otherwise, $L^p$-spaces, $p \in…
Working in the context of $\mu$-abstract elementary classes ($\mu$-AECs) - or, equivalently, accessible categories with all morphisms monomorphisms - we examine the two natural notions of size that occur, namely cardinality of underlying…
Cosmological fine-tuning has traditionally been associated with the narrowness of the intervals in which the parameters of the physical models must be located to make life possible. A more thorough approach focuses on the probability of the…
Several clustering methods (e.g., Normalized Cut and Ratio Cut) divide the Min Cut cost function by a cluster dependent factor (e.g., the size or the degree of the clusters), in order to yield a more balanced partitioning. We, instead,…
The halfspace depth of a $d$-dimensional point $x$ with respect to a finite (or probability) Borel measure $\mu$ in $\mathbb{R}^d$ is defined as the infimum of the $\mu$-masses of all closed halfspaces containing $x$. A natural question is…
The 4-dimensional space-time is extended to pseudo-complex coordinates. Proposing the standard quantization rules in this extended space, the ones for the 4-dimensional sub-space acquire, as one solution, the commutation relations with…
In this dissertation we examine the relationships between the several hierarchies, including the complexity, $\mathrm{LUA}$ (Linearly Universal Avoidance), and shift complexity hierarchies, with an eye towards quantitative bounds on growth…
In this paper, we address the complexity barrier inherent in Fourier-Motzkin elimination (FME) and cylindrical algebraic decomposition (CAD) when eliminating a block of (existential) quantifiers. To mitigate this, we propose exploiting…
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…
We study the formula complexity of Iterated Sub-Permutation Matrix Multiplication, the logspace-complete problem of computing the product of $k$ $n$-by-$n$ Boolean matrices with at most a single $1$ in each row and column. For all $d \le…
In a quantum theory of gravity, the species scale $\Lambda_s$ can be defined as the scale at which corrections to the Einstein action become important or alternatively as codifying the "number of light degrees of freedom", due to the fact…
The computation of the dominant eigenpair for symmetric positive semidefinite matrices is fundamental in numerical optimization. This work shifts the paradigm from the classical Rayleigh quotient to an unconstrained difference formulation,…
The regular open subsets of a topological space form a Boolean algebra, where the `join' of two regular open sets is the interior of the closure of their union. A `credence' is a finitely additive probability measure on this Boolean…
Machine learning (ML) models are becoming increasingly common in the atmospheric science community with a wide range of applications. To enable users to understand what an ML model has learned, ML explainability has become a field of active…
Optimization problems over discrete or quantized variables are very challenging in general due to the combinatorial nature of their search space. Piecewise-affine regularization (PAR) provides a flexible modeling and computational framework…
Algorithmic fairness involves expressing notions such as equity, or reasonable treatment, as quantifiable measures that a machine learning algorithm can optimise. Most work in the literature to date has focused on classification problems…
A formula for the dimension of the space of cuspidal modular forms on $\Gamma_0(N)$ of weight $k$ ($k\ge2$ even) has been known for several decades. More recent but still well-known is the Atkin-Lehner decomposition of this space of cusp…
Comparing clusterings is central to evaluating unsupervised models, yet the many existing similarity measures can produce widely divergent, sometimes contradictory, evaluations. Clustering similarity measures are typically organized into…
This paper links sizes of model classes to the minimum lengths of their defining formulas, that is, to their description complexities. Limiting to models with a fixed domain of size n, we study description complexities with respect to the…
Castelnuovo-Mumford regularity and any extended degree function can be thought of as complexity measures for the structure of finitely generated graded modules. A recent result of Doering, Gunston, Vasconcelos shows that both can be…