Related papers: Limit Filters and Dependent Choice in Countable-Su…
We set up a strategy for studying large families of logarithmic conformal field theories by using the enlarged symmetries and non--semi-simple associative algebras appearing in their lattice regularizations (as discussed in a companion…
We consider infinite-horizon $\gamma$-discounted (linear) constrained Markov decision processes (CMDPs) where the objective is to find a policy that maximizes the expected cumulative reward subject to expected cumulative constraints. Given…
With the aggressive scaling of VLSI technology, the explosion of layout patterns creates a critical bottleneck for DFM applications like OPC. Pattern clustering is essential to reduce data complexity, yet existing methods struggle with…
The topology of a separable metrizable space $M$ is \emph{generated} by a family $\mathcal{C}$ of its subsets provided that a set $A\subseteq M$ is closed in $M$ if and only if $A\cap C$ is closed in $C$ for each $C\in \mathcal{C}$. The…
For consensus on measurement-based distributed filtering (CMDF), through infinite consensus fusion operations during each sampling interval, each node in the sensor network can achieve optimal filtering performance with centralized…
Model Predictive Control (MPC) is often tuned by trial and error. When a baseline linear controller exists that is already well tuned in the absence of constraints and MPC is introduced to enforce them, one would like to avoid altering the…
Filters (such as Bloom Filters) are data structures that speed up network routing and measurement operations by storing a compressed representation of a set. Filters are space efficient, but can make bounded one-sided errors: with tunable…
We study ultrafilters on regular uncountable cardinals, with a primary focus on $\omega_1$, and particularly in relation to the Tukey order on directed sets. Results include the independence from ZFC of the assertion that every uniform…
This paper contributes to the set-theoretic side of understanding Keisler's order. We consider properties of ultrafilters which affect saturation of unstable theories: the lower cofinality $\lcf(\aleph_0, \de)$ of $\aleph_0$ modulo $\de$,…
The notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of ZF between the ground model and the generic extension, and often the axiom of choice…
This paper addresses the consensus problem in homonymous distributed systems where processes are prone to crash failures and have no initial knowledge of the system membership ("homonymous" means that several processes may have the same…
While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…
We consider a broad class of first-order optimization algorithms which are \emph{oblivious}, in the sense that their step sizes are scheduled regardless of the function under consideration, except for limited side-information such as…
We study convergence of operator families of the form $A_\beta = A + \beta B$ towards an effective operator defined on $\ker(B)$, as the coupling constant $\beta$ tends to infinity. Crucially, we focus on the setting where neither $A$ nor…
The aim of the present paper is twofold. We study directed porosity in connection with conformal iterated function systems (CIFS) and with singular integrals. We prove that limit sets of finite CIFS are porous in a stronger sense than…
We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…
We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM). Applying this technique, we prove that any deterministic SFM algorithm on a ground set of…
Relative to class many supercompact cardinals, we construct a model of $\ZFC+\GCH$ where for every singular cardinal $\delta$ of countable cofinality and every regular uncountable $\mu<\delta$ there are stationarily many non-approachable…
We consider a class of "filtered" schemes for first order time dependent Hamilton-Jacobi equations and prove a general convergence result for this class of schemes. A typical filtered scheme is obtained mixing a high-order scheme and a…
Coherent quantum rollout for sequential decision problems requires a unitary simulator: randomness must live in explicit quantum registers, and basis-state selectors must be mapped to actions reversibly. With branch-dependent valid actions,…